oj.uz

Submission #886399

# Submission time Handle Problem Language Result Execution time Memory
886399 2023-12-12T03:19:46 Z NeroZein Carnival Tickets (IOI20_tickets) C++17
100 / 100
 551 ms 54572 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);       
    }
  }
  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 1 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 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 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 17 ms 2512 KB Output is correct
6 Correct 425 ms 51540 KB Output is correct

Subtask #3
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 1 ms 572 KB Output is correct
5 Correct 17 ms 2376 KB Output is correct
6 Correct 399 ms 52468 KB Output is correct
7 Correct 417 ms 52816 KB Output is correct
8 Correct 2 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 2064 KB Output is correct
14 Correct 14 ms 2140 KB Output is correct
15 Correct 425 ms 53524 KB Output is correct

Subtask #4
14.0 / 14.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 348 KB Output is correct
5 Correct 22 ms 2556 KB Output is correct
6 Correct 3 ms 600 KB Output is correct
7 Correct 4 ms 860 KB Output is correct
8 Correct 547 ms 54572 KB Output is correct
9 Correct 495 ms 50512 KB Output is correct
10 Correct 498 ms 50768 KB Output is correct
11 Correct 551 ms 54384 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 2 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 2 ms 344 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 2 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 18 ms 2392 KB Output is correct
14 Correct 18 ms 2396 KB Output is correct
15 Correct 19 ms 2396 KB Output is correct
16 Correct 21 ms 2396 KB Output is correct
17 Correct 1 ms 344 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 2396 KB Output is correct
21 Correct 19 ms 2396 KB Output is correct
22 Correct 19 ms 2396 KB Output is correct
23 Correct 20 ms 2392 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 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 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 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 17 ms 2512 KB Output is correct
12 Correct 425 ms 51540 KB Output is correct
13 Correct 0 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 572 KB Output is correct
17 Correct 17 ms 2376 KB Output is correct
18 Correct 399 ms 52468 KB Output is correct
19 Correct 417 ms 52816 KB Output is correct
20 Correct 2 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 2064 KB Output is correct
26 Correct 14 ms 2140 KB Output is correct
27 Correct 425 ms 53524 KB Output is correct
28 Correct 0 ms 344 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 348 KB Output is correct
32 Correct 22 ms 2556 KB Output is correct
33 Correct 3 ms 600 KB Output is correct
34 Correct 4 ms 860 KB Output is correct
35 Correct 547 ms 54572 KB Output is correct
36 Correct 495 ms 50512 KB Output is correct
37 Correct 498 ms 50768 KB Output is correct
38 Correct 551 ms 54384 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 2 ms 344 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 2 ms 348 KB Output is correct
43 Correct 2 ms 348 KB Output is correct
44 Correct 2 ms 348 KB Output is correct
45 Correct 1 ms 344 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 2 ms 348 KB Output is correct
48 Correct 2 ms 348 KB Output is correct
49 Correct 2 ms 344 KB Output is correct
50 Correct 2 ms 344 KB Output is correct
51 Correct 18 ms 2392 KB Output is correct
52 Correct 18 ms 2396 KB Output is correct
53 Correct 19 ms 2396 KB Output is correct
54 Correct 21 ms 2396 KB Output is correct
55 Correct 1 ms 344 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 2396 KB Output is correct
59 Correct 19 ms 2396 KB Output is correct
60 Correct 19 ms 2396 KB Output is correct
61 Correct 20 ms 2392 KB Output is correct
62 Correct 48 ms 5972 KB Output is correct
63 Correct 46 ms 5924 KB Output is correct
64 Correct 62 ms 6256 KB Output is correct
65 Correct 212 ms 23432 KB Output is correct
66 Correct 231 ms 23892 KB Output is correct
67 Correct 4 ms 860 KB Output is correct
68 Correct 4 ms 604 KB Output is correct
69 Correct 408 ms 51400 KB Output is correct
70 Correct 538 ms 52504 KB Output is correct
71 Correct 541 ms 54352 KB Output is correct
72 Correct 486 ms 52144 KB Output is correct
73 Correct 513 ms 52304 KB Output is correct
74 Correct 427 ms 50764 KB Output is correct
75 Correct 468 ms 50692 KB Output is correct