competitive-programming/neps/neps265.cpp at main · oldirtty/competitive-programming · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
/*
 * Contest : Neps
 * Problem : 265 - Telemarketing
 * Link    : https://neps.academy/br/exercise/265
 */

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#define fastio ios::sync_with_stdio(0); cin.tie(0);

int main() {
  fastio

  int n, l;
  cin >> n >> l;

  vector<int> cont(n + 1, 0);
  vector<int> tempo(n + 1, 0);

  queue<int> vendedores,
      ligacoes;

  for (int i = 1; i <= n; i++)
    vendedores.push(i); // todos vendedores inativos

  for (int i = 0; i < l; i++) {
    int t; cin >> t;
    ligacoes.push(t);
  }

  // O(N)
  for (int i = 1; i <= n && !ligacoes.empty(); i++) {
    int id = vendedores.front();

    tempo[id] = ligacoes.front();
    cont[id]++;

    ligacoes.pop();
    vendedores.pop();
  }

  // O(L)
  while (!ligacoes.empty()) {
    if (!vendedores.empty()) {
      int id = vendedores.front();

      tempo[id] = ligacoes.front();
      cont[id]++;

      ligacoes.pop();
      vendedores.pop();
    }
    else {
      // O(N)
      int menorTempo = 31;
      for (int i = 1; i <= n; i++) menorTempo = min(menorTempo, tempo[i]);

      for (int i = 1; i <= n; i++) {
        tempo[i] -= menorTempo;
        if (tempo[i] == 0) // vendedor esta livre
          vendedores.push(i);
      }
    }
  }

  for (int i = 1; i <= n; i++) cout << i << ' ' << cont[i] << '\n';

  return 0;
}