oj.uz

Submission #613984

# Submission time Handle Problem Language Result Execution time Memory
613984 2022-07-30T15:34:07 Z alirezasamimi100 Carnival Tickets (IOI20_tickets) C++17
100 / 100
 735 ms 58324 KB 
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int,int>;
using ll = long long int;
#define pb push_back
#define F first
#define S second

ll find_maximum(int k, vector<vector<int>> x) {
    int n = x.size();
    int m = x[0].size();
    vector<int> l(n,k-1),r(n,m),vec;
    priority_queue<pii> pq;
    vector<vector<int>> an(n,vector<int>(m,-1));
    ll ans=0;
    int rem=n*k/2;
    for(int i=0; i<n; i++){
        vec.pb(i);
        for(int j=0; j<k; j++){
            ans-=x[i][j];
        }
        pq.push({x[i][m-1]+x[i][k-1],i});
    }
    while(rem--){
        auto [t,i]=pq.top();
        pq.pop();
        ans+=t;
        l[i]--;
        r[i]--;
        if(l[i]>=0) pq.push({x[i][r[i]-1]+x[i][l[i]],i});
    }
    for(int i=0; i<k; i++){
        sort(vec.begin(),vec.end(),[&](int &a, int &b){return l[a]>l[b];});
        for(int j=0; j<n/2; j++){
            an[vec[j]][l[vec[j]]]=i;
            l[vec[j]]--;
        }
        for(int j=n/2; j<n; j++){
            an[vec[j]][r[vec[j]]]=i;
            r[vec[j]]++;
        }
    }
    allocate_tickets(an);
    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 300 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 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 2 ms 468 KB Output is correct
5 Correct 22 ms 3244 KB Output is correct
6 Correct 531 ms 51904 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 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 19 ms 2492 KB Output is correct
6 Correct 450 ms 56716 KB Output is correct
7 Correct 488 ms 56868 KB Output is correct
8 Correct 3 ms 468 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 6 ms 852 KB Output is correct
13 Correct 16 ms 2112 KB Output is correct
14 Correct 15 ms 2216 KB Output is correct
15 Correct 477 ms 57868 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 29 ms 3284 KB Output is correct
6 Correct 5 ms 724 KB Output is correct
7 Correct 6 ms 952 KB Output is correct
8 Correct 695 ms 56272 KB Output is correct
9 Correct 662 ms 52476 KB Output is correct
10 Correct 651 ms 52492 KB Output is correct
11 Correct 735 ms 56192 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 468 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 3 ms 500 KB Output is correct
6 Correct 3 ms 440 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 3 ms 572 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 3 ms 444 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 468 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 3 ms 500 KB Output is correct
6 Correct 3 ms 440 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 3 ms 572 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 3 ms 444 KB Output is correct
13 Correct 22 ms 3156 KB Output is correct
14 Correct 24 ms 3244 KB Output is correct
15 Correct 28 ms 3268 KB Output is correct
16 Correct 27 ms 3360 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 21 ms 2616 KB Output is correct
21 Correct 24 ms 3116 KB Output is correct
22 Correct 23 ms 2644 KB Output is correct
23 Correct 26 ms 3112 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 300 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 1 ms 212 KB Output is correct
8 Correct 1 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 22 ms 3244 KB Output is correct
12 Correct 531 ms 51904 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 3 ms 468 KB Output is correct
17 Correct 19 ms 2492 KB Output is correct
18 Correct 450 ms 56716 KB Output is correct
19 Correct 488 ms 56868 KB Output is correct
20 Correct 3 ms 468 KB Output is correct
21 Correct 1 ms 300 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 6 ms 852 KB Output is correct
25 Correct 16 ms 2112 KB Output is correct
26 Correct 15 ms 2216 KB Output is correct
27 Correct 477 ms 57868 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 296 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 3 ms 468 KB Output is correct
32 Correct 29 ms 3284 KB Output is correct
33 Correct 5 ms 724 KB Output is correct
34 Correct 6 ms 952 KB Output is correct
35 Correct 695 ms 56272 KB Output is correct
36 Correct 662 ms 52476 KB Output is correct
37 Correct 651 ms 52492 KB Output is correct
38 Correct 735 ms 56192 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 3 ms 468 KB Output is correct
41 Correct 3 ms 468 KB Output is correct
42 Correct 2 ms 468 KB Output is correct
43 Correct 3 ms 500 KB Output is correct
44 Correct 3 ms 440 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 3 ms 572 KB Output is correct
49 Correct 2 ms 468 KB Output is correct
50 Correct 3 ms 444 KB Output is correct
51 Correct 22 ms 3156 KB Output is correct
52 Correct 24 ms 3244 KB Output is correct
53 Correct 28 ms 3268 KB Output is correct
54 Correct 27 ms 3360 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 2 ms 468 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 21 ms 2616 KB Output is correct
59 Correct 24 ms 3116 KB Output is correct
60 Correct 23 ms 2644 KB Output is correct
61 Correct 26 ms 3112 KB Output is correct
62 Correct 61 ms 8344 KB Output is correct
63 Correct 59 ms 8368 KB Output is correct
64 Correct 72 ms 8580 KB Output is correct
65 Correct 282 ms 29640 KB Output is correct
66 Correct 311 ms 30160 KB Output is correct
67 Correct 8 ms 960 KB Output is correct
68 Correct 5 ms 724 KB Output is correct
69 Correct 560 ms 53320 KB Output is correct
70 Correct 622 ms 54308 KB Output is correct
71 Correct 712 ms 56268 KB Output is correct
72 Correct 561 ms 58324 KB Output is correct
73 Correct 664 ms 54012 KB Output is correct
74 Correct 532 ms 56748 KB Output is correct
75 Correct 620 ms 52740 KB Output is correct