oj.uz

Submission #387479

# Submission time Handle Problem Language Result Execution time Memory
387479 2021-04-08T13:50:28 Z WLZ Carnival Tickets (IOI20_tickets) C++14
100 / 100
 841 ms 76396 KB 
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;

long long find_maximum(int k, vector< vector<int> > x) {
  int n = (int) x.size(), m = (int) x[0].size();
  long long ans = 0;
  vector<int> ptr1(n, k - 1), ptr2(n, m);
  priority_queue< pair<int, int> > pq;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < k; j++) ans -= x[i][j];
    pq.push({x[i][ptr1[i]] + x[i][ptr2[i] - 1], i});    
  }
  for (int i = 0; i < k * n / 2; i++) {
    ans += pq.top().first;
    int idx = pq.top().second;
    pq.pop();
    ptr1[idx]--; ptr2[idx]--;
    if (ptr1[idx] >= 0) pq.push({x[idx][ptr1[idx]] + x[idx][ptr2[idx] - 1], idx});
  }
  vector< vector<int> > s(n, vector<int>(m, -1));
  vector<int> v(n);
  iota(v.begin(), v.end(), 0);
  for (int i = 0; i < k; i++) {
    sort(v.begin(), v.end(), [&](int a, int b) {
      return ptr1[a] > ptr1[b];
    });
    for (int j = 0; j < n / 2; j++) {
      s[v[j]][ptr1[v[j]]--] = i;
    }
    for (int j = n / 2; j < n; j++) {
      s[v[j]][ptr2[v[j]]++] = i;
    }
  }
  allocate_tickets(s);
  return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 748 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 27 ms 2412 KB Output is correct
6 Correct 627 ms 51656 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 26 ms 2412 KB Output is correct
6 Correct 636 ms 52460 KB Output is correct
7 Correct 667 ms 52864 KB Output is correct
8 Correct 4 ms 620 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 7 ms 876 KB Output is correct
13 Correct 23 ms 2028 KB Output is correct
14 Correct 23 ms 2028 KB Output is correct
15 Correct 685 ms 53356 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 33 ms 2540 KB Output is correct
6 Correct 7 ms 620 KB Output is correct
7 Correct 7 ms 876 KB Output is correct
8 Correct 834 ms 54484 KB Output is correct
9 Correct 776 ms 71108 KB Output is correct
10 Correct 771 ms 71388 KB Output is correct
11 Correct 841 ms 76396 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 3 ms 492 KB Output is correct
3 Correct 3 ms 492 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 3 ms 492 KB Output is correct
6 Correct 3 ms 492 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 3 ms 492 KB Output is correct
10 Correct 3 ms 492 KB Output is correct
11 Correct 3 ms 492 KB Output is correct
12 Correct 3 ms 492 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 3 ms 492 KB Output is correct
3 Correct 3 ms 492 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 3 ms 492 KB Output is correct
6 Correct 3 ms 492 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 3 ms 492 KB Output is correct
10 Correct 3 ms 492 KB Output is correct
11 Correct 3 ms 492 KB Output is correct
12 Correct 3 ms 492 KB Output is correct
13 Correct 26 ms 2540 KB Output is correct
14 Correct 26 ms 2540 KB Output is correct
15 Correct 29 ms 2540 KB Output is correct
16 Correct 34 ms 2688 KB Output is correct
17 Correct 2 ms 364 KB Output is correct
18 Correct 3 ms 620 KB Output is correct
19 Correct 2 ms 492 KB Output is correct
20 Correct 29 ms 2540 KB Output is correct
21 Correct 29 ms 2540 KB Output is correct
22 Correct 31 ms 2540 KB Output is correct
23 Correct 31 ms 2540 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 748 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 3 ms 492 KB Output is correct
11 Correct 27 ms 2412 KB Output is correct
12 Correct 627 ms 51656 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 3 ms 492 KB Output is correct
17 Correct 26 ms 2412 KB Output is correct
18 Correct 636 ms 52460 KB Output is correct
19 Correct 667 ms 52864 KB Output is correct
20 Correct 4 ms 620 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 7 ms 876 KB Output is correct
25 Correct 23 ms 2028 KB Output is correct
26 Correct 23 ms 2028 KB Output is correct
27 Correct 685 ms 53356 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 3 ms 492 KB Output is correct
32 Correct 33 ms 2540 KB Output is correct
33 Correct 7 ms 620 KB Output is correct
34 Correct 7 ms 876 KB Output is correct
35 Correct 834 ms 54484 KB Output is correct
36 Correct 776 ms 71108 KB Output is correct
37 Correct 771 ms 71388 KB Output is correct
38 Correct 841 ms 76396 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 3 ms 492 KB Output is correct
41 Correct 3 ms 492 KB Output is correct
42 Correct 3 ms 492 KB Output is correct
43 Correct 3 ms 492 KB Output is correct
44 Correct 3 ms 492 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 3 ms 492 KB Output is correct
48 Correct 3 ms 492 KB Output is correct
49 Correct 3 ms 492 KB Output is correct
50 Correct 3 ms 492 KB Output is correct
51 Correct 26 ms 2540 KB Output is correct
52 Correct 26 ms 2540 KB Output is correct
53 Correct 29 ms 2540 KB Output is correct
54 Correct 34 ms 2688 KB Output is correct
55 Correct 2 ms 364 KB Output is correct
56 Correct 3 ms 620 KB Output is correct
57 Correct 2 ms 492 KB Output is correct
58 Correct 29 ms 2540 KB Output is correct
59 Correct 29 ms 2540 KB Output is correct
60 Correct 31 ms 2540 KB Output is correct
61 Correct 31 ms 2540 KB Output is correct
62 Correct 73 ms 8448 KB Output is correct
63 Correct 74 ms 8428 KB Output is correct
64 Correct 91 ms 8684 KB Output is correct
65 Correct 323 ms 33260 KB Output is correct
66 Correct 369 ms 33772 KB Output is correct
67 Correct 7 ms 1004 KB Output is correct
68 Correct 8 ms 896 KB Output is correct
69 Correct 642 ms 73320 KB Output is correct
70 Correct 735 ms 74240 KB Output is correct
71 Correct 836 ms 76140 KB Output is correct
72 Correct 731 ms 60652 KB Output is correct
73 Correct 805 ms 73576 KB Output is correct
74 Correct 665 ms 59320 KB Output is correct
75 Correct 738 ms 72100 KB Output is correct