oj.uz

Submission #385956

# Submission time Handle Problem Language Result Execution time Memory
385956 2021-04-05T09:51:27 Z i_am_noob Carnival Tickets (IOI20_tickets) C++17
100 / 100
 879 ms 76040 KB 
#include<bits/stdc++.h>
#include "tickets.h"
using namespace std;

#define ll long long
//#define int ll
#define rep(n) rep1(i,n)
#define rep1(i,n) rep2(i,0,n)
#define rep2(i,a,b) for(int i=a; i<(b); ++i)
#define rep3(i,a,b) for(int i=a; i>=(b); --i)
#define pb push_back
#define sz(a) ((int)a.size())
#define all(a) a.begin(),a.end()
#define pii pair<int,int>
#define inf 0x3f3f3f3f3f3f3f3f
#define pow2(x) (1ll<<(x))

#ifdef i_am_noob
#define bug(...) cerr << "#" << __LINE__ << " " << #__VA_ARGS__ << "- ", _do(__VA_ARGS__)
template<typename T> void _do(T x){cerr << x << endl;}
template<typename T, typename ...S> void _do(T x, S... y){cerr << x << ", ";_do(y...);}
#else
#define bug(...) 49
#endif

const int maxn=1505;

ll find_maximum(int k, vector<vector<int>> a) {
    int n = sz(a);
    int m = sz(a[0]);
    vector<vector<int>> res;
    res.resize(n);
    rep(n) res[i].resize(m);
    rep(n) rep1(j,m) res[i][j]=-1;
	ll ans=0;
    int l[maxn],r[maxn],curl[maxn],curr[maxn];
    rep(n) l[i]=k-1,r[i]=m;
    priority_queue<pii> pq;
    rep(n) pq.push({a[i][k-1]+a[i][m-1],i});
    rep1(_,n*k/2){
    	pii p=pq.top();
    	pq.pop();
    	int x=p.second;
    	l[x]--;
    	r[x]--;
    	if(l[x]>=0) pq.push({a[x][l[x]]+a[x][r[x]-1],x});
    }
    rep(n){
    	rep1(j,l[i]+1) ans-=a[i][j];
    	rep2(j,r[i],m) ans+=a[i][j];
    }
    rep(n) curl[i]=0,curr[i]=m-1;
    int cntl,cntr;
    bool vis[maxn];
    rep1(j,k){
        cntl=n/2,cntr=n/2;
        rep(n) vis[i]=0;
        rep(n){
        	if(curl[i]>l[i]){
        		cntr--;
        		res[i][curr[i]]=j;
        		curr[i]--;
        		vis[i]=1;
        	}
        	else if(curr[i]<r[i]){
        		cntl--;
        		res[i][curl[i]]=j;
        		curl[i]++;
        		vis[i]=1;
        	}
        }
        rep(n) if(!vis[i]){
        	if(cntl){
        		res[i][curl[i]]=j;
        		curl[i]++;
        		cntl--;
        	}
        	else{
        		res[i][curr[i]]=j;
        		curr[i]--;
        		cntr--;
        	}
        }
    }
    allocate_tickets(res);
    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 2 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 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 30 ms 3308 KB Output is correct
6 Correct 652 ms 51820 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 4 ms 492 KB Output is correct
5 Correct 25 ms 2668 KB Output is correct
6 Correct 618 ms 56812 KB Output is correct
7 Correct 640 ms 57304 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 2 ms 364 KB Output is correct
12 Correct 7 ms 876 KB Output is correct
13 Correct 22 ms 2284 KB Output is correct
14 Correct 21 ms 2284 KB Output is correct
15 Correct 670 ms 57836 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 620 KB Output is correct
5 Correct 33 ms 3308 KB Output is correct
6 Correct 8 ms 876 KB Output is correct
7 Correct 7 ms 1004 KB Output is correct
8 Correct 879 ms 58112 KB Output is correct
9 Correct 774 ms 54380 KB Output is correct
10 Correct 760 ms 54380 KB Output is correct
11 Correct 825 ms 58092 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 620 KB Output is correct
3 Correct 4 ms 620 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 3 ms 492 KB Output is correct
10 Correct 3 ms 620 KB Output is correct
11 Correct 4 ms 492 KB Output is correct
12 Correct 3 ms 620 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 620 KB Output is correct
3 Correct 4 ms 620 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 3 ms 492 KB Output is correct
10 Correct 3 ms 620 KB Output is correct
11 Correct 4 ms 492 KB Output is correct
12 Correct 3 ms 620 KB Output is correct
13 Correct 39 ms 3308 KB Output is correct
14 Correct 28 ms 3308 KB Output is correct
15 Correct 31 ms 3308 KB Output is correct
16 Correct 33 ms 3308 KB Output is correct
17 Correct 2 ms 364 KB Output is correct
18 Correct 3 ms 620 KB Output is correct
19 Correct 3 ms 492 KB Output is correct
20 Correct 29 ms 2692 KB Output is correct
21 Correct 30 ms 3200 KB Output is correct
22 Correct 28 ms 2796 KB Output is correct
23 Correct 31 ms 3200 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 2 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 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 30 ms 3308 KB Output is correct
12 Correct 652 ms 51820 KB Output is correct
13 Correct 2 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 2 ms 364 KB Output is correct
16 Correct 4 ms 492 KB Output is correct
17 Correct 25 ms 2668 KB Output is correct
18 Correct 618 ms 56812 KB Output is correct
19 Correct 640 ms 57304 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 2 ms 364 KB Output is correct
24 Correct 7 ms 876 KB Output is correct
25 Correct 22 ms 2284 KB Output is correct
26 Correct 21 ms 2284 KB Output is correct
27 Correct 670 ms 57836 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 620 KB Output is correct
32 Correct 33 ms 3308 KB Output is correct
33 Correct 8 ms 876 KB Output is correct
34 Correct 7 ms 1004 KB Output is correct
35 Correct 879 ms 58112 KB Output is correct
36 Correct 774 ms 54380 KB Output is correct
37 Correct 760 ms 54380 KB Output is correct
38 Correct 825 ms 58092 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 3 ms 620 KB Output is correct
41 Correct 4 ms 620 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 3 ms 492 KB Output is correct
48 Correct 3 ms 620 KB Output is correct
49 Correct 4 ms 492 KB Output is correct
50 Correct 3 ms 620 KB Output is correct
51 Correct 39 ms 3308 KB Output is correct
52 Correct 28 ms 3308 KB Output is correct
53 Correct 31 ms 3308 KB Output is correct
54 Correct 33 ms 3308 KB Output is correct
55 Correct 2 ms 364 KB Output is correct
56 Correct 3 ms 620 KB Output is correct
57 Correct 3 ms 492 KB Output is correct
58 Correct 29 ms 2692 KB Output is correct
59 Correct 30 ms 3200 KB Output is correct
60 Correct 28 ms 2796 KB Output is correct
61 Correct 31 ms 3200 KB Output is correct
62 Correct 74 ms 8556 KB Output is correct
63 Correct 77 ms 8556 KB Output is correct
64 Correct 90 ms 8812 KB Output is correct
65 Correct 325 ms 33132 KB Output is correct
66 Correct 362 ms 33772 KB Output is correct
67 Correct 7 ms 1004 KB Output is correct
68 Correct 6 ms 876 KB Output is correct
69 Correct 652 ms 73196 KB Output is correct
70 Correct 754 ms 74220 KB Output is correct
71 Correct 839 ms 76040 KB Output is correct
72 Correct 689 ms 60676 KB Output is correct
73 Correct 798 ms 73452 KB Output is correct
74 Correct 649 ms 59200 KB Output is correct
75 Correct 735 ms 71916 KB Output is correct