oj.uz

Submission #318630

# Submission time Handle Problem Language Result Execution time Memory
318630 2020-11-02T14:21:59 Z nikatamliani Carnival Tickets (IOI20_tickets) C++14
100 / 100
 1123 ms 86116 KB 
#include <bits/stdc++.h>
#include "tickets.h"
using namespace std;
#define ll long long
ll find_maximum(int k, vector < vector < int > > x) {
    #define f first
    #define s second
    int n = x.size();
    int m = x[0].size();
    vector < pair < int, int > > L(n);
    stack < int > s[n], candidates[n];
    priority_queue < pair < int, int > > q;
    ll answer = 0; 
    for(int p = 0; p < n; ++p) {
        L[p].s = p; 
        for(int i = m - 1; i >= m - k; --i) {
            s[p].push(x[p][i]);
            answer += x[p][i];
        }
        for(int i = m - 1; i >= 0; --i) {
            candidates[p].push(x[p][i]); 
        }
        if(!s[p].empty() && !candidates[p].empty()) {
            q.push({-(s[p].top() + candidates[p].top()), p});
        }
    }
    for(int rep = 0; rep < n * k / 2; ++rep) {
        assert(q.size() > 0);
        auto [x, y] = q.top();
        q.pop();
        s[y].pop();
        candidates[y].pop();
        answer += x; 
        ++L[y].f;
        if(!s[y].empty() && !candidates[y].empty()) {
            q.push({-(s[y].top() + candidates[y].top()), y});
        }
    }
    vector < vector < int > > less(n, vector < int >()), more(n, vector < int >());
    for(int i = 0; i < n; ++i) {
        for(int j = 0; j < L[i].f; ++j) {
            less[i].push_back(j);
        }
        for(int j = m - (k - L[i].f); j < m; ++j) {
            more[i].push_back(j);
        }
    }
    vector < vector < int > > ans(n, vector < int > (m, -1));
    for(int i = 0; i < k; ++i) {
        sort(L.rbegin(), L.rend());
        for(int j = 0; j < n / 2; ++j) {
            assert(L[j].f > 0);
            assert(less[L[j].s].size() > 0);
            ans[L[j].second][less[L[j].s].back()] = i;
            --L[j].f;
            less[L[j].s].pop_back();
        }
        for(int j = n / 2; j < n; ++j) {
            assert(more[L[j].s].size() > 0);
            ans[L[j].second][more[L[j].s].back()] = i;
            more[L[j].s].pop_back();
        }
    }
    allocate_tickets(ans);
    return answer;
}
// int main() {
//     cout << find_maximum(1, {{5, 9}, {1, 4}, {3, 6}, {2, 7}}) << '\n';
// }

Compilation message

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:29:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   29 |         auto [x, y] = q.top();
      |              ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 876 KB Output is correct
6 Correct 3 ms 2924 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 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 620 KB Output is correct
5 Correct 28 ms 3180 KB Output is correct
6 Correct 678 ms 62308 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 2 ms 620 KB Output is correct
5 Correct 28 ms 3428 KB Output is correct
6 Correct 722 ms 70372 KB Output is correct
7 Correct 776 ms 75372 KB Output is correct
8 Correct 4 ms 748 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 8 ms 1132 KB Output is correct
13 Correct 25 ms 3172 KB Output is correct
14 Correct 25 ms 2936 KB Output is correct
15 Correct 814 ms 80024 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 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 620 KB Output is correct
5 Correct 38 ms 4068 KB Output is correct
6 Correct 6 ms 876 KB Output is correct
7 Correct 10 ms 3052 KB Output is correct
8 Correct 1073 ms 86116 KB Output is correct
9 Correct 1037 ms 79076 KB Output is correct
10 Correct 1046 ms 78380 KB Output is correct
11 Correct 1123 ms 83940 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 2 ms 620 KB Output is correct
3 Correct 3 ms 748 KB Output is correct
4 Correct 3 ms 620 KB Output is correct
5 Correct 3 ms 748 KB Output is correct
6 Correct 3 ms 620 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 3 ms 620 KB Output is correct
10 Correct 3 ms 620 KB Output is correct
11 Correct 3 ms 620 KB Output is correct
12 Correct 3 ms 620 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 2 ms 620 KB Output is correct
3 Correct 3 ms 748 KB Output is correct
4 Correct 3 ms 620 KB Output is correct
5 Correct 3 ms 748 KB Output is correct
6 Correct 3 ms 620 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 3 ms 620 KB Output is correct
10 Correct 3 ms 620 KB Output is correct
11 Correct 3 ms 620 KB Output is correct
12 Correct 3 ms 620 KB Output is correct
13 Correct 28 ms 3212 KB Output is correct
14 Correct 30 ms 3180 KB Output is correct
15 Correct 33 ms 3308 KB Output is correct
16 Correct 40 ms 4076 KB Output is correct
17 Correct 2 ms 364 KB Output is correct
18 Correct 3 ms 1004 KB Output is correct
19 Correct 2 ms 876 KB Output is correct
20 Correct 31 ms 3300 KB Output is correct
21 Correct 33 ms 3172 KB Output is correct
22 Correct 34 ms 3692 KB Output is correct
23 Correct 36 ms 3684 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 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 876 KB Output is correct
6 Correct 3 ms 2924 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 3 ms 620 KB Output is correct
11 Correct 28 ms 3180 KB Output is correct
12 Correct 678 ms 62308 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 0 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 2 ms 620 KB Output is correct
17 Correct 28 ms 3428 KB Output is correct
18 Correct 722 ms 70372 KB Output is correct
19 Correct 776 ms 75372 KB Output is correct
20 Correct 4 ms 748 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 8 ms 1132 KB Output is correct
25 Correct 25 ms 3172 KB Output is correct
26 Correct 25 ms 2936 KB Output is correct
27 Correct 814 ms 80024 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 0 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 3 ms 620 KB Output is correct
32 Correct 38 ms 4068 KB Output is correct
33 Correct 6 ms 876 KB Output is correct
34 Correct 10 ms 3052 KB Output is correct
35 Correct 1073 ms 86116 KB Output is correct
36 Correct 1037 ms 79076 KB Output is correct
37 Correct 1046 ms 78380 KB Output is correct
38 Correct 1123 ms 83940 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 2 ms 620 KB Output is correct
41 Correct 3 ms 748 KB Output is correct
42 Correct 3 ms 620 KB Output is correct
43 Correct 3 ms 748 KB Output is correct
44 Correct 3 ms 620 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 1 ms 492 KB Output is correct
47 Correct 3 ms 620 KB Output is correct
48 Correct 3 ms 620 KB Output is correct
49 Correct 3 ms 620 KB Output is correct
50 Correct 3 ms 620 KB Output is correct
51 Correct 28 ms 3212 KB Output is correct
52 Correct 30 ms 3180 KB Output is correct
53 Correct 33 ms 3308 KB Output is correct
54 Correct 40 ms 4076 KB Output is correct
55 Correct 2 ms 364 KB Output is correct
56 Correct 3 ms 1004 KB Output is correct
57 Correct 2 ms 876 KB Output is correct
58 Correct 31 ms 3300 KB Output is correct
59 Correct 33 ms 3172 KB Output is correct
60 Correct 34 ms 3692 KB Output is correct
61 Correct 36 ms 3684 KB Output is correct
62 Correct 77 ms 7524 KB Output is correct
63 Correct 77 ms 7520 KB Output is correct
64 Correct 105 ms 9060 KB Output is correct
65 Correct 384 ms 31328 KB Output is correct
66 Correct 453 ms 37860 KB Output is correct
67 Correct 11 ms 3180 KB Output is correct
68 Correct 6 ms 876 KB Output is correct
69 Correct 687 ms 62308 KB Output is correct
70 Correct 848 ms 73448 KB Output is correct
71 Correct 1063 ms 85988 KB Output is correct
72 Correct 984 ms 80868 KB Output is correct
73 Correct 1056 ms 80228 KB Output is correct
74 Correct 792 ms 71476 KB Output is correct
75 Correct 871 ms 71048 KB Output is correct