Submission #576769

# Submission time Handle Problem Language Result Execution time Memory
576769 2022-06-13T12:28:56 Z SlavicG Carnival Tickets (IOI20_tickets) C++17
100 / 100
813 ms 55492 KB
#include "bits/stdc++.h"
#include "tickets.h"
using namespace std;

#define ll long long
#define sz(a) (int)a.size()
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define forn(i, n) for(int i=0;i < n; ++i)

long long find_maximum(int k, std::vector<std::vector<int>> x) {
    int n = x.size();
    int m = x[0].size();
    std::vector<std::vector<int>> answer(n, vector<int>(m, -1));
    vector<int> use_left(n, 0), l(n, 0), r(n, m - 1);
    set<pair<int, int>> s;

    ll ans = 0;
    for(int i = 0; i < n; ++i) {
        s.insert({x[i][0] + x[i][m - k], i});
    }

    for(int t = 0; t < n * k / 2; ++t) {
        int i = (*s.begin()).second; s.erase(s.begin());
        if(++use_left[i] < k) {
            s.insert({x[i][use_left[i]] + x[i][m - k + use_left[i]], i});
        }
    }

    for(int kk = 0; kk < k; ++kk) {
        vector<pair<int, int>> a;
        for(int i = 0; i < n; ++i) a.pb({use_left[i], i});
        sort(rall(a));
        for(int j = 0; j < n / 2; ++j) {
            int i = a[j].second;
            assert(use_left[i]);
            ans -= x[i][use_left[i] - 1];
            answer[i][use_left[i] - 1] = kk;
            --use_left[i];
        }
        for(int j = n / 2; j < n; ++j) {
            int i = a[j].second;
            ans += x[i][r[i]];
            answer[i][r[i]] = kk;
            --r[i];
        }
    }

    allocate_tickets(answer);
    return ans;
}

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 724 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 448 KB Output is correct
5 Correct 18 ms 2388 KB Output is correct
6 Correct 474 ms 51468 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 22 ms 2508 KB Output is correct
6 Correct 469 ms 54288 KB Output is correct
7 Correct 520 ms 54580 KB Output is correct
8 Correct 3 ms 468 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 6 ms 820 KB Output is correct
13 Correct 18 ms 2104 KB Output is correct
14 Correct 17 ms 2104 KB Output is correct
15 Correct 543 ms 55196 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 31 ms 2428 KB Output is correct
6 Correct 4 ms 596 KB Output is correct
7 Correct 7 ms 852 KB Output is correct
8 Correct 777 ms 54356 KB Output is correct
9 Correct 746 ms 50600 KB Output is correct
10 Correct 758 ms 50764 KB Output is correct
11 Correct 774 ms 54316 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 3 ms 340 KB Output is correct
10 Correct 2 ms 440 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 3 ms 468 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 3 ms 340 KB Output is correct
10 Correct 2 ms 440 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 3 ms 468 KB Output is correct
13 Correct 20 ms 3140 KB Output is correct
14 Correct 22 ms 3136 KB Output is correct
15 Correct 27 ms 3148 KB Output is correct
16 Correct 31 ms 3256 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 3 ms 468 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 24 ms 2580 KB Output is correct
21 Correct 27 ms 3156 KB Output is correct
22 Correct 28 ms 2576 KB Output is correct
23 Correct 28 ms 3192 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 724 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 2 ms 448 KB Output is correct
11 Correct 18 ms 2388 KB Output is correct
12 Correct 474 ms 51468 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 304 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 22 ms 2508 KB Output is correct
18 Correct 469 ms 54288 KB Output is correct
19 Correct 520 ms 54580 KB Output is correct
20 Correct 3 ms 468 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 6 ms 820 KB Output is correct
25 Correct 18 ms 2104 KB Output is correct
26 Correct 17 ms 2104 KB Output is correct
27 Correct 543 ms 55196 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 2 ms 340 KB Output is correct
32 Correct 31 ms 2428 KB Output is correct
33 Correct 4 ms 596 KB Output is correct
34 Correct 7 ms 852 KB Output is correct
35 Correct 777 ms 54356 KB Output is correct
36 Correct 746 ms 50600 KB Output is correct
37 Correct 758 ms 50764 KB Output is correct
38 Correct 774 ms 54316 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 2 ms 340 KB Output is correct
41 Correct 2 ms 340 KB Output is correct
42 Correct 2 ms 340 KB Output is correct
43 Correct 2 ms 340 KB Output is correct
44 Correct 3 ms 340 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 3 ms 340 KB Output is correct
48 Correct 2 ms 440 KB Output is correct
49 Correct 2 ms 468 KB Output is correct
50 Correct 3 ms 468 KB Output is correct
51 Correct 20 ms 3140 KB Output is correct
52 Correct 22 ms 3136 KB Output is correct
53 Correct 27 ms 3148 KB Output is correct
54 Correct 31 ms 3256 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 3 ms 468 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 24 ms 2580 KB Output is correct
59 Correct 27 ms 3156 KB Output is correct
60 Correct 28 ms 2576 KB Output is correct
61 Correct 28 ms 3192 KB Output is correct
62 Correct 55 ms 7980 KB Output is correct
63 Correct 53 ms 7988 KB Output is correct
64 Correct 88 ms 8092 KB Output is correct
65 Correct 301 ms 25684 KB Output is correct
66 Correct 360 ms 26312 KB Output is correct
67 Correct 7 ms 980 KB Output is correct
68 Correct 5 ms 724 KB Output is correct
69 Correct 473 ms 52648 KB Output is correct
70 Correct 657 ms 53872 KB Output is correct
71 Correct 813 ms 55492 KB Output is correct
72 Correct 647 ms 54668 KB Output is correct
73 Correct 755 ms 53560 KB Output is correct
74 Correct 531 ms 53032 KB Output is correct
75 Correct 638 ms 51960 KB Output is correct