oj.uz

Submission #305823

# Submission time Handle Problem Language Result Execution time Memory
305823 2020-09-24T02:08:31 Z 4fecta Carnival Tickets (IOI20_tickets) C++14
100 / 100
 1033 ms 83992 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

#define ll long long
#define int ll
#define ld long double
#define pii pair<int, int>
#define f first
#define s second
#define readl(_s) getline(cin, (_s));
#define boost() cin.tie(0); cin.sync_with_stdio(0)

const int MN = 1505;

int n, m, tot;
vector<int> rnd(1505);

void allocate_tickets(vector<vector<int32_t>> s);

ll find_maximum(int32_t k, vector<vector<int32_t>> a) {
    n = a.size(), m = a[0].size();
    for (int i = 0; i < n; i++) {
        for (int j = m - k; j < m; j++) { //half max, half min, choose all max first then trade for loss.
            tot += a[i][j];
        }
    }
    vector<pii> v;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < k; j++) {
            v.push_back({-a[i][j] - a[i][m - k + j], i}); //we will take the min from this row since it loses the least pts.
        }
    }
    vector<vector<int32_t>> ans(n, vector<int32_t> (m, -1));
    sort(v.begin(), v.end(), greater<>());
    for (int i = 0; i < n * k / 2; i++) tot += v[i].f, rnd[v[i].s]++;
    int id = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < rnd[i]; j++) {
            ans[i][j] = id;
            id++, id %= k;
        }
        int id1 = id;
        for (int j = m - 1; j > m - 1 - (k - rnd[i]); j--) {
            ans[i][j] = id1;
            id1++, id1 %= k;
        }
    }
    allocate_tickets(ans);
    return tot;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 768 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 30 ms 2424 KB Output is correct
6 Correct 713 ms 51576 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 2 ms 580 KB Output is correct
5 Correct 24 ms 2808 KB Output is correct
6 Correct 625 ms 62360 KB Output is correct
7 Correct 644 ms 68172 KB Output is correct
8 Correct 4 ms 768 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 7 ms 1024 KB Output is correct
13 Correct 22 ms 2680 KB Output is correct
14 Correct 22 ms 2812 KB Output is correct
15 Correct 662 ms 72784 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 3 ms 640 KB Output is correct
5 Correct 43 ms 3572 KB Output is correct
6 Correct 7 ms 892 KB Output is correct
7 Correct 8 ms 1152 KB Output is correct
8 Correct 1033 ms 83864 KB Output is correct
9 Correct 936 ms 82968 KB Output is correct
10 Correct 924 ms 82712 KB Output is correct
11 Correct 1008 ms 83868 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 3 ms 636 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 3 ms 640 KB Output is correct
12 Correct 3 ms 640 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 3 ms 636 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 3 ms 640 KB Output is correct
12 Correct 3 ms 640 KB Output is correct
13 Correct 30 ms 2424 KB Output is correct
14 Correct 30 ms 2432 KB Output is correct
15 Correct 37 ms 2800 KB Output is correct
16 Correct 40 ms 3564 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 3 ms 512 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 30 ms 3060 KB Output is correct
21 Correct 34 ms 2932 KB Output is correct
22 Correct 34 ms 3440 KB Output is correct
23 Correct 37 ms 3312 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 768 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 30 ms 2424 KB Output is correct
12 Correct 713 ms 51576 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 2 ms 580 KB Output is correct
17 Correct 24 ms 2808 KB Output is correct
18 Correct 625 ms 62360 KB Output is correct
19 Correct 644 ms 68172 KB Output is correct
20 Correct 4 ms 768 KB Output is correct
21 Correct 0 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 256 KB Output is correct
24 Correct 7 ms 1024 KB Output is correct
25 Correct 22 ms 2680 KB Output is correct
26 Correct 22 ms 2812 KB Output is correct
27 Correct 662 ms 72784 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 3 ms 640 KB Output is correct
32 Correct 43 ms 3572 KB Output is correct
33 Correct 7 ms 892 KB Output is correct
34 Correct 8 ms 1152 KB Output is correct
35 Correct 1033 ms 83864 KB Output is correct
36 Correct 936 ms 82968 KB Output is correct
37 Correct 924 ms 82712 KB Output is correct
38 Correct 1008 ms 83868 KB Output is correct
39 Correct 1 ms 256 KB Output is correct
40 Correct 3 ms 512 KB Output is correct
41 Correct 3 ms 512 KB Output is correct
42 Correct 3 ms 512 KB Output is correct
43 Correct 3 ms 512 KB Output is correct
44 Correct 3 ms 636 KB Output is correct
45 Correct 1 ms 384 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 3 ms 512 KB Output is correct
48 Correct 3 ms 512 KB Output is correct
49 Correct 3 ms 640 KB Output is correct
50 Correct 3 ms 640 KB Output is correct
51 Correct 30 ms 2424 KB Output is correct
52 Correct 30 ms 2432 KB Output is correct
53 Correct 37 ms 2800 KB Output is correct
54 Correct 40 ms 3564 KB Output is correct
55 Correct 1 ms 384 KB Output is correct
56 Correct 3 ms 512 KB Output is correct
57 Correct 2 ms 384 KB Output is correct
58 Correct 30 ms 3060 KB Output is correct
59 Correct 34 ms 2932 KB Output is correct
60 Correct 34 ms 3440 KB Output is correct
61 Correct 37 ms 3312 KB Output is correct
62 Correct 84 ms 6136 KB Output is correct
63 Correct 81 ms 6048 KB Output is correct
64 Correct 106 ms 9308 KB Output is correct
65 Correct 377 ms 27988 KB Output is correct
66 Correct 436 ms 35720 KB Output is correct
67 Correct 8 ms 1152 KB Output is correct
68 Correct 6 ms 896 KB Output is correct
69 Correct 721 ms 51504 KB Output is correct
70 Correct 856 ms 62312 KB Output is correct
71 Correct 1029 ms 83992 KB Output is correct
72 Correct 859 ms 83224 KB Output is correct
73 Correct 935 ms 75036 KB Output is correct
74 Correct 726 ms 62104 KB Output is correct
75 Correct 846 ms 61372 KB Output is correct