oj.uz

Submission #672695

# Submission time Handle Problem Language Result Execution time Memory
672695 2022-12-17T13:10:16 Z tbzard Carnival Tickets (IOI20_tickets) C++14
100 / 100
 933 ms 62192 KB 
#include <bits/stdc++.h>
using namespace std;

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

    vector<vector<int> > s(n);
    vector<int> num(n), l(n), r(n);
    for(int i=0;i<n;i++){
        s[i].resize(m);
        r[i] = m-1;
        for(int j=0;j<m;j++) s[i][j] = -1;
    }

    long long ans = 0;
    priority_queue<pair<int, int> > pq;
    for(int i=0;i<n;i++){
        for(int j=k-1;j>=0;j--){
            pq.push(make_pair(x[i][j]+x[i][m-1-(k-1-j)], i));
            ans += -x[i][j];
        }
    }
    for(int i=0;i<n*k/2;i++){
        int val = pq.top().first, j = pq.top().second;
        pq.pop();
        ans += val;
        num[j]++;
    }

    for(int i=0;i<k;i++){
        vector<pair<int, int> > v;
        for(int j=0;j<n;j++) v.push_back(make_pair(num[j], j));
        sort(v.begin(), v.end());
        reverse(v.begin(), v.end());
        for(int j=0;j<n/2;j++){
            int idx = v[j].second;
            s[idx][r[idx]--] = i;
            num[idx]--;
        }
        for(int j=n/2;j<n;j++){
            int idx = v[j].second;
            s[idx][l[idx]++] = i;
        }
    }

    allocate_tickets(s);
    return ans;
}

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 212 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 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Correct 20 ms 2400 KB Output is correct
6 Correct 539 ms 51360 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 23 ms 2396 KB Output is correct
6 Correct 544 ms 53344 KB Output is correct
7 Correct 600 ms 56360 KB Output is correct
8 Correct 4 ms 596 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 6 ms 852 KB Output is correct
13 Correct 19 ms 2144 KB Output is correct
14 Correct 19 ms 2256 KB Output is correct
15 Correct 612 ms 58656 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 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 4 ms 468 KB Output is correct
5 Correct 35 ms 2796 KB Output is correct
6 Correct 5 ms 700 KB Output is correct
7 Correct 6 ms 980 KB Output is correct
8 Correct 840 ms 62188 KB Output is correct
9 Correct 862 ms 58092 KB Output is correct
10 Correct 827 ms 58092 KB Output is correct
11 Correct 933 ms 62184 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 3 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 4 ms 468 KB Output is correct
6 Correct 4 ms 468 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 3 ms 596 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 3 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 4 ms 468 KB Output is correct
6 Correct 4 ms 468 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 3 ms 596 KB Output is correct
13 Correct 23 ms 2388 KB Output is correct
14 Correct 21 ms 2312 KB Output is correct
15 Correct 27 ms 2380 KB Output is correct
16 Correct 33 ms 2724 KB Output is correct
17 Correct 1 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 26 ms 2512 KB Output is correct
21 Correct 28 ms 2508 KB Output is correct
22 Correct 30 ms 2656 KB Output is correct
23 Correct 32 ms 2624 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 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 724 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 3 ms 340 KB Output is correct
11 Correct 20 ms 2400 KB Output is correct
12 Correct 539 ms 51360 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 23 ms 2396 KB Output is correct
18 Correct 544 ms 53344 KB Output is correct
19 Correct 600 ms 56360 KB Output is correct
20 Correct 4 ms 596 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 6 ms 852 KB Output is correct
25 Correct 19 ms 2144 KB Output is correct
26 Correct 19 ms 2256 KB Output is correct
27 Correct 612 ms 58656 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 4 ms 468 KB Output is correct
32 Correct 35 ms 2796 KB Output is correct
33 Correct 5 ms 700 KB Output is correct
34 Correct 6 ms 980 KB Output is correct
35 Correct 840 ms 62188 KB Output is correct
36 Correct 862 ms 58092 KB Output is correct
37 Correct 827 ms 58092 KB Output is correct
38 Correct 933 ms 62184 KB Output is correct
39 Correct 1 ms 296 KB Output is correct
40 Correct 2 ms 340 KB Output is correct
41 Correct 3 ms 340 KB Output is correct
42 Correct 2 ms 340 KB Output is correct
43 Correct 4 ms 468 KB Output is correct
44 Correct 4 ms 468 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 2 ms 468 KB Output is correct
48 Correct 2 ms 468 KB Output is correct
49 Correct 3 ms 468 KB Output is correct
50 Correct 3 ms 596 KB Output is correct
51 Correct 23 ms 2388 KB Output is correct
52 Correct 21 ms 2312 KB Output is correct
53 Correct 27 ms 2380 KB Output is correct
54 Correct 33 ms 2724 KB Output is correct
55 Correct 1 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 26 ms 2512 KB Output is correct
59 Correct 28 ms 2508 KB Output is correct
60 Correct 30 ms 2656 KB Output is correct
61 Correct 32 ms 2624 KB Output is correct
62 Correct 57 ms 5936 KB Output is correct
63 Correct 56 ms 6012 KB Output is correct
64 Correct 88 ms 7132 KB Output is correct
65 Correct 298 ms 23896 KB Output is correct
66 Correct 362 ms 27776 KB Output is correct
67 Correct 6 ms 980 KB Output is correct
68 Correct 7 ms 704 KB Output is correct
69 Correct 483 ms 51276 KB Output is correct
70 Correct 667 ms 53420 KB Output is correct
71 Correct 842 ms 62192 KB Output is correct
72 Correct 800 ms 59576 KB Output is correct
73 Correct 834 ms 59024 KB Output is correct
74 Correct 633 ms 52460 KB Output is correct
75 Correct 668 ms 52148 KB Output is correct