Submission #576770

# Submission time Handle Problem Language Result Execution time Memory
576770 2022-06-13T12:35:12 Z SlavicG Carnival Tickets (IOI20_tickets) C++17
100 / 100
814 ms 54260 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(), m = x[0].size();
    std::vector<std::vector<int>> answer(n, vector<int>(m, -1));
    vector<int> use_left(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]] = kk;
        }
        for(int j = n / 2; j < n; ++j) {
            int i = a[j].second;
            ans += x[i][r[i]];
            answer[i][r[i]--] = kk;
        }
    }

    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 1 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 340 KB Output is correct
5 Correct 18 ms 2292 KB Output is correct
6 Correct 445 ms 51416 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 0 ms 212 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 20 ms 2320 KB Output is correct
6 Correct 489 ms 52428 KB Output is correct
7 Correct 533 ms 52800 KB Output is correct
8 Correct 3 ms 468 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 5 ms 724 KB Output is correct
13 Correct 17 ms 1984 KB Output is correct
14 Correct 17 ms 1968 KB Output is correct
15 Correct 543 ms 53372 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 3 ms 340 KB Output is correct
5 Correct 29 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 814 ms 54240 KB Output is correct
9 Correct 738 ms 50632 KB Output is correct
10 Correct 746 ms 50776 KB Output is correct
11 Correct 795 ms 54240 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 2 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 2 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 2 ms 340 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 2 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 2 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 23 ms 2348 KB Output is correct
14 Correct 18 ms 2292 KB Output is correct
15 Correct 26 ms 2364 KB Output is correct
16 Correct 29 ms 2388 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 2240 KB Output is correct
21 Correct 27 ms 2220 KB Output is correct
22 Correct 26 ms 2252 KB Output is correct
23 Correct 29 ms 2360 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 1 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 340 KB Output is correct
11 Correct 18 ms 2292 KB Output is correct
12 Correct 445 ms 51416 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 20 ms 2320 KB Output is correct
18 Correct 489 ms 52428 KB Output is correct
19 Correct 533 ms 52800 KB Output is correct
20 Correct 3 ms 468 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 5 ms 724 KB Output is correct
25 Correct 17 ms 1984 KB Output is correct
26 Correct 17 ms 1968 KB Output is correct
27 Correct 543 ms 53372 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 3 ms 340 KB Output is correct
32 Correct 29 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 814 ms 54240 KB Output is correct
36 Correct 738 ms 50632 KB Output is correct
37 Correct 746 ms 50776 KB Output is correct
38 Correct 795 ms 54240 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 2 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 2 ms 340 KB Output is correct
48 Correct 2 ms 340 KB Output is correct
49 Correct 2 ms 340 KB Output is correct
50 Correct 2 ms 340 KB Output is correct
51 Correct 23 ms 2348 KB Output is correct
52 Correct 18 ms 2292 KB Output is correct
53 Correct 26 ms 2364 KB Output is correct
54 Correct 29 ms 2388 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 2240 KB Output is correct
59 Correct 27 ms 2220 KB Output is correct
60 Correct 26 ms 2252 KB Output is correct
61 Correct 29 ms 2360 KB Output is correct
62 Correct 53 ms 6044 KB Output is correct
63 Correct 50 ms 6044 KB Output is correct
64 Correct 84 ms 6284 KB Output is correct
65 Correct 266 ms 23500 KB Output is correct
66 Correct 345 ms 23892 KB Output is correct
67 Correct 6 ms 852 KB Output is correct
68 Correct 4 ms 620 KB Output is correct
69 Correct 445 ms 51664 KB Output is correct
70 Correct 626 ms 52324 KB Output is correct
71 Correct 799 ms 54260 KB Output is correct
72 Correct 652 ms 52316 KB Output is correct
73 Correct 745 ms 52200 KB Output is correct
74 Correct 539 ms 50792 KB Output is correct
75 Correct 636 ms 50724 KB Output is correct