oj.uz

Submission #635135

# Submission time Handle Problem Language Result Execution time Memory
635135 2022-08-25T13:24:13 Z tabr Carnival Tickets (IOI20_tickets) C++17
100 / 100
 726 ms 84020 KB 
#include <bits/stdc++.h>
using namespace std;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif

#ifdef tabr
void allocate_tickets(vector<vector<int>>) {}
#else
#include "tickets.h"
#endif

long long find_maximum(int k, vector<vector<int>> x) {
    int n = (int) x.size();
    int m = (int) x[0].size();
    vector<pair<int, int>> a;
    long long res = 0;
    for (int i = 0; i < n; i++) {
        res -= accumulate(x[i].begin(), x[i].begin() + k, 0LL);
        for (int j = 0; j < k; j++) {
            a.emplace_back(x[i][m - 1 - j] + x[i][k - 1 - j], i);
        }
    }
    sort(a.rbegin(), a.rend());
    vector<int> big(n), small(n, k);
    for (int i = 0; i < n * k / 2; i++) {
        res += a[i].first;
        big[a[i].second]++;
        small[a[i].second]--;
    }
    vector<vector<int>> s(n, vector<int>(m, -1));
    for (int i = 0; i < k; i++) {
        int small_cnt = 0;
        int big_cnt = 0;
        for (int j = 0; j < n; j++) {
            if (big[j] == 0) {
                small[j]--;
                s[j][small[j]] = i;
                small_cnt++;
            } else if (small[j] == 0) {
                big[j]--;
                s[j][m - 1 - big[j]] = i;
                big_cnt++;
            }
        }
        for (int j = 0; j < n; j++) {
            if (big[j] > 0 && small[j] > 0) {
                if (small_cnt < n / 2) {
                    small[j]--;
                    s[j][small[j]] = i;
                    small_cnt++;
                } else {
                    big[j]--;
                    s[j][m - 1 - big[j]] = i;
                    big_cnt++;
                }
            }
        }
    }
    debug(s);
    allocate_tickets(s);
    return res;
}

#ifdef tabr
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    debug(find_maximum(2, {{0, 2, 5}, {1, 1, 3}}));            // 7
    debug(find_maximum(1, {{5, 9}, {1, 4}, {3, 6}, {2, 7}}));  // 12
    debug(find_maximum(2, {{1, 4, 5, 9}, {1, 2, 3, 4}, {3, 4, 5, 6}, {1, 2, 7, 8}}));
    return 0;
}
#endif

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 696 KB Output is correct

Subtask #2
16.0 / 16.0

# 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 468 KB Output is correct
5 Correct 21 ms 3260 KB Output is correct
6 Correct 489 ms 73124 KB Output is correct

Subtask #3
14.0 / 14.0

# 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 436 KB Output is correct
5 Correct 19 ms 2640 KB Output is correct
6 Correct 509 ms 57784 KB Output is correct
7 Correct 521 ms 60756 KB Output is correct
8 Correct 3 ms 596 KB Output is correct
9 Correct 0 ms 296 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 5 ms 860 KB Output is correct
13 Correct 17 ms 2364 KB Output is correct
14 Correct 18 ms 2384 KB Output is correct
15 Correct 500 ms 63128 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 292 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 28 ms 3620 KB Output is correct
6 Correct 5 ms 796 KB Output is correct
7 Correct 6 ms 1080 KB Output is correct
8 Correct 718 ms 83920 KB Output is correct
9 Correct 703 ms 78456 KB Output is correct
10 Correct 664 ms 78540 KB Output is correct
11 Correct 726 ms 84020 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 2 ms 436 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 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 468 KB Output is correct
10 Correct 2 ms 440 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 3 ms 468 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 2 ms 436 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 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 468 KB Output is correct
10 Correct 2 ms 440 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 3 ms 468 KB Output is correct
13 Correct 20 ms 3240 KB Output is correct
14 Correct 21 ms 3252 KB Output is correct
15 Correct 24 ms 3300 KB Output is correct
16 Correct 32 ms 3660 KB Output is correct
17 Correct 1 ms 312 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 23 ms 2764 KB Output is correct
21 Correct 29 ms 3240 KB Output is correct
22 Correct 31 ms 3024 KB Output is correct
23 Correct 28 ms 3528 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 696 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 468 KB Output is correct
11 Correct 21 ms 3260 KB Output is correct
12 Correct 489 ms 73124 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 2 ms 436 KB Output is correct
17 Correct 19 ms 2640 KB Output is correct
18 Correct 509 ms 57784 KB Output is correct
19 Correct 521 ms 60756 KB Output is correct
20 Correct 3 ms 596 KB Output is correct
21 Correct 0 ms 296 KB Output is correct
22 Correct 1 ms 300 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 5 ms 860 KB Output is correct
25 Correct 17 ms 2364 KB Output is correct
26 Correct 18 ms 2384 KB Output is correct
27 Correct 500 ms 63128 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 292 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 28 ms 3620 KB Output is correct
33 Correct 5 ms 796 KB Output is correct
34 Correct 6 ms 1080 KB Output is correct
35 Correct 718 ms 83920 KB Output is correct
36 Correct 703 ms 78456 KB Output is correct
37 Correct 664 ms 78540 KB Output is correct
38 Correct 726 ms 84020 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 3 ms 468 KB Output is correct
41 Correct 2 ms 436 KB Output is correct
42 Correct 2 ms 468 KB Output is correct
43 Correct 2 ms 468 KB Output is correct
44 Correct 2 ms 468 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 468 KB Output is correct
48 Correct 2 ms 440 KB Output is correct
49 Correct 3 ms 468 KB Output is correct
50 Correct 3 ms 468 KB Output is correct
51 Correct 20 ms 3240 KB Output is correct
52 Correct 21 ms 3252 KB Output is correct
53 Correct 24 ms 3300 KB Output is correct
54 Correct 32 ms 3660 KB Output is correct
55 Correct 1 ms 312 KB Output is correct
56 Correct 2 ms 468 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 23 ms 2764 KB Output is correct
59 Correct 29 ms 3240 KB Output is correct
60 Correct 31 ms 3024 KB Output is correct
61 Correct 28 ms 3528 KB Output is correct
62 Correct 54 ms 8424 KB Output is correct
63 Correct 59 ms 8392 KB Output is correct
64 Correct 78 ms 9660 KB Output is correct
65 Correct 257 ms 33640 KB Output is correct
66 Correct 349 ms 37520 KB Output is correct
67 Correct 7 ms 1108 KB Output is correct
68 Correct 6 ms 824 KB Output is correct
69 Correct 499 ms 73120 KB Output is correct
70 Correct 600 ms 75124 KB Output is correct
71 Correct 712 ms 83916 KB Output is correct
72 Correct 626 ms 67848 KB Output is correct
73 Correct 666 ms 80148 KB Output is correct
74 Correct 566 ms 60880 KB Output is correct
75 Correct 596 ms 73436 KB Output is correct