Submission #317273

# Submission time Handle Problem Language Result Execution time Memory
317273 2020-10-29T09:08:06 Z kshitij_sodani Carnival Tickets (IOI20_tickets) C++14
100 / 100
925 ms 60492 KB
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define mp make_pair
#define pb push_back
#define a first 
#define b second

#include "tickets.h"
#include <vector>
int cur[1501];
int vis[1501];
long long find_maximum(int k,vector<vector<int>> xx) {
	int n = xx.size();
	int m = xx[0].size();
	vector<vector<int>> answer;
	llo su=0;
	priority_queue<pair<int,pair<int,int>>> ss;
	for(int i=0;i<n;i++){
		for(int j=m-1;j>=m-k;j--){
			su+=xx[i][j];
		}
		ss.push({-xx[i][m-k]-xx[i][0],{i,0}});
	}
	//cout<<su<<endl;
	for(int j=0;j<(n*k)/2;j++){
		pair<int,pair<int,int>> yy=ss.top();
	//	cout<<yy.a<<","<<yy.b.a<<","<<yy.b.b<<endl;
		ss.pop();
		su+=yy.a;
		cur[yy.b.a]+=1;
		if(yy.b.b<k-1){
			ss.push({-xx[yy.b.a][m-(k-yy.b.b)+1]-xx[yy.b.a][yy.b.b+1],{yy.b.a,yy.b.b+1}});
		}
	}
	vector<vector<int>> ans;
	for (int i = 0; i < n; i++) {
		std::vector<int> row(m);
		for (int j = 0; j < m; j++) {
			row[j] = -1;
		}
		ans.push_back(row);
	}
	llo cur2=0;
	for(int i=0;i<n;i++){
		for(int j=0;j<cur[i];j++){
			ans[i][j]=cur2;
			cur2=(cur2+1)%k;
		}
	}
	for(int i=0;i<n;i++){
		for(int j=0;j<k;j++){
			vis[j]=0;
		}
		for(int j=0;j<m;j++){
			if(ans[i][j]>-1){
				vis[ans[i][j]]=1;
			}
		}
		vector<int> tt;
		for(int j=0;j<k;j++){
			if(vis[j]==0){
				tt.pb(j);
			}
		}
		for(int j=m-1;j>=m-(k-cur[i]);j--){
			ans[i][j]=tt[(m-1)-j];
		}
	}










	
	allocate_tickets(ans);
	return su;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 768 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 32 ms 2432 KB Output is correct
6 Correct 712 ms 51704 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 25 ms 2424 KB Output is correct
6 Correct 614 ms 52420 KB Output is correct
7 Correct 624 ms 52984 KB Output is correct
8 Correct 4 ms 512 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 7 ms 896 KB Output is correct
13 Correct 21 ms 2104 KB Output is correct
14 Correct 22 ms 2040 KB Output is correct
15 Correct 637 ms 53588 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 37 ms 2424 KB Output is correct
6 Correct 6 ms 640 KB Output is correct
7 Correct 8 ms 896 KB Output is correct
8 Correct 914 ms 54392 KB Output is correct
9 Correct 853 ms 50680 KB Output is correct
10 Correct 839 ms 50752 KB Output is correct
11 Correct 922 ms 54276 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 288 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 4 ms 640 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 3 ms 512 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 512 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 288 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 4 ms 640 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 3 ms 512 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 512 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 30 ms 2432 KB Output is correct
14 Correct 32 ms 2424 KB Output is correct
15 Correct 33 ms 2424 KB Output is correct
16 Correct 38 ms 2560 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 3 ms 512 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 28 ms 2408 KB Output is correct
21 Correct 34 ms 2424 KB Output is correct
22 Correct 30 ms 2424 KB Output is correct
23 Correct 34 ms 2424 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 768 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 32 ms 2432 KB Output is correct
12 Correct 712 ms 51704 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 25 ms 2424 KB Output is correct
18 Correct 614 ms 52420 KB Output is correct
19 Correct 624 ms 52984 KB Output is correct
20 Correct 4 ms 512 KB Output is correct
21 Correct 0 ms 256 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 1 ms 256 KB Output is correct
24 Correct 7 ms 896 KB Output is correct
25 Correct 21 ms 2104 KB Output is correct
26 Correct 22 ms 2040 KB Output is correct
27 Correct 637 ms 53588 KB Output is correct
28 Correct 1 ms 256 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 3 ms 512 KB Output is correct
32 Correct 37 ms 2424 KB Output is correct
33 Correct 6 ms 640 KB Output is correct
34 Correct 8 ms 896 KB Output is correct
35 Correct 914 ms 54392 KB Output is correct
36 Correct 853 ms 50680 KB Output is correct
37 Correct 839 ms 50752 KB Output is correct
38 Correct 922 ms 54276 KB Output is correct
39 Correct 1 ms 288 KB Output is correct
40 Correct 3 ms 512 KB Output is correct
41 Correct 4 ms 640 KB Output is correct
42 Correct 3 ms 512 KB Output is correct
43 Correct 3 ms 512 KB Output is correct
44 Correct 3 ms 512 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 512 KB Output is correct
48 Correct 3 ms 512 KB Output is correct
49 Correct 3 ms 512 KB Output is correct
50 Correct 3 ms 512 KB Output is correct
51 Correct 30 ms 2432 KB Output is correct
52 Correct 32 ms 2424 KB Output is correct
53 Correct 33 ms 2424 KB Output is correct
54 Correct 38 ms 2560 KB Output is correct
55 Correct 1 ms 384 KB Output is correct
56 Correct 3 ms 512 KB Output is correct
57 Correct 2 ms 384 KB Output is correct
58 Correct 28 ms 2408 KB Output is correct
59 Correct 34 ms 2424 KB Output is correct
60 Correct 30 ms 2424 KB Output is correct
61 Correct 34 ms 2424 KB Output is correct
62 Correct 84 ms 6136 KB Output is correct
63 Correct 85 ms 6008 KB Output is correct
64 Correct 104 ms 6392 KB Output is correct
65 Correct 360 ms 23592 KB Output is correct
66 Correct 404 ms 24312 KB Output is correct
67 Correct 10 ms 896 KB Output is correct
68 Correct 6 ms 640 KB Output is correct
69 Correct 724 ms 57788 KB Output is correct
70 Correct 833 ms 55604 KB Output is correct
71 Correct 925 ms 57472 KB Output is correct
72 Correct 765 ms 60492 KB Output is correct
73 Correct 864 ms 57444 KB Output is correct
74 Correct 687 ms 50796 KB Output is correct
75 Correct 783 ms 50812 KB Output is correct