oj.uz

Submission #480121

# Submission time Handle Problem Language Result Execution time Memory
480121 2021-10-14T17:56:28 Z couplefire Carnival Tickets (IOI20_tickets) C++17
100 / 100
 949 ms 60604 KB 
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long

ll find_maximum(int k, vector<vector<int>> x){
    int n = x.size(), m = x[0].size();
    vector<int> stuff(n, k-1);
    set<array<int, 2>, greater<>> se; ll ans = 0;
    for(int i = 0; i<n; ++i)
        se.insert({x[i][m-1]+x[i][k-1], i});
    for(int i = 0; i<n; ++i)
        for(int j = 0; j<k; ++j)
            ans -= x[i][j];
    for(int _ = 0; _<n*k/2; ++_){
        auto [a, b] = *se.begin(); 
        se.erase(se.begin()); ans += a; stuff[b]--;
        if(stuff[b]>=0) se.insert({x[b][stuff[b]]+x[b][stuff[b]+m-k], b});
    }
    vector<vector<int>> res(n, vector<int>(m, -1));
    vector<array<int, 2>> bd(n);
    for(int i = 0; i<n; ++i)
        bd[i] = {stuff[i], stuff[i]+m-k+1};
    for(int i = 0; i<k; ++i){
        vector<int> arr(n);
        iota(arr.begin(), arr.end(), 0);
        sort(arr.begin(), arr.end(), [&](int a, int b){return bd[a]>bd[b];});
        for(int j = 0; j<n/2; ++j)
            res[arr[j]][bd[arr[j]][0]] = i, --bd[arr[j]][0];
        for(int j = n/2; j<n; ++j)
            res[arr[j]][bd[arr[j]][1]] = i, ++bd[arr[j]][1];
    }
    allocate_tickets(res); return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 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 1 ms 332 KB Output is correct
6 Correct 2 ms 716 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 2 ms 432 KB Output is correct
5 Correct 25 ms 3248 KB Output is correct
6 Correct 522 ms 53668 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 21 ms 2508 KB Output is correct
6 Correct 556 ms 56796 KB Output is correct
7 Correct 573 ms 57116 KB Output is correct
8 Correct 3 ms 460 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 7 ms 928 KB Output is correct
13 Correct 19 ms 2124 KB Output is correct
14 Correct 21 ms 2124 KB Output is correct
15 Correct 611 ms 57800 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 0 ms 204 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 37 ms 3248 KB Output is correct
6 Correct 6 ms 752 KB Output is correct
7 Correct 8 ms 1076 KB Output is correct
8 Correct 893 ms 55524 KB Output is correct
9 Correct 864 ms 51728 KB Output is correct
10 Correct 855 ms 52188 KB Output is correct
11 Correct 913 ms 55764 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 2 ms 460 KB Output is correct
3 Correct 4 ms 480 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 3 ms 460 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 2 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 460 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 2 ms 460 KB Output is correct
3 Correct 4 ms 480 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 3 ms 460 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 2 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 460 KB Output is correct
13 Correct 23 ms 3148 KB Output is correct
14 Correct 23 ms 3180 KB Output is correct
15 Correct 30 ms 3172 KB Output is correct
16 Correct 37 ms 3268 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 2 ms 460 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 27 ms 2632 KB Output is correct
21 Correct 29 ms 3148 KB Output is correct
22 Correct 35 ms 2628 KB Output is correct
23 Correct 34 ms 3196 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 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 1 ms 332 KB Output is correct
6 Correct 2 ms 716 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 2 ms 432 KB Output is correct
11 Correct 25 ms 3248 KB Output is correct
12 Correct 522 ms 53668 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 2 ms 460 KB Output is correct
17 Correct 21 ms 2508 KB Output is correct
18 Correct 556 ms 56796 KB Output is correct
19 Correct 573 ms 57116 KB Output is correct
20 Correct 3 ms 460 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 7 ms 928 KB Output is correct
25 Correct 19 ms 2124 KB Output is correct
26 Correct 21 ms 2124 KB Output is correct
27 Correct 611 ms 57800 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 3 ms 460 KB Output is correct
32 Correct 37 ms 3248 KB Output is correct
33 Correct 6 ms 752 KB Output is correct
34 Correct 8 ms 1076 KB Output is correct
35 Correct 893 ms 55524 KB Output is correct
36 Correct 864 ms 51728 KB Output is correct
37 Correct 855 ms 52188 KB Output is correct
38 Correct 913 ms 55764 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 2 ms 460 KB Output is correct
41 Correct 4 ms 480 KB Output is correct
42 Correct 2 ms 460 KB Output is correct
43 Correct 2 ms 460 KB Output is correct
44 Correct 3 ms 460 KB Output is correct
45 Correct 1 ms 204 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 2 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 460 KB Output is correct
51 Correct 23 ms 3148 KB Output is correct
52 Correct 23 ms 3180 KB Output is correct
53 Correct 30 ms 3172 KB Output is correct
54 Correct 37 ms 3268 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 2 ms 460 KB Output is correct
57 Correct 2 ms 332 KB Output is correct
58 Correct 27 ms 2632 KB Output is correct
59 Correct 29 ms 3148 KB Output is correct
60 Correct 35 ms 2628 KB Output is correct
61 Correct 34 ms 3196 KB Output is correct
62 Correct 65 ms 8332 KB Output is correct
63 Correct 62 ms 8352 KB Output is correct
64 Correct 98 ms 8632 KB Output is correct
65 Correct 311 ms 33092 KB Output is correct
66 Correct 411 ms 33656 KB Output is correct
67 Correct 8 ms 972 KB Output is correct
68 Correct 5 ms 716 KB Output is correct
69 Correct 569 ms 52676 KB Output is correct
70 Correct 748 ms 53504 KB Output is correct
71 Correct 949 ms 55120 KB Output is correct
72 Correct 714 ms 60604 KB Output is correct
73 Correct 873 ms 52988 KB Output is correct
74 Correct 599 ms 59180 KB Output is correct
75 Correct 727 ms 51520 KB Output is correct