oj.uz

Submission #301536

# Submission time Handle Problem Language Result Execution time Memory
301536 2020-09-18T03:59:14 Z kevinsogo Carnival Tickets (IOI20_tickets) C++17
100 / 100
 1691 ms 97680 KB 
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

ll find_maximum(int k, vector<vector<int>> x) {
    int n = x.size();
    int m = x[0].size();
    assert(n % 2 == 0);

    vector<vector<int>> xs = x;
    vector<pair<int,int>> stones(n*k);
    ll s = 0;
    for (int i = 0; i < n; i++) {
        sort(xs[i].begin(), xs[i].end());
        for (int j = 0; j < k; j++) {
            s -= xs[i][j];
            stones.emplace_back(xs[i][m-j-1] + xs[i][k-j-1], i);
        }
    }
    vector<int> ts(n);
    sort(stones.begin(), stones.end());

    for (int it = 0; it < k*n/2; it++) {
        auto [v, i] = stones.back(); stones.pop_back();
        s += v;
        ts[i]++;
    }

    vector<vector<int>::iterator> bads(n), guds(n);
    for (int i = 0; i < n; i++) {
        bads[i] = xs[i].begin();
        guds[i] = xs[i].begin() + m - ts[i];
    }

    vector<vector<int>> roundv(n, vector<int>(k, -1));
    vector<int> rows(n);
    iota(rows.begin(), rows.end(), 0);
    for (int r = 0; r < k; r++) {
        sort(rows.begin(), rows.end(), [&](int i, int j) { return distance(guds[i], xs[i].end()) < distance(guds[j], xs[j].end()); });
        for (int idx = 0; idx < n; idx++) {
            int i = rows[idx];
            roundv[i][r] = *((idx < n/2 ? bads : guds)[i]++);
        }
    }

    vector<vector<int>> take(n, vector<int>(m, -1));
    for (int i = 0; i < n; i++) {
        assert(bads[i] == xs[i].begin() + k - ts[i]);
        assert(guds[i] == xs[i].end());
        unordered_map<int,vector<int>> inds;
        for (int j = 0; j < m; j++) {
            inds[x[i][j]].push_back(j);
        }
        for (int r = 0; r < k; r++) {
            int v = roundv[i][r];
            take[i][inds[v].back()] = r; inds[v].pop_back();
        }
    }

    allocate_tickets(take);
    return s;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 4 ms 512 KB Output is correct
5 Correct 46 ms 2936 KB Output is correct
6 Correct 1158 ms 60592 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 31 ms 3360 KB Output is correct
6 Correct 877 ms 75796 KB Output is correct
7 Correct 847 ms 83100 KB Output is correct
8 Correct 6 ms 768 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 9 ms 1152 KB Output is correct
13 Correct 29 ms 3184 KB Output is correct
14 Correct 28 ms 3240 KB Output is correct
15 Correct 885 ms 88940 KB Output is correct

Subtask #4
14.0 / 14.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 256 KB Output is correct
4 Correct 5 ms 640 KB Output is correct
5 Correct 63 ms 4236 KB Output is correct
6 Correct 10 ms 1024 KB Output is correct
7 Correct 11 ms 1280 KB Output is correct
8 Correct 1682 ms 97612 KB Output is correct
9 Correct 1550 ms 91244 KB Output is correct
10 Correct 1541 ms 91348 KB Output is correct
11 Correct 1648 ms 97680 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 4 ms 512 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 4 ms 512 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 4 ms 640 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
10 Correct 4 ms 512 KB Output is correct
11 Correct 4 ms 640 KB Output is correct
12 Correct 5 ms 768 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 4 ms 512 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 4 ms 512 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 4 ms 640 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
10 Correct 4 ms 512 KB Output is correct
11 Correct 4 ms 640 KB Output is correct
12 Correct 5 ms 768 KB Output is correct
13 Correct 52 ms 2808 KB Output is correct
14 Correct 48 ms 2808 KB Output is correct
15 Correct 55 ms 3352 KB Output is correct
16 Correct 63 ms 4284 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 4 ms 640 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 47 ms 3612 KB Output is correct
21 Correct 54 ms 3628 KB Output is correct
22 Correct 55 ms 4204 KB Output is correct
23 Correct 60 ms 3964 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 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 3 ms 896 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 4 ms 512 KB Output is correct
11 Correct 46 ms 2936 KB Output is correct
12 Correct 1158 ms 60592 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 3 ms 512 KB Output is correct
17 Correct 31 ms 3360 KB Output is correct
18 Correct 877 ms 75796 KB Output is correct
19 Correct 847 ms 83100 KB Output is correct
20 Correct 6 ms 768 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 1 ms 256 KB Output is correct
24 Correct 9 ms 1152 KB Output is correct
25 Correct 29 ms 3184 KB Output is correct
26 Correct 28 ms 3240 KB Output is correct
27 Correct 885 ms 88940 KB Output is correct
28 Correct 1 ms 256 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 5 ms 640 KB Output is correct
32 Correct 63 ms 4236 KB Output is correct
33 Correct 10 ms 1024 KB Output is correct
34 Correct 11 ms 1280 KB Output is correct
35 Correct 1682 ms 97612 KB Output is correct
36 Correct 1550 ms 91244 KB Output is correct
37 Correct 1541 ms 91348 KB Output is correct
38 Correct 1648 ms 97680 KB Output is correct
39 Correct 1 ms 256 KB Output is correct
40 Correct 4 ms 512 KB Output is correct
41 Correct 5 ms 512 KB Output is correct
42 Correct 4 ms 512 KB Output is correct
43 Correct 4 ms 512 KB Output is correct
44 Correct 4 ms 640 KB Output is correct
45 Correct 1 ms 384 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 5 ms 512 KB Output is correct
48 Correct 4 ms 512 KB Output is correct
49 Correct 4 ms 640 KB Output is correct
50 Correct 5 ms 768 KB Output is correct
51 Correct 52 ms 2808 KB Output is correct
52 Correct 48 ms 2808 KB Output is correct
53 Correct 55 ms 3352 KB Output is correct
54 Correct 63 ms 4284 KB Output is correct
55 Correct 2 ms 384 KB Output is correct
56 Correct 4 ms 640 KB Output is correct
57 Correct 2 ms 512 KB Output is correct
58 Correct 47 ms 3612 KB Output is correct
59 Correct 54 ms 3628 KB Output is correct
60 Correct 55 ms 4204 KB Output is correct
61 Correct 60 ms 3964 KB Output is correct
62 Correct 132 ms 7160 KB Output is correct
63 Correct 129 ms 7288 KB Output is correct
64 Correct 178 ms 11216 KB Output is correct
65 Correct 615 ms 33964 KB Output is correct
66 Correct 733 ms 43768 KB Output is correct
67 Correct 12 ms 1408 KB Output is correct
68 Correct 10 ms 1024 KB Output is correct
69 Correct 1159 ms 60540 KB Output is correct
70 Correct 1410 ms 75808 KB Output is correct
71 Correct 1691 ms 97652 KB Output is correct
72 Correct 1258 ms 92908 KB Output is correct
73 Correct 1571 ms 91592 KB Output is correct
74 Correct 1048 ms 75332 KB Output is correct
75 Correct 1355 ms 74668 KB Output is correct