oj.uz

Submission #561244

# Submission time Handle Problem Language Result Execution time Memory
561244 2022-05-12T14:01:26 Z ahmet34 Carnival Tickets (IOI20_tickets) C++14
100 / 100
 728 ms 60524 KB 
#include <bits/stdc++.h>
#include "tickets.h"
using namespace std;
 
using ll = long long;
using pii = pair<int, int>;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

const int INF = 5e8, N = 1e5+10, M = 998244353, LOG = 16;
const ll LINF = 1e18;

ll find_maximum(int k, vector<vector<int>> x) {
    ll tot_sum = 0;
    priority_queue<pair<int, int>> pq;
    
    int n = x.size(), m = x[0].size();
    vector<int> lp(n, k-1), rp(n, m-1);

    for (int i = 0; i < n; i++) {
        for(int j = 0; j < k; j++) {
            tot_sum -= x[i][j];
        }
        pq.push({x[i][lp[i]] + x[i][rp[i]], i});
    }

    int to_swap = n/2 * k;
    vector<vector<int>> b(n, vector<int>(m, -1));
    
    while(!pq.empty() and to_swap) {
        auto [inc, c] = pq.top(); pq.pop();
        
        tot_sum += inc;
        to_swap--;
        b[c][rp[c]] = 1;
        lp[c]--; rp[c]--;

        if(lp[c] >= 0) {
            pq.push({x[c][lp[c]] + x[c][rp[c]], c});
        }
    }
    assert(to_swap == 0);
 
    vector<int> cnt(k);
    
    for(int i = 0; i < n; i++) {
        vector<int> to_add, used(k);
        
        for(int j = 0; j < k; j++)
            if(cnt[j] < n/2) to_add.push_back(j);
        
        sort(all(to_add), [&] (int i, int j){
            return cnt[i] < cnt[j];
        });

        for(int j = 0; j <= lp[i]; j++) {
            b[i][j] = to_add[j];
            used[to_add[j]] = true;
            cnt[to_add[j]]++;
        }    

        vector<int> good;
        for(int j = 0; j < k; j++) 
            if(!used[j]) good.push_back(j);
        
        for(int j = rp[i]+1, ind = 0; j < m; j++) {
            b[i][j] = good[ind++];
        }
    }

    allocate_tickets(b);
    return tot_sum;
}

Compilation message

tickets.cpp: In function 'll find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:31:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   31 |         auto [inc, c] = pq.top(); pq.pop();
      |              ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 300 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 724 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 20 ms 3140 KB Output is correct
6 Correct 476 ms 53052 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 21 ms 2460 KB Output is correct
6 Correct 441 ms 56684 KB Output is correct
7 Correct 470 ms 57172 KB Output is correct
8 Correct 4 ms 468 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 224 KB Output is correct
12 Correct 6 ms 852 KB Output is correct
13 Correct 17 ms 2104 KB Output is correct
14 Correct 16 ms 2160 KB Output is correct
15 Correct 476 ms 57788 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 25 ms 3240 KB Output is correct
6 Correct 4 ms 724 KB Output is correct
7 Correct 6 ms 980 KB Output is correct
8 Correct 638 ms 57024 KB Output is correct
9 Correct 664 ms 53524 KB Output is correct
10 Correct 662 ms 53276 KB Output is correct
11 Correct 728 ms 56984 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 3 ms 492 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 436 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 4 ms 212 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 11 ms 468 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 1 ms 212 KB Output is correct
2 Correct 3 ms 492 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 436 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 4 ms 212 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 11 ms 468 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 3 ms 468 KB Output is correct
13 Correct 22 ms 3152 KB Output is correct
14 Correct 23 ms 3248 KB Output is correct
15 Correct 26 ms 3156 KB Output is correct
16 Correct 28 ms 3288 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 3 ms 468 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 21 ms 2636 KB Output is correct
21 Correct 25 ms 3056 KB Output is correct
22 Correct 22 ms 2644 KB Output is correct
23 Correct 25 ms 3188 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 300 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 724 KB Output is correct
7 Correct 1 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 20 ms 3140 KB Output is correct
12 Correct 476 ms 53052 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 296 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 21 ms 2460 KB Output is correct
18 Correct 441 ms 56684 KB Output is correct
19 Correct 470 ms 57172 KB Output is correct
20 Correct 4 ms 468 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 224 KB Output is correct
24 Correct 6 ms 852 KB Output is correct
25 Correct 17 ms 2104 KB Output is correct
26 Correct 16 ms 2160 KB Output is correct
27 Correct 476 ms 57788 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 304 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 25 ms 3240 KB Output is correct
33 Correct 4 ms 724 KB Output is correct
34 Correct 6 ms 980 KB Output is correct
35 Correct 638 ms 57024 KB Output is correct
36 Correct 664 ms 53524 KB Output is correct
37 Correct 662 ms 53276 KB Output is correct
38 Correct 728 ms 56984 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 3 ms 492 KB Output is correct
41 Correct 2 ms 468 KB Output is correct
42 Correct 2 ms 436 KB Output is correct
43 Correct 2 ms 468 KB Output is correct
44 Correct 2 ms 468 KB Output is correct
45 Correct 4 ms 212 KB Output is correct
46 Correct 1 ms 300 KB Output is correct
47 Correct 2 ms 468 KB Output is correct
48 Correct 11 ms 468 KB Output is correct
49 Correct 3 ms 468 KB Output is correct
50 Correct 3 ms 468 KB Output is correct
51 Correct 22 ms 3152 KB Output is correct
52 Correct 23 ms 3248 KB Output is correct
53 Correct 26 ms 3156 KB Output is correct
54 Correct 28 ms 3288 KB Output is correct
55 Correct 2 ms 340 KB Output is correct
56 Correct 3 ms 468 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 21 ms 2636 KB Output is correct
59 Correct 25 ms 3056 KB Output is correct
60 Correct 22 ms 2644 KB Output is correct
61 Correct 25 ms 3188 KB Output is correct
62 Correct 59 ms 8420 KB Output is correct
63 Correct 55 ms 8356 KB Output is correct
64 Correct 74 ms 8608 KB Output is correct
65 Correct 265 ms 33060 KB Output is correct
66 Correct 323 ms 33564 KB Output is correct
67 Correct 6 ms 980 KB Output is correct
68 Correct 5 ms 692 KB Output is correct
69 Correct 592 ms 54740 KB Output is correct
70 Correct 646 ms 55740 KB Output is correct
71 Correct 712 ms 57680 KB Output is correct
72 Correct 605 ms 60524 KB Output is correct
73 Correct 671 ms 55472 KB Output is correct
74 Correct 539 ms 59084 KB Output is correct
75 Correct 616 ms 54008 KB Output is correct