oj.uz

Submission #900511

# Submission time Handle Problem Language Result Execution time Memory
900511 2024-01-08T11:53:10 Z nguyentunglam Carnival Tickets (IOI20_tickets) C++17
100 / 100
 514 ms 76276 KB 
#include<bits/stdc++.h>
#include "tickets.h"
#define fi first
#define se second
#define endl "\n"
#define ii pair<int, int>
using namespace std;

#ifdef ngu
void allocate_tickets(vector<vector<int> > x) {
  for(auto &i : x) {
    for(auto &j : i) cout << j << " "; cout << endl;
  }
}
#endif // ngu

long long find_maximum (int k, vector<vector<int> > x) {
  int n = x.size();
  int m = x[0].size();
  vector<int> l(n + 2), r(n + 2);
  vector<vector<int> > answer(n, vector<int> (m));
  long long ans = 0;
  priority_queue<pair<int, int> > q;
  for(int i = 0; i < n; i++) {
    l[i] = k - 1; r[i] = m - 1;
    for(int j = 0; j < k; j++) ans -= x[i][j];
    q.push({x[i][r[i]] + x[i][l[i]], i});
  }

  for(int loop = 1; loop <= n / 2 * k; loop++) {
    assert(q.size() >= 1);
    int cost, i; tie(cost, i) = q.top(); q.pop();
    ans += cost;
    l[i]--; r[i]--;
    if (l[i] >= 0) q.push({x[i][r[i]] + x[i][l[i]], i});
  }

  vector<int> order(n);

  for(int i = 0; i < n; i++) {
    r[i]++;
    order[i] = i;
  }

  int mn = 1e9, mx = -1e9;

  for(int i = 0; i < n; i++) {
    if (l[i] >= 0) mx = max(mx, x[i][l[i]]);
    if (r[i] < m) mn = min(mn, x[i][r[i]]);
  }

  assert(mx <= mn);

  for(int i = 0; i < n; i++) for(int j = 0; j < m; j++) answer[i][j] = -1;

  for(int round = 0; round < k; round++) {
    sort(order.begin(), order.begin() + n, [&] (const int &x, const int &y) {
      return r[x] < r[y];
         });
    for(int cur = 0; cur < n / 2; cur++) {
      int i = order[cur];
      assert(r[i] < m);
      answer[i][r[i]] = round;
      r[i]++;
    }
    for(int cur = n / 2; cur < n; cur++) {
      int i = order[cur];
      assert(l[i] >= 0);
      answer[i][l[i]] = round;
      l[i]--;
    }
  }
  allocate_tickets(answer);
  return ans;
}

#ifdef ngu
int main() {

  freopen ("task.inp", "r", stdin);
  freopen ("task.out", "w", stdout);

  int n, m, k; cin >> n >> m >> k;

  vector<vector<int> > x(n, vector<int> (m));

  for(int i = 0; i < n; i++) for(int j = 0; j < m; j++) cin >> x[i][j];

  cout << find_maximum(k, x);
}
#endif // ngu

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 860 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 16 ms 2360 KB Output is correct
6 Correct 386 ms 51304 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 15 ms 2652 KB Output is correct
6 Correct 364 ms 56876 KB Output is correct
7 Correct 384 ms 57084 KB Output is correct
8 Correct 3 ms 604 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 4 ms 860 KB Output is correct
13 Correct 14 ms 2140 KB Output is correct
14 Correct 16 ms 2232 KB Output is correct
15 Correct 402 ms 57680 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 19 ms 3236 KB Output is correct
6 Correct 3 ms 860 KB Output is correct
7 Correct 5 ms 1116 KB Output is correct
8 Correct 511 ms 76072 KB Output is correct
9 Correct 492 ms 71092 KB Output is correct
10 Correct 486 ms 70996 KB Output is correct
11 Correct 514 ms 76276 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 1 ms 508 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 2 ms 448 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 600 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 1 ms 508 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 2 ms 448 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 600 KB Output is correct
13 Correct 16 ms 3276 KB Output is correct
14 Correct 16 ms 3160 KB Output is correct
15 Correct 17 ms 3416 KB Output is correct
16 Correct 20 ms 3420 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 2 ms 800 KB Output is correct
19 Correct 1 ms 444 KB Output is correct
20 Correct 18 ms 2676 KB Output is correct
21 Correct 18 ms 3156 KB Output is correct
22 Correct 18 ms 2652 KB Output is correct
23 Correct 25 ms 3140 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 16 ms 2360 KB Output is correct
12 Correct 386 ms 51304 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 15 ms 2652 KB Output is correct
18 Correct 364 ms 56876 KB Output is correct
19 Correct 384 ms 57084 KB Output is correct
20 Correct 3 ms 604 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 4 ms 860 KB Output is correct
25 Correct 14 ms 2140 KB Output is correct
26 Correct 16 ms 2232 KB Output is correct
27 Correct 402 ms 57680 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 2 ms 604 KB Output is correct
32 Correct 19 ms 3236 KB Output is correct
33 Correct 3 ms 860 KB Output is correct
34 Correct 5 ms 1116 KB Output is correct
35 Correct 511 ms 76072 KB Output is correct
36 Correct 492 ms 71092 KB Output is correct
37 Correct 486 ms 70996 KB Output is correct
38 Correct 514 ms 76276 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 2 ms 348 KB Output is correct
41 Correct 2 ms 348 KB Output is correct
42 Correct 1 ms 508 KB Output is correct
43 Correct 2 ms 604 KB Output is correct
44 Correct 2 ms 604 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 1 ms 604 KB Output is correct
48 Correct 2 ms 448 KB Output is correct
49 Correct 2 ms 376 KB Output is correct
50 Correct 2 ms 600 KB Output is correct
51 Correct 16 ms 3276 KB Output is correct
52 Correct 16 ms 3160 KB Output is correct
53 Correct 17 ms 3416 KB Output is correct
54 Correct 20 ms 3420 KB Output is correct
55 Correct 1 ms 344 KB Output is correct
56 Correct 2 ms 800 KB Output is correct
57 Correct 1 ms 444 KB Output is correct
58 Correct 18 ms 2676 KB Output is correct
59 Correct 18 ms 3156 KB Output is correct
60 Correct 18 ms 2652 KB Output is correct
61 Correct 25 ms 3140 KB Output is correct
62 Correct 43 ms 8464 KB Output is correct
63 Correct 43 ms 8476 KB Output is correct
64 Correct 56 ms 8612 KB Output is correct
65 Correct 205 ms 33352 KB Output is correct
66 Correct 229 ms 33700 KB Output is correct
67 Correct 4 ms 1112 KB Output is correct
68 Correct 3 ms 860 KB Output is correct
69 Correct 383 ms 73220 KB Output is correct
70 Correct 453 ms 74176 KB Output is correct
71 Correct 511 ms 76148 KB Output is correct
72 Correct 466 ms 60788 KB Output is correct
73 Correct 509 ms 73436 KB Output is correct
74 Correct 407 ms 59224 KB Output is correct
75 Correct 442 ms 72032 KB Output is correct