oj.uz

Submission #930815

# Submission time Handle Problem Language Result Execution time Memory
930815 2024-02-20T13:02:27 Z JooDdae Carnival Tickets (IOI20_tickets) C++17
100 / 100
 782 ms 76220 KB 
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

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

    ll ans = 0;
    priority_queue<array<int, 2>> pq;
    vector<int> c(n, 0);
    for(int i=0;i<n;i++) {
        for(int j=0;j<k;j++) ans -= x[i][j];
        pq.push({x[i][m-1]+x[i][k-1], i});
    }

    for(int i=0;i<n*k/2;i++) {
        auto [C, u] = pq.top(); pq.pop();
        ans += C;
        if(++c[u] == k) continue;
        pq.push({x[u][m-1-c[u]]+x[u][k-1-c[u]], u});
    }
    while(!pq.empty()) pq.pop();


    vector<int> L(n, 0), R(n, 0);
    for(int i=0;i<n;i++) R[i] = m-c[i];
    for(int i=0;i<n;i++) c[i] = k-c[i], pq.push({c[i], i});

    vector<vector<int>> re(n, vector<int>(m, -1));
    for(int i=0;i<k;i++) {
        set<int> s;
        for(int j=0;j<n/2;j++) s.insert(pq.top()[1]), pq.pop();

        for(int j=0;j<n;j++) {
            if(s.count(j)) re[j][L[j]++] = i;
            else re[j][R[j]++] = i;
        }

        for(auto x : s) pq.push({--c[x], x});
    }


    allocate_tickets(re);
    return ans;
}

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 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 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 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 17 ms 2392 KB Output is correct
6 Correct 377 ms 51556 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 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 18 ms 2488 KB Output is correct
6 Correct 499 ms 56816 KB Output is correct
7 Correct 565 ms 57492 KB Output is correct
8 Correct 3 ms 600 KB Output is correct
9 Correct 1 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 6 ms 860 KB Output is correct
13 Correct 22 ms 2140 KB Output is correct
14 Correct 18 ms 2276 KB Output is correct
15 Correct 581 ms 57900 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 1 ms 348 KB Output is correct
4 Correct 2 ms 600 KB Output is correct
5 Correct 26 ms 3248 KB Output is correct
6 Correct 4 ms 856 KB Output is correct
7 Correct 6 ms 1112 KB Output is correct
8 Correct 735 ms 70888 KB Output is correct
9 Correct 731 ms 66336 KB Output is correct
10 Correct 737 ms 66504 KB Output is correct
11 Correct 782 ms 71292 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 3 ms 604 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 440 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 604 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 1 ms 348 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 3 ms 604 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 440 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 604 KB Output is correct
12 Correct 2 ms 600 KB Output is correct
13 Correct 20 ms 3164 KB Output is correct
14 Correct 17 ms 3164 KB Output is correct
15 Correct 21 ms 3160 KB Output is correct
16 Correct 26 ms 3408 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 23 ms 2648 KB Output is correct
21 Correct 29 ms 3156 KB Output is correct
22 Correct 27 ms 2608 KB Output is correct
23 Correct 27 ms 3160 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 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 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 600 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 17 ms 2392 KB Output is correct
12 Correct 377 ms 51556 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 18 ms 2488 KB Output is correct
18 Correct 499 ms 56816 KB Output is correct
19 Correct 565 ms 57492 KB Output is correct
20 Correct 3 ms 600 KB Output is correct
21 Correct 1 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 6 ms 860 KB Output is correct
25 Correct 22 ms 2140 KB Output is correct
26 Correct 18 ms 2276 KB Output is correct
27 Correct 581 ms 57900 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 2 ms 600 KB Output is correct
32 Correct 26 ms 3248 KB Output is correct
33 Correct 4 ms 856 KB Output is correct
34 Correct 6 ms 1112 KB Output is correct
35 Correct 735 ms 70888 KB Output is correct
36 Correct 731 ms 66336 KB Output is correct
37 Correct 737 ms 66504 KB Output is correct
38 Correct 782 ms 71292 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 604 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
42 Correct 3 ms 604 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 440 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 604 KB Output is correct
50 Correct 2 ms 600 KB Output is correct
51 Correct 20 ms 3164 KB Output is correct
52 Correct 17 ms 3164 KB Output is correct
53 Correct 21 ms 3160 KB Output is correct
54 Correct 26 ms 3408 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 23 ms 2648 KB Output is correct
59 Correct 29 ms 3156 KB Output is correct
60 Correct 27 ms 2608 KB Output is correct
61 Correct 27 ms 3160 KB Output is correct
62 Correct 45 ms 8532 KB Output is correct
63 Correct 50 ms 8532 KB Output is correct
64 Correct 76 ms 8680 KB Output is correct
65 Correct 242 ms 33272 KB Output is correct
66 Correct 307 ms 33568 KB Output is correct
67 Correct 6 ms 1116 KB Output is correct
68 Correct 4 ms 860 KB Output is correct
69 Correct 393 ms 73292 KB Output is correct
70 Correct 548 ms 74048 KB Output is correct
71 Correct 729 ms 76220 KB Output is correct
72 Correct 677 ms 60580 KB Output is correct
73 Correct 705 ms 73424 KB Output is correct
74 Correct 535 ms 59112 KB Output is correct
75 Correct 602 ms 72052 KB Output is correct