oj.uz

Submission #318423

# Submission time Handle Problem Language Result Execution time Memory
318423 2020-11-01T19:06:19 Z nickmet2004 Carnival Tickets (IOI20_tickets) C++14
100 / 100
 961 ms 62468 KB 
#include<bits/stdc++.h>
#include "tickets.h"
using namespace std;
int cnt[1505];
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][j] - a[i][m - k + j] , i);
    }
    for(int i = 0; i < n * k / 2; ++i) {auto x = pq.top(); pq.pop(); cnt[x.second]++, ans += x.first;}
    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 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 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 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 26 ms 2412 KB Output is correct
6 Correct 652 ms 51428 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 1 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 26 ms 2536 KB Output is correct
6 Correct 650 ms 53500 KB Output is correct
7 Correct 700 ms 56488 KB Output is correct
8 Correct 4 ms 620 KB Output is correct
9 Correct 1 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 884 KB Output is correct
13 Correct 23 ms 2284 KB Output is correct
14 Correct 23 ms 2280 KB Output is correct
15 Correct 710 ms 58792 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 0 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 37 ms 2780 KB Output is correct
6 Correct 6 ms 748 KB Output is correct
7 Correct 7 ms 1004 KB Output is correct
8 Correct 961 ms 62468 KB Output is correct
9 Correct 884 ms 58116 KB Output is correct
10 Correct 892 ms 58244 KB Output is correct
11 Correct 953 ms 62340 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 492 KB Output is correct
5 Correct 3 ms 492 KB Output is correct
6 Correct 3 ms 492 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 492 KB Output is correct
5 Correct 3 ms 492 KB Output is correct
6 Correct 3 ms 492 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 27 ms 2404 KB Output is correct
14 Correct 29 ms 2404 KB Output is correct
15 Correct 34 ms 2536 KB Output is correct
16 Correct 36 ms 2908 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 3 ms 492 KB Output is correct
19 Correct 1 ms 492 KB Output is correct
20 Correct 28 ms 2532 KB Output is correct
21 Correct 31 ms 2524 KB Output is correct
22 Correct 32 ms 2776 KB Output is correct
23 Correct 33 ms 2776 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 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 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 1 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 26 ms 2412 KB Output is correct
12 Correct 652 ms 51428 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 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 26 ms 2536 KB Output is correct
18 Correct 650 ms 53500 KB Output is correct
19 Correct 700 ms 56488 KB Output is correct
20 Correct 4 ms 620 KB Output is correct
21 Correct 1 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 884 KB Output is correct
25 Correct 23 ms 2284 KB Output is correct
26 Correct 23 ms 2280 KB Output is correct
27 Correct 710 ms 58792 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 0 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 37 ms 2780 KB Output is correct
33 Correct 6 ms 748 KB Output is correct
34 Correct 7 ms 1004 KB Output is correct
35 Correct 961 ms 62468 KB Output is correct
36 Correct 884 ms 58116 KB Output is correct
37 Correct 892 ms 58244 KB Output is correct
38 Correct 953 ms 62340 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 492 KB Output is correct
43 Correct 3 ms 492 KB Output is correct
44 Correct 3 ms 492 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 27 ms 2404 KB Output is correct
52 Correct 29 ms 2404 KB Output is correct
53 Correct 34 ms 2536 KB Output is correct
54 Correct 36 ms 2908 KB Output is correct
55 Correct 1 ms 364 KB Output is correct
56 Correct 3 ms 492 KB Output is correct
57 Correct 1 ms 492 KB Output is correct
58 Correct 28 ms 2532 KB Output is correct
59 Correct 31 ms 2524 KB Output is correct
60 Correct 32 ms 2776 KB Output is correct
61 Correct 33 ms 2776 KB Output is correct
62 Correct 74 ms 6116 KB Output is correct
63 Correct 73 ms 6116 KB Output is correct
64 Correct 97 ms 7248 KB Output is correct
65 Correct 344 ms 24012 KB Output is correct
66 Correct 408 ms 27968 KB Output is correct
67 Correct 7 ms 1004 KB Output is correct
68 Correct 6 ms 748 KB Output is correct
69 Correct 646 ms 51444 KB Output is correct
70 Correct 790 ms 53416 KB Output is correct
71 Correct 956 ms 62340 KB Output is correct
72 Correct 857 ms 59776 KB Output is correct
73 Correct 921 ms 59076 KB Output is correct
74 Correct 719 ms 52580 KB Output is correct
75 Correct 767 ms 52272 KB Output is correct