oj.uz

Submission #427728

# Submission time Handle Problem Language Result Execution time Memory
427728 2021-06-14T20:16:03 Z zoooma13 Carnival Tickets (IOI20_tickets) C++14
100 / 100
 859 ms 91544 KB 
#include "bits/stdc++.h"
#include "tickets.h"
using namespace std;

int n ,m ,k;
vector <vector <int>> x;

vector <vector <int>> construct(vector <int> pref){
    vector <array <int ,3>> fh[n] ,sh;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < pref[i]; j++)
            fh[i].push_back({x[i][j] ,i ,j});
        for(int j = m-1; j >= m - (k-pref[i]); j--)
            sh.push_back({x[i][j] ,i ,j});
    }
	vector<vector<int>> answer(n ,vector<int>(m ,-1));
    vector<bitset<1500>> taken(n);
    for(auto&bs : taken) bs.set();
    int round_number = 0;
    for(int i = 0; i < n; i++)
    for(auto&c : fh[i]){
        answer[c[1]][c[2]] = round_number;
        taken[c[1]][round_number] = false;
        round_number = (round_number+1 == k? 0 : round_number+1);
    }
    vector <int> pos(n ,-1);
    for(auto&c : sh){
        pos[c[1]] = taken[c[1]]._Find_next(pos[c[1]]);
        answer[c[1]][c[2]] = pos[c[1]];
    }
    return answer;
}

long long find_maximum(int _k, vector<vector<int>> _x) {
    x = _x;
    n = x.size();
    m = x[0].size();
    k = _k;

    vector <int> pref(n ,k);
    priority_queue <pair <int64_t ,int>> pq;

    int64_t tot = 0;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < pref[i]; j++)
            tot -= x[i][j];
        pq.push({x[i][pref[i]-1] + x[i][m-1-(k - pref[i])] ,i});
    }
    for(int step = 0; step < n*k/2; step++){
        auto p = pq.top(); pq.pop();
        tot += p.first;
        int i = p.second;
        pref[i]--;
        if(pref[i])
            pq.push({x[i][pref[i]-1] + x[i][m-1-(k - pref[i])] ,i});
    }

    allocate_tickets(construct(pref));
    return tot;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 2 ms 972 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 25 ms 3252 KB Output is correct
6 Correct 621 ms 73292 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 24 ms 2644 KB Output is correct
6 Correct 589 ms 57312 KB Output is correct
7 Correct 595 ms 61376 KB Output is correct
8 Correct 4 ms 628 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 6 ms 972 KB Output is correct
13 Correct 21 ms 2588 KB Output is correct
14 Correct 21 ms 2568 KB Output is correct
15 Correct 633 ms 62472 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 4 ms 588 KB Output is correct
5 Correct 32 ms 4100 KB Output is correct
6 Correct 6 ms 844 KB Output is correct
7 Correct 7 ms 1356 KB Output is correct
8 Correct 859 ms 90200 KB Output is correct
9 Correct 768 ms 88772 KB Output is correct
10 Correct 829 ms 88348 KB Output is correct
11 Correct 839 ms 91544 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 4 ms 440 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 3 ms 460 KB Output is correct
6 Correct 4 ms 460 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 3 ms 460 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 3 ms 564 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 4 ms 440 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 3 ms 460 KB Output is correct
6 Correct 4 ms 460 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 3 ms 460 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 3 ms 564 KB Output is correct
13 Correct 26 ms 3148 KB Output is correct
14 Correct 35 ms 3236 KB Output is correct
15 Correct 39 ms 3376 KB Output is correct
16 Correct 33 ms 4120 KB Output is correct
17 Correct 1 ms 360 KB Output is correct
18 Correct 3 ms 588 KB Output is correct
19 Correct 2 ms 428 KB Output is correct
20 Correct 26 ms 2940 KB Output is correct
21 Correct 29 ms 3428 KB Output is correct
22 Correct 38 ms 3288 KB Output is correct
23 Correct 31 ms 3760 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 2 ms 972 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 25 ms 3252 KB Output is correct
12 Correct 621 ms 73292 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 2 ms 460 KB Output is correct
17 Correct 24 ms 2644 KB Output is correct
18 Correct 589 ms 57312 KB Output is correct
19 Correct 595 ms 61376 KB Output is correct
20 Correct 4 ms 628 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 6 ms 972 KB Output is correct
25 Correct 21 ms 2588 KB Output is correct
26 Correct 21 ms 2568 KB Output is correct
27 Correct 633 ms 62472 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 4 ms 588 KB Output is correct
32 Correct 32 ms 4100 KB Output is correct
33 Correct 6 ms 844 KB Output is correct
34 Correct 7 ms 1356 KB Output is correct
35 Correct 859 ms 90200 KB Output is correct
36 Correct 768 ms 88772 KB Output is correct
37 Correct 829 ms 88348 KB Output is correct
38 Correct 839 ms 91544 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 4 ms 440 KB Output is correct
41 Correct 3 ms 512 KB Output is correct
42 Correct 3 ms 460 KB Output is correct
43 Correct 3 ms 460 KB Output is correct
44 Correct 4 ms 460 KB Output is correct
45 Correct 1 ms 204 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 3 ms 460 KB Output is correct
48 Correct 3 ms 460 KB Output is correct
49 Correct 3 ms 460 KB Output is correct
50 Correct 3 ms 564 KB Output is correct
51 Correct 26 ms 3148 KB Output is correct
52 Correct 35 ms 3236 KB Output is correct
53 Correct 39 ms 3376 KB Output is correct
54 Correct 33 ms 4120 KB Output is correct
55 Correct 1 ms 360 KB Output is correct
56 Correct 3 ms 588 KB Output is correct
57 Correct 2 ms 428 KB Output is correct
58 Correct 26 ms 2940 KB Output is correct
59 Correct 29 ms 3428 KB Output is correct
60 Correct 38 ms 3288 KB Output is correct
61 Correct 31 ms 3760 KB Output is correct
62 Correct 68 ms 8388 KB Output is correct
63 Correct 74 ms 8544 KB Output is correct
64 Correct 93 ms 10216 KB Output is correct
65 Correct 312 ms 33132 KB Output is correct
66 Correct 359 ms 38688 KB Output is correct
67 Correct 9 ms 1356 KB Output is correct
68 Correct 6 ms 844 KB Output is correct
69 Correct 612 ms 73328 KB Output is correct
70 Correct 789 ms 62960 KB Output is correct
71 Correct 850 ms 68408 KB Output is correct
72 Correct 687 ms 69620 KB Output is correct
73 Correct 782 ms 64848 KB Output is correct
74 Correct 639 ms 53140 KB Output is correct
75 Correct 722 ms 58128 KB Output is correct