oj.uz

Submission #318420

# Submission time Handle Problem Language Result Execution time Memory
318420 2020-11-01T19:01:25 Z nickmet2004 Carnival Tickets (IOI20_tickets) C++14
100 / 100
 793 ms 76260 KB 
#include<bits/stdc++.h>
#include "tickets.h"
using namespace std;
int cnt[1505];
int n , m ,k;
vector<vector<int>>a;

long long find_maximum(int k , vector<vector<int>> a){
    int n = a.size() , m = a[0].size();
    /// nk/2 maximums - nk/2 minimums
    priority_queue<pair<int , int>> pq;
    long long ans = 0;
    for(int i = 0; i < n; ++i){
        for(int j = 0; j < k; ++j) ans += a[i][m - k + j];
        pq.emplace(-a[i][0] - a[i][m - k] , i);
    } /// --k
    for(int i = 0; i < n * k / 2; ++i){
        auto x = pq.top(); pq.pop();
        int q = x.second;
        ans += x.first;
        if(++cnt[q] < k) pq.emplace(-a[q][cnt[q]] - a[q][m - k + cnt[q]] , q);
    }
    vector<vector<int>> r(n , vector<int>(m , -1));
    /// nk/2 divide into n/2 groups
    int mnL = 0 , mxR = 0;
    for(int i = 0; i < n; ++i){
        for(int j = 0; j < cnt[i]; ++j) r[i][j] = mnL++ , mnL%= k;
        mxR = mnL;
        for(int j = m - k + cnt[i]; j < m; ++j) r[i][j] = mxR++ , mxR%= k;
    }
    allocate_tickets(r);
    return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 748 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 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 27 ms 3300 KB Output is correct
6 Correct 654 ms 51684 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 25 ms 2668 KB Output is correct
6 Correct 611 ms 56932 KB Output is correct
7 Correct 629 ms 57316 KB Output is correct
8 Correct 4 ms 620 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 7 ms 876 KB Output is correct
13 Correct 21 ms 2276 KB Output is correct
14 Correct 22 ms 2284 KB Output is correct
15 Correct 643 ms 57956 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 31 ms 3300 KB Output is correct
6 Correct 5 ms 876 KB Output is correct
7 Correct 6 ms 1004 KB Output is correct
8 Correct 793 ms 76260 KB Output is correct
9 Correct 727 ms 71140 KB Output is correct
10 Correct 727 ms 71140 KB Output is correct
11 Correct 789 ms 76260 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 3 ms 492 KB Output is correct
3 Correct 2 ms 492 KB Output is correct
4 Correct 3 ms 620 KB Output is correct
5 Correct 3 ms 620 KB Output is correct
6 Correct 3 ms 620 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 2 ms 492 KB Output is correct
10 Correct 3 ms 492 KB Output is correct
11 Correct 3 ms 492 KB Output is correct
12 Correct 3 ms 492 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 3 ms 492 KB Output is correct
3 Correct 2 ms 492 KB Output is correct
4 Correct 3 ms 620 KB Output is correct
5 Correct 3 ms 620 KB Output is correct
6 Correct 3 ms 620 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 2 ms 492 KB Output is correct
10 Correct 3 ms 492 KB Output is correct
11 Correct 3 ms 492 KB Output is correct
12 Correct 3 ms 492 KB Output is correct
13 Correct 26 ms 3300 KB Output is correct
14 Correct 26 ms 3300 KB Output is correct
15 Correct 28 ms 3308 KB Output is correct
16 Correct 31 ms 3436 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 3 ms 620 KB Output is correct
19 Correct 2 ms 492 KB Output is correct
20 Correct 26 ms 2716 KB Output is correct
21 Correct 28 ms 3180 KB Output is correct
22 Correct 27 ms 2792 KB Output is correct
23 Correct 29 ms 3308 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 748 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 3 ms 492 KB Output is correct
11 Correct 27 ms 3300 KB Output is correct
12 Correct 654 ms 51684 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 0 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 2 ms 492 KB Output is correct
17 Correct 25 ms 2668 KB Output is correct
18 Correct 611 ms 56932 KB Output is correct
19 Correct 629 ms 57316 KB Output is correct
20 Correct 4 ms 620 KB Output is correct
21 Correct 0 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 7 ms 876 KB Output is correct
25 Correct 21 ms 2276 KB Output is correct
26 Correct 22 ms 2284 KB Output is correct
27 Correct 643 ms 57956 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 3 ms 492 KB Output is correct
32 Correct 31 ms 3300 KB Output is correct
33 Correct 5 ms 876 KB Output is correct
34 Correct 6 ms 1004 KB Output is correct
35 Correct 793 ms 76260 KB Output is correct
36 Correct 727 ms 71140 KB Output is correct
37 Correct 727 ms 71140 KB Output is correct
38 Correct 789 ms 76260 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 3 ms 492 KB Output is correct
41 Correct 2 ms 492 KB Output is correct
42 Correct 3 ms 620 KB Output is correct
43 Correct 3 ms 620 KB Output is correct
44 Correct 3 ms 620 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 2 ms 492 KB Output is correct
48 Correct 3 ms 492 KB Output is correct
49 Correct 3 ms 492 KB Output is correct
50 Correct 3 ms 492 KB Output is correct
51 Correct 26 ms 3300 KB Output is correct
52 Correct 26 ms 3300 KB Output is correct
53 Correct 28 ms 3308 KB Output is correct
54 Correct 31 ms 3436 KB Output is correct
55 Correct 1 ms 364 KB Output is correct
56 Correct 3 ms 620 KB Output is correct
57 Correct 2 ms 492 KB Output is correct
58 Correct 26 ms 2716 KB Output is correct
59 Correct 28 ms 3180 KB Output is correct
60 Correct 27 ms 2792 KB Output is correct
61 Correct 29 ms 3308 KB Output is correct
62 Correct 71 ms 8548 KB Output is correct
63 Correct 75 ms 8484 KB Output is correct
64 Correct 85 ms 8676 KB Output is correct
65 Correct 310 ms 33120 KB Output is correct
66 Correct 343 ms 33636 KB Output is correct
67 Correct 7 ms 1004 KB Output is correct
68 Correct 5 ms 876 KB Output is correct
69 Correct 644 ms 73312 KB Output is correct
70 Correct 718 ms 74208 KB Output is correct
71 Correct 786 ms 76128 KB Output is correct
72 Correct 681 ms 60900 KB Output is correct
73 Correct 749 ms 73312 KB Output is correct
74 Correct 622 ms 59112 KB Output is correct
75 Correct 691 ms 71904 KB Output is correct