oj.uz

Submission #300675

# Submission time Handle Problem Language Result Execution time Memory
300675 2020-09-17T11:46:16 Z errorgorn Carnival Tickets (IOI20_tickets) C++14
100 / 100
 1217 ms 90744 KB 
#include "tickets.h"

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ii pair<ll,ll>
#define fi first
#define se second

#define rep(x,s,e) for (auto x=(s)-((s)>(e));x!=(e)-((s)>(e));((s)<(e)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int) (x).size()

const ll INF=1e18;

int n,m,k;
vector<vector<int> > arr;
vector<vector<int> > state;
vector<vector<int> > ans;

vector<int> white[1505];
vector<int> black[1505];
bool vis[1505];

int pos[1505];
priority_queue<ii> pq;

long long find_maximum(int _k, std::vector<std::vector<int>> _arr) {
	n=sz(_arr),m=sz(_arr[0]),arr=_arr;
	k=_k;
	
	rep(x,0,n){
		ans.push_back(vector<int>());
		rep(y,0,m) ans[x].push_back(-1);
		
		state.push_back(vector<int>());
		rep(y,0,m) state[x].push_back(-1);
		
		pos[x]=k-1;
		pq.push(ii(arr[x][pos[x]+m-k]+arr[x][pos[x]],x));
	}
	
	int node;
	rep(zzz,0,n*k/2){
		node=pq.top().se,pq.pop();
		
		state[node][pos[node]+m-k]=1;
		pos[node]--;
		if (pos[node]==-1) continue;
		pq.push(ii(arr[node][pos[node]+m-k]+arr[node][pos[node]],node));
	}
	
	rep(x,0,n){
		rep(y,0,pos[x]+1) state[x][y]=0;
	}
	
	ll res=0;
	rep(x,0,n){
		rep(y,0,m){
			//cout<<state[x][y]<<" ";
			if (state[x][y]==0){
				res-=arr[x][y];
				white[x].push_back(y);
			}
			else if (state[x][y]==1){
				res+=arr[x][y];
				black[x].push_back(y);
			}
		}
		//cout<<endl;
	}
	
	rep(idx,0,k){
		memset(vis,false,sizeof(vis));
		int currw=0;
		
		rep(x,0,n){
			if (white[x].empty()){
				vis[x]=true;
				ans[x][black[x].back()]=idx;
				black[x].pop_back();
			}
			else if (black[x].empty()){
				vis[x]=true;
				ans[x][white[x].back()]=idx;
				white[x].pop_back();
				currw++;
			}
		}
		
		rep(x,0,n) if (!vis[x]){
			if (currw==n/2){
				ans[x][black[x].back()]=idx;
				black[x].pop_back();
			}
			else {
				ans[x][white[x].back()]=idx;
				white[x].pop_back();
				currw++;
			}
		}
	}
	
	allocate_tickets(ans);
	
	return res;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 2 ms 1024 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 4 ms 676 KB Output is correct
5 Correct 50 ms 3704 KB Output is correct
6 Correct 821 ms 75800 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 3 ms 640 KB Output is correct
5 Correct 28 ms 4088 KB Output is correct
6 Correct 768 ms 82884 KB Output is correct
7 Correct 784 ms 86136 KB Output is correct
8 Correct 4 ms 768 KB Output is correct
9 Correct 1 ms 360 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 8 ms 1280 KB Output is correct
13 Correct 36 ms 3584 KB Output is correct
14 Correct 24 ms 3200 KB Output is correct
15 Correct 844 ms 87756 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 4 ms 640 KB Output is correct
5 Correct 41 ms 4384 KB Output is correct
6 Correct 7 ms 1024 KB Output is correct
7 Correct 12 ms 1452 KB Output is correct
8 Correct 1217 ms 90744 KB Output is correct
9 Correct 1158 ms 86920 KB Output is correct
10 Correct 1116 ms 84628 KB Output is correct
11 Correct 1121 ms 90580 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 4 ms 640 KB Output is correct
3 Correct 4 ms 640 KB Output is correct
4 Correct 4 ms 640 KB Output is correct
5 Correct 4 ms 640 KB Output is correct
6 Correct 3 ms 640 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 3 ms 640 KB Output is correct
10 Correct 4 ms 640 KB Output is correct
11 Correct 3 ms 640 KB Output is correct
12 Correct 3 ms 640 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 4 ms 640 KB Output is correct
3 Correct 4 ms 640 KB Output is correct
4 Correct 4 ms 640 KB Output is correct
5 Correct 4 ms 640 KB Output is correct
6 Correct 3 ms 640 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 3 ms 640 KB Output is correct
10 Correct 4 ms 640 KB Output is correct
11 Correct 3 ms 640 KB Output is correct
12 Correct 3 ms 640 KB Output is correct
13 Correct 34 ms 3704 KB Output is correct
14 Correct 36 ms 3704 KB Output is correct
15 Correct 37 ms 4100 KB Output is correct
16 Correct 40 ms 4344 KB Output is correct
17 Correct 2 ms 528 KB Output is correct
18 Correct 3 ms 768 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 36 ms 3960 KB Output is correct
21 Correct 37 ms 3960 KB Output is correct
22 Correct 37 ms 4224 KB Output is correct
23 Correct 38 ms 4088 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 2 ms 1024 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 4 ms 676 KB Output is correct
11 Correct 50 ms 3704 KB Output is correct
12 Correct 821 ms 75800 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 3 ms 640 KB Output is correct
17 Correct 28 ms 4088 KB Output is correct
18 Correct 768 ms 82884 KB Output is correct
19 Correct 784 ms 86136 KB Output is correct
20 Correct 4 ms 768 KB Output is correct
21 Correct 1 ms 360 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 0 ms 384 KB Output is correct
24 Correct 8 ms 1280 KB Output is correct
25 Correct 36 ms 3584 KB Output is correct
26 Correct 24 ms 3200 KB Output is correct
27 Correct 844 ms 87756 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 4 ms 640 KB Output is correct
32 Correct 41 ms 4384 KB Output is correct
33 Correct 7 ms 1024 KB Output is correct
34 Correct 12 ms 1452 KB Output is correct
35 Correct 1217 ms 90744 KB Output is correct
36 Correct 1158 ms 86920 KB Output is correct
37 Correct 1116 ms 84628 KB Output is correct
38 Correct 1121 ms 90580 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 4 ms 640 KB Output is correct
41 Correct 4 ms 640 KB Output is correct
42 Correct 4 ms 640 KB Output is correct
43 Correct 4 ms 640 KB Output is correct
44 Correct 3 ms 640 KB Output is correct
45 Correct 1 ms 384 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 3 ms 640 KB Output is correct
48 Correct 4 ms 640 KB Output is correct
49 Correct 3 ms 640 KB Output is correct
50 Correct 3 ms 640 KB Output is correct
51 Correct 34 ms 3704 KB Output is correct
52 Correct 36 ms 3704 KB Output is correct
53 Correct 37 ms 4100 KB Output is correct
54 Correct 40 ms 4344 KB Output is correct
55 Correct 2 ms 528 KB Output is correct
56 Correct 3 ms 768 KB Output is correct
57 Correct 2 ms 512 KB Output is correct
58 Correct 36 ms 3960 KB Output is correct
59 Correct 37 ms 3960 KB Output is correct
60 Correct 37 ms 4224 KB Output is correct
61 Correct 38 ms 4088 KB Output is correct
62 Correct 94 ms 8184 KB Output is correct
63 Correct 92 ms 8184 KB Output is correct
64 Correct 117 ms 9720 KB Output is correct
65 Correct 436 ms 34296 KB Output is correct
66 Correct 479 ms 37016 KB Output is correct
67 Correct 12 ms 1408 KB Output is correct
68 Correct 7 ms 1024 KB Output is correct
69 Correct 947 ms 75964 KB Output is correct
70 Correct 1052 ms 82740 KB Output is correct
71 Correct 1153 ms 90568 KB Output is correct
72 Correct 935 ms 88492 KB Output is correct
73 Correct 1144 ms 87308 KB Output is correct
74 Correct 1049 ms 81144 KB Output is correct
75 Correct 1022 ms 80256 KB Output is correct