oj.uz

Submission #886397

# Submission time Handle Problem Language Result Execution time Memory
886397 2023-12-12T03:17:10 Z NeroZein Carnival Tickets (IOI20_tickets) C++17
100 / 100
 543 ms 76376 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();
  long long ret = 0; 
  priority_queue<pair<int, int>> pq;  
  for (int i = 0; i < n; ++i) {
    for (int j = m - 1; j >= m - k; --j) {
      ret += x[i][j]; 
    }
    pq.emplace(-x[i][0] - x[i][m - k], i);
  }
  int cnt = 0; 
  vector<int> t(n); 
  while (cnt < n * k / 2) {
    auto [val, ind] = pq.top();
    pq.pop();
    cnt++;
    ret += val;
    t[ind]++; 
    if (t[ind] < k) {
      pq.emplace(-x[ind][t[ind]] - x[ind][m - k + t[ind]], ind);       
    }
  }
  while (!pq.empty()) pq.pop(); 
  vector<int> c(n), c2(n); 
  for (int i = 0; i < n; ++i) {
    c2[i] = m - k + t[i];
  }
  vector<vector<int>> answer(n, vector<int> (m, -1));
  for (int round = 0; round < k; ++round) {
    vector<int> ord(n);
    iota(ord.begin(), ord.end(), 0); 
    sort(ord.begin(), ord.end(), [&](int i, int j) {
      return t[i] - c[i] > t[j] - c[j]; 
    });
    for (int j = 0, taken = 0; j < (int) ord.size(); ++j) {
      if (taken < n / 2) {
        answer[ord[j]][c[ord[j]]] = round;
        c[ord[j]]++; 
        taken++; 
      } else {
        answer[ord[j]][c2[ord[j]]] = round;
        c2[ord[j]]++; 
      }
    }
  }
  allocate_tickets(answer);
  return ret;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 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 344 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 344 KB Output is correct
5 Correct 16 ms 2396 KB Output is correct
6 Correct 384 ms 51408 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 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 348 KB Output is correct
5 Correct 16 ms 2652 KB Output is correct
6 Correct 388 ms 56844 KB Output is correct
7 Correct 449 ms 57072 KB Output is correct
8 Correct 2 ms 488 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 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 2424 KB Output is correct
15 Correct 404 ms 57872 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 20 ms 3312 KB Output is correct
6 Correct 3 ms 860 KB Output is correct
7 Correct 4 ms 1100 KB Output is correct
8 Correct 519 ms 76376 KB Output is correct
9 Correct 484 ms 70956 KB Output is correct
10 Correct 488 ms 71200 KB Output is correct
11 Correct 519 ms 76152 KB Output is correct

Subtask #5
12.0 / 12.0

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

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 448 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 17 ms 3160 KB Output is correct
14 Correct 16 ms 3160 KB Output is correct
15 Correct 18 ms 3160 KB Output is correct
16 Correct 20 ms 3408 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 18 ms 2800 KB Output is correct
21 Correct 19 ms 3156 KB Output is correct
22 Correct 19 ms 2904 KB Output is correct
23 Correct 20 ms 3156 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 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 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 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 16 ms 2396 KB Output is correct
12 Correct 384 ms 51408 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 16 ms 2652 KB Output is correct
18 Correct 388 ms 56844 KB Output is correct
19 Correct 449 ms 57072 KB Output is correct
20 Correct 2 ms 488 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 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 2424 KB Output is correct
27 Correct 404 ms 57872 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 20 ms 3312 KB Output is correct
33 Correct 3 ms 860 KB Output is correct
34 Correct 4 ms 1100 KB Output is correct
35 Correct 519 ms 76376 KB Output is correct
36 Correct 484 ms 70956 KB Output is correct
37 Correct 488 ms 71200 KB Output is correct
38 Correct 519 ms 76152 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 2 ms 448 KB Output is correct
43 Correct 2 ms 604 KB Output is correct
44 Correct 2 ms 604 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 2 ms 604 KB Output is correct
48 Correct 2 ms 604 KB Output is correct
49 Correct 2 ms 600 KB Output is correct
50 Correct 2 ms 604 KB Output is correct
51 Correct 17 ms 3160 KB Output is correct
52 Correct 16 ms 3160 KB Output is correct
53 Correct 18 ms 3160 KB Output is correct
54 Correct 20 ms 3408 KB Output is correct
55 Correct 1 ms 348 KB Output is correct
56 Correct 2 ms 604 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 18 ms 2800 KB Output is correct
59 Correct 19 ms 3156 KB Output is correct
60 Correct 19 ms 2904 KB Output is correct
61 Correct 20 ms 3156 KB Output is correct
62 Correct 44 ms 8532 KB Output is correct
63 Correct 44 ms 8532 KB Output is correct
64 Correct 58 ms 8532 KB Output is correct
65 Correct 199 ms 33108 KB Output is correct
66 Correct 224 ms 33760 KB Output is correct
67 Correct 4 ms 924 KB Output is correct
68 Correct 3 ms 860 KB Output is correct
69 Correct 391 ms 73168 KB Output is correct
70 Correct 499 ms 74092 KB Output is correct
71 Correct 514 ms 75960 KB Output is correct
72 Correct 454 ms 60496 KB Output is correct
73 Correct 543 ms 73476 KB Output is correct
74 Correct 408 ms 59220 KB Output is correct
75 Correct 489 ms 72020 KB Output is correct