oj.uz

Submission #390565

# Submission time Handle Problem Language Result Execution time Memory
390565 2021-04-16T10:27:36 Z AlexPop28 Carnival Tickets (IOI20_tickets) C++14
100 / 100
 838 ms 76028 KB 
#include "tickets.h"
#include <bits/stdc++.h>

using namespace std;

long long find_maximum(int k, vector<vector<int>> x) {
  int n = x.size();
  int m = x[0].size();
  vector<vector<int>> ans(n, vector<int>(m, -1));

  priority_queue<pair<int, int>> pq;
  for (int i = 0; i < n; ++i) {
    pq.emplace(x[i][m - 1] + x[i][k - 1], i); 
  }
  vector<int> pos(n, m - 1);
  vector<int> minus(n, k - 1);

  long long res = 0;
  for (int i = 0; i < n; ++i) for (int j = 0; j < k; ++j) res -= x[i][j];

  for (int it = 0; it < n * k / 2; ++it) {
    int val, i; tie(val, i) = pq.top(); pq.pop();
    --pos[i]; --minus[i];
    if (pos[i] >= m - k && minus[i] >= 0) pq.emplace(x[i][pos[i]] + x[i][minus[i]], i);
    res += val;
    // printf("val = %d, i = %d\n", val, i);
  }
  // cerr << res << endl;
  /*
  for (int i = 0; i < n; ++i) {
    // cerr << i << ": ";
    for (int j = 0; j <= k - (m - pos[i]); ++j) {
      res -= x[i][j];
      // cerr << j << ' ';
    }
    // cerr << endl;
  }
  */

  auto zeros = minus;
  vector<int> pos0(n), pos1(n);
  for (int i = 0; i < n; ++i) {
    pos[i] = max(pos[i], -1);
    pos0[i] = 0;
    pos1[i] = pos[i] + 1;
    zeros[i] += 1;
    // cerr << i << ' ' << zeros[i] << ' ' << pos1[i] << endl;
  }

  auto Comp = [&](int a, int b) {
    return zeros[a] > zeros[b];
  };
  
  vector<int> order(n);
  iota(order.begin(), order.end(), 0);
  for (int it = 0; it < k; ++it) {
    sort(order.begin(), order.end(), [&](int a, int b) {
      return zeros[a] > zeros[b];
    });

    int bal = 0;
    for (int i : order) {
      if (bal < n / 2) {
        ans[i][pos0[i]++] = it;
        --zeros[i];
        ++bal;
      } else {
        ans[i][pos1[i]++] = it;
      }
    }
  }

  allocate_tickets(ans);
  return res;
}

Compilation message

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:50:8: warning: variable 'Comp' set but not used [-Wunused-but-set-variable]
   50 |   auto Comp = [&](int a, int b) {
      |        ^~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 716 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Correct 26 ms 2304 KB Output is correct
6 Correct 630 ms 51324 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 2 ms 392 KB Output is correct
5 Correct 27 ms 2480 KB Output is correct
6 Correct 640 ms 56720 KB Output is correct
7 Correct 664 ms 57076 KB Output is correct
8 Correct 4 ms 460 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 7 ms 844 KB Output is correct
13 Correct 27 ms 2140 KB Output is correct
14 Correct 23 ms 2176 KB Output is correct
15 Correct 690 ms 57880 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Correct 34 ms 2420 KB Output is correct
6 Correct 5 ms 636 KB Output is correct
7 Correct 7 ms 888 KB Output is correct
8 Correct 836 ms 54288 KB Output is correct
9 Correct 766 ms 50508 KB Output is correct
10 Correct 765 ms 50668 KB Output is correct
11 Correct 837 ms 54212 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 3 ms 460 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 3 ms 460 KB Output is correct
6 Correct 3 ms 460 KB Output is correct
7 Correct 1 ms 304 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 3 ms 460 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 3 ms 436 KB Output is correct
12 Correct 3 ms 460 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 3 ms 460 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 3 ms 460 KB Output is correct
6 Correct 3 ms 460 KB Output is correct
7 Correct 1 ms 304 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 3 ms 460 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 3 ms 436 KB Output is correct
12 Correct 3 ms 460 KB Output is correct
13 Correct 28 ms 3172 KB Output is correct
14 Correct 27 ms 3148 KB Output is correct
15 Correct 32 ms 3244 KB Output is correct
16 Correct 32 ms 3268 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 3 ms 460 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 27 ms 2628 KB Output is correct
21 Correct 30 ms 3148 KB Output is correct
22 Correct 29 ms 2668 KB Output is correct
23 Correct 32 ms 3292 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 716 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 3 ms 332 KB Output is correct
11 Correct 26 ms 2304 KB Output is correct
12 Correct 630 ms 51324 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 2 ms 392 KB Output is correct
17 Correct 27 ms 2480 KB Output is correct
18 Correct 640 ms 56720 KB Output is correct
19 Correct 664 ms 57076 KB Output is correct
20 Correct 4 ms 460 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 7 ms 844 KB Output is correct
25 Correct 27 ms 2140 KB Output is correct
26 Correct 23 ms 2176 KB Output is correct
27 Correct 690 ms 57880 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 3 ms 332 KB Output is correct
32 Correct 34 ms 2420 KB Output is correct
33 Correct 5 ms 636 KB Output is correct
34 Correct 7 ms 888 KB Output is correct
35 Correct 836 ms 54288 KB Output is correct
36 Correct 766 ms 50508 KB Output is correct
37 Correct 765 ms 50668 KB Output is correct
38 Correct 837 ms 54212 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 2 ms 332 KB Output is correct
41 Correct 3 ms 460 KB Output is correct
42 Correct 3 ms 460 KB Output is correct
43 Correct 3 ms 460 KB Output is correct
44 Correct 3 ms 460 KB Output is correct
45 Correct 1 ms 304 KB Output is correct
46 Correct 1 ms 304 KB Output is correct
47 Correct 3 ms 460 KB Output is correct
48 Correct 3 ms 460 KB Output is correct
49 Correct 3 ms 436 KB Output is correct
50 Correct 3 ms 460 KB Output is correct
51 Correct 28 ms 3172 KB Output is correct
52 Correct 27 ms 3148 KB Output is correct
53 Correct 32 ms 3244 KB Output is correct
54 Correct 32 ms 3268 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 3 ms 460 KB Output is correct
57 Correct 2 ms 332 KB Output is correct
58 Correct 27 ms 2628 KB Output is correct
59 Correct 30 ms 3148 KB Output is correct
60 Correct 29 ms 2668 KB Output is correct
61 Correct 32 ms 3292 KB Output is correct
62 Correct 71 ms 8380 KB Output is correct
63 Correct 92 ms 8388 KB Output is correct
64 Correct 89 ms 8640 KB Output is correct
65 Correct 394 ms 33140 KB Output is correct
66 Correct 361 ms 33576 KB Output is correct
67 Correct 7 ms 972 KB Output is correct
68 Correct 6 ms 800 KB Output is correct
69 Correct 641 ms 73296 KB Output is correct
70 Correct 769 ms 74088 KB Output is correct
71 Correct 838 ms 76028 KB Output is correct
72 Correct 735 ms 60604 KB Output is correct
73 Correct 800 ms 73412 KB Output is correct
74 Correct 668 ms 59240 KB Output is correct
75 Correct 747 ms 71880 KB Output is correct