oj.uz

Submission #613687

# Submission time Handle Problem Language Result Execution time Memory
613687 2022-07-30T09:16:20 Z DanShaders Carnival Tickets (IOI20_tickets) C++17
100 / 100
 1570 ms 100680 KB 
//Cgrader.cpp
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
 
#define x first
#define y second
using ll = long long;
using ld = long double;
#define all(x) begin(x), end(x)
#define sz(x) ((int) (x).size())
 
const int N = 2100;
 
vector<int> pw[2][N];
vector<int> sorted[N];
 
ll find_maximum(int k, vector<vector<int>> d) {
    int n = sz(d), m = sz(d[0]);
 
    vector<tuple<int, int, int>> a;
    for (int i = 0; i < n; ++i) {
        sorted[i] = vector(m, 0);
        iota(all(sorted[i]), 0);
        stable_sort(all(sorted[i]), [&](int x, int y) {
            return d[i][x] < d[i][y];
        });
        for (int j = 0; j < m; ++j) {
            a.push_back({d[i][j], i, j});
        }
    }   
    sort(all(a));
 
    ll ans = 0;
 
    for (int i = 0; i < n * m; ++i) {
        auto [val, x, y] = a[i];
        if (sz(pw[0][x]) < k) {
            ans -= val;
            pw[0][x].push_back(y);
        }
    }
 
    set<pair<int, int>> cands;
    for (int j = 0; j < n; ++j) {
        if (!sz(pw[0][j])) {
            continue;
        }
        int cval = d[j][sorted[j][m - sz(pw[1][j]) - 1]] + d[j][pw[0][j].back()];
        cands.insert({cval, j});
    }
 
    for (int i = 0; i < n * k / 2; ++i) {
        auto [value, j] = *cands.rbegin();
        ans += value;
 
        pw[1][j].push_back(sorted[j][m - sz(pw[1][j]) - 1]);
        pw[0][j].pop_back();
 
        cands.erase(--cands.end());
 
        if (sz(pw[0][j])) {
            int cval = d[j][sorted[j][m - sz(pw[1][j]) - 1]] + d[j][pw[0][j].back()];
            cands.insert({cval, j});
        }
    }
 
    int sz0 = 0, sz1 = 0;
    for (int i = 0; i < n; ++i) {
        vector<int> indexes = pw[0][i];
        indexes.insert(end(indexes), all(pw[1][i]));
        sort(all(indexes));
        assert(unique(all(indexes)) == end(indexes));
        assert(sz(pw[0][i]) + sz(pw[1][i]) == k);
        sz0 += sz(pw[0][i]);
        sz1 += sz(pw[1][i]);
    }
    assert(sz0 == n * k / 2 && sz1 == n * k / 2);
 
    set<pair<int, int>> where;
    for (int i = 0; i < n; ++i) {
        where.insert({sz(pw[0][i]), i});
    }
 
    vector s(n, vector(m, -1));
 
    for (int i = 0; i < k; ++i) {
        set<pair<int, int>> nwhere;
        
        auto it = where.begin();
        for (int j = 0; j < n; ++j, ++it) {
            auto [val, x] = *it;
            if (2 * j >= n) {
                s[x][pw[0][x].back()] = i;
                pw[0][x].pop_back();
                nwhere.insert({val - 1, x});
            } else {
                s[x][pw[1][x].back()] = i;
                pw[1][x].pop_back();
                nwhere.insert({val, x});
            }
        }
        where = nwhere;
    }
 
    // vector<int> good(m, -1);
    // iota(end(good) - k, end(good), 0);
    // for (int i = 0; i < n; ++i) {
    //  auto c = s[i];
    //  sort(all(c));
    //  assert(good == c);
    // }
    allocate_tickets(s);
    return ans; 
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 452 KB Output is correct
5 Correct 1 ms 576 KB Output is correct
6 Correct 3 ms 1108 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 460 KB Output is correct
4 Correct 3 ms 720 KB Output is correct
5 Correct 30 ms 4340 KB Output is correct
6 Correct 836 ms 80632 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 3 ms 724 KB Output is correct
5 Correct 34 ms 4312 KB Output is correct
6 Correct 901 ms 90060 KB Output is correct
7 Correct 1075 ms 91108 KB Output is correct
8 Correct 5 ms 828 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 9 ms 1400 KB Output is correct
13 Correct 37 ms 3628 KB Output is correct
14 Correct 29 ms 3680 KB Output is correct
15 Correct 1063 ms 98956 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 456 KB Output is correct
4 Correct 4 ms 852 KB Output is correct
5 Correct 56 ms 5192 KB Output is correct
6 Correct 8 ms 1252 KB Output is correct
7 Correct 13 ms 1588 KB Output is correct
8 Correct 1570 ms 100652 KB Output is correct
9 Correct 1489 ms 94364 KB Output is correct
10 Correct 1421 ms 92960 KB Output is correct
11 Correct 1552 ms 99504 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 3 ms 724 KB Output is correct
3 Correct 3 ms 724 KB Output is correct
4 Correct 4 ms 776 KB Output is correct
5 Correct 4 ms 720 KB Output is correct
6 Correct 4 ms 724 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 452 KB Output is correct
9 Correct 3 ms 724 KB Output is correct
10 Correct 3 ms 724 KB Output is correct
11 Correct 4 ms 724 KB Output is correct
12 Correct 4 ms 724 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 3 ms 724 KB Output is correct
3 Correct 3 ms 724 KB Output is correct
4 Correct 4 ms 776 KB Output is correct
5 Correct 4 ms 720 KB Output is correct
6 Correct 4 ms 724 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 452 KB Output is correct
9 Correct 3 ms 724 KB Output is correct
10 Correct 3 ms 724 KB Output is correct
11 Correct 4 ms 724 KB Output is correct
12 Correct 4 ms 724 KB Output is correct
13 Correct 30 ms 4256 KB Output is correct
14 Correct 33 ms 4196 KB Output is correct
15 Correct 44 ms 4824 KB Output is correct
16 Correct 52 ms 5172 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 3 ms 724 KB Output is correct
19 Correct 2 ms 596 KB Output is correct
20 Correct 41 ms 4384 KB Output is correct
21 Correct 47 ms 4628 KB Output is correct
22 Correct 49 ms 4768 KB Output is correct
23 Correct 49 ms 5016 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 452 KB Output is correct
5 Correct 1 ms 576 KB Output is correct
6 Correct 3 ms 1108 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 460 KB Output is correct
10 Correct 3 ms 720 KB Output is correct
11 Correct 30 ms 4340 KB Output is correct
12 Correct 836 ms 80632 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 3 ms 724 KB Output is correct
17 Correct 34 ms 4312 KB Output is correct
18 Correct 901 ms 90060 KB Output is correct
19 Correct 1075 ms 91108 KB Output is correct
20 Correct 5 ms 828 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 9 ms 1400 KB Output is correct
25 Correct 37 ms 3628 KB Output is correct
26 Correct 29 ms 3680 KB Output is correct
27 Correct 1063 ms 98956 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 456 KB Output is correct
31 Correct 4 ms 852 KB Output is correct
32 Correct 56 ms 5192 KB Output is correct
33 Correct 8 ms 1252 KB Output is correct
34 Correct 13 ms 1588 KB Output is correct
35 Correct 1570 ms 100652 KB Output is correct
36 Correct 1489 ms 94364 KB Output is correct
37 Correct 1421 ms 92960 KB Output is correct
38 Correct 1552 ms 99504 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 3 ms 724 KB Output is correct
41 Correct 3 ms 724 KB Output is correct
42 Correct 4 ms 776 KB Output is correct
43 Correct 4 ms 720 KB Output is correct
44 Correct 4 ms 724 KB Output is correct
45 Correct 1 ms 468 KB Output is correct
46 Correct 1 ms 452 KB Output is correct
47 Correct 3 ms 724 KB Output is correct
48 Correct 3 ms 724 KB Output is correct
49 Correct 4 ms 724 KB Output is correct
50 Correct 4 ms 724 KB Output is correct
51 Correct 30 ms 4256 KB Output is correct
52 Correct 33 ms 4196 KB Output is correct
53 Correct 44 ms 4824 KB Output is correct
54 Correct 52 ms 5172 KB Output is correct
55 Correct 1 ms 468 KB Output is correct
56 Correct 3 ms 724 KB Output is correct
57 Correct 2 ms 596 KB Output is correct
58 Correct 41 ms 4384 KB Output is correct
59 Correct 47 ms 4628 KB Output is correct
60 Correct 49 ms 4768 KB Output is correct
61 Correct 49 ms 5016 KB Output is correct
62 Correct 87 ms 10028 KB Output is correct
63 Correct 83 ms 10076 KB Output is correct
64 Correct 147 ms 11912 KB Output is correct
65 Correct 480 ms 40620 KB Output is correct
66 Correct 647 ms 44016 KB Output is correct
67 Correct 11 ms 1596 KB Output is correct
68 Correct 8 ms 1216 KB Output is correct
69 Correct 774 ms 82108 KB Output is correct
70 Correct 1150 ms 91240 KB Output is correct
71 Correct 1533 ms 100680 KB Output is correct
72 Correct 1265 ms 96008 KB Output is correct
73 Correct 1442 ms 96204 KB Output is correct
74 Correct 1042 ms 87392 KB Output is correct
75 Correct 1185 ms 88016 KB Output is correct