Submission #459482

# Submission time Handle Problem Language Result Execution time Memory
459482 2021-08-08T14:28:20 Z astoria Carnival Tickets (IOI20_tickets) C++14
100 / 100
1136 ms 100076 KB
    #include "bits/stdc++.h"
	#include "tickets.h"
    using namespace std;
    typedef long long ll;
     
    long long find_maximum(int k, std::vector<std::vector<int>> x) {
    	int N=x.size(), M=x[0].size();
    	
    	vector<vector<int> > ans(N);
    	for(int i=0; i<N; i++) ans[i].resize(M);
    	
    	for(int i=0; i<N; i++)
    		for(int j=0; j<M; j++)
    			ans[i][j] = -1;
    	
    	ll sum=0;
    	
    	priority_queue<pair<ll,pair<int,int> > > pq; //<value, <colour,ticket> >
    	
    	for(int i=0; i<N; i++){
    		for(int j=0; j<k; j++){
    			sum -= x[i][j];
    			pq.push({x[i][j]+x[i][M-k+j] , {i,j} });
    			ans[i][j] = 0; //'-'
    		}
    	}
    	
    	int trades = N*k/2;
    	for(int ahc=0; ahc<trades; ahc++){
    		ll v = pq.top().first; int i=pq.top().second.first, j=pq.top().second.second;
    		pq.pop();
    		ans[i][j]=-1; ans[i][M-k+j] = 1; //'+'
    		sum += v;
    	}
    	int l[2000],r[2000]; pair<int,int> arr[2000];
    	for(int i=0; i<N; i++){
    		for(int j=0; j<M; j++){
    			if (ans[i][j]==1){ r[i]=M-1; arr[i].first++;}
    			else if (ans[i][j]==0) l[i]=0;
    		}
    		arr[i].second = i;
    	}
    	
    	for (int i=0; i<k; i++) {
    		sort(arr, arr+N);
    		for (int j=0; j<N; j++) {
    			int id=arr[j].second;
    			if (j<N/2) ans[id][l[id]++]=i;
    			else ans[id][r[id]--]=i, arr[j].first--;
    		}
    	}
    	allocate_tickets(ans);
    	return sum;
    }
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 716 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 292 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 26 ms 3256 KB Output is correct
6 Correct 622 ms 54732 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 27 ms 3008 KB Output is correct
6 Correct 693 ms 66728 KB Output is correct
7 Correct 772 ms 72400 KB Output is correct
8 Correct 4 ms 844 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 8 ms 972 KB Output is correct
13 Correct 27 ms 2696 KB Output is correct
14 Correct 27 ms 2884 KB Output is correct
15 Correct 838 ms 77148 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 588 KB Output is correct
5 Correct 41 ms 4416 KB Output is correct
6 Correct 6 ms 972 KB Output is correct
7 Correct 9 ms 1224 KB Output is correct
8 Correct 1136 ms 94188 KB Output is correct
9 Correct 1048 ms 94180 KB Output is correct
10 Correct 1051 ms 94164 KB Output is correct
11 Correct 1120 ms 95984 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 3 ms 588 KB Output is correct
6 Correct 3 ms 588 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 3 ms 460 KB Output is correct
10 Correct 3 ms 588 KB Output is correct
11 Correct 3 ms 560 KB Output is correct
12 Correct 3 ms 588 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 3 ms 588 KB Output is correct
6 Correct 3 ms 588 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 3 ms 460 KB Output is correct
10 Correct 3 ms 588 KB Output is correct
11 Correct 3 ms 560 KB Output is correct
12 Correct 3 ms 588 KB Output is correct
13 Correct 26 ms 3140 KB Output is correct
14 Correct 25 ms 3284 KB Output is correct
15 Correct 35 ms 3648 KB Output is correct
16 Correct 39 ms 4424 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 3 ms 588 KB Output is correct
19 Correct 2 ms 460 KB Output is correct
20 Correct 31 ms 3288 KB Output is correct
21 Correct 33 ms 3768 KB Output is correct
22 Correct 35 ms 3780 KB Output is correct
23 Correct 36 ms 4416 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 716 KB Output is correct
7 Correct 1 ms 292 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 26 ms 3256 KB Output is correct
12 Correct 622 ms 54732 KB Output is correct
13 Correct 1 ms 296 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 2 ms 460 KB Output is correct
17 Correct 27 ms 3008 KB Output is correct
18 Correct 693 ms 66728 KB Output is correct
19 Correct 772 ms 72400 KB Output is correct
20 Correct 4 ms 844 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 8 ms 972 KB Output is correct
25 Correct 27 ms 2696 KB Output is correct
26 Correct 27 ms 2884 KB Output is correct
27 Correct 838 ms 77148 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 3 ms 588 KB Output is correct
32 Correct 41 ms 4416 KB Output is correct
33 Correct 6 ms 972 KB Output is correct
34 Correct 9 ms 1224 KB Output is correct
35 Correct 1136 ms 94188 KB Output is correct
36 Correct 1048 ms 94180 KB Output is correct
37 Correct 1051 ms 94164 KB Output is correct
38 Correct 1120 ms 95984 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 2 ms 460 KB Output is correct
41 Correct 2 ms 460 KB Output is correct
42 Correct 3 ms 460 KB Output is correct
43 Correct 3 ms 588 KB Output is correct
44 Correct 3 ms 588 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 3 ms 460 KB Output is correct
48 Correct 3 ms 588 KB Output is correct
49 Correct 3 ms 560 KB Output is correct
50 Correct 3 ms 588 KB Output is correct
51 Correct 26 ms 3140 KB Output is correct
52 Correct 25 ms 3284 KB Output is correct
53 Correct 35 ms 3648 KB Output is correct
54 Correct 39 ms 4424 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 3 ms 588 KB Output is correct
57 Correct 2 ms 460 KB Output is correct
58 Correct 31 ms 3288 KB Output is correct
59 Correct 33 ms 3768 KB Output is correct
60 Correct 35 ms 3780 KB Output is correct
61 Correct 36 ms 4416 KB Output is correct
62 Correct 69 ms 8376 KB Output is correct
63 Correct 71 ms 8504 KB Output is correct
64 Correct 106 ms 11632 KB Output is correct
65 Correct 376 ms 37532 KB Output is correct
66 Correct 464 ms 45300 KB Output is correct
67 Correct 8 ms 1224 KB Output is correct
68 Correct 7 ms 1100 KB Output is correct
69 Correct 609 ms 54688 KB Output is correct
70 Correct 844 ms 65520 KB Output is correct
71 Correct 1087 ms 95852 KB Output is correct
72 Correct 975 ms 100076 KB Output is correct
73 Correct 1045 ms 78156 KB Output is correct
74 Correct 762 ms 70180 KB Output is correct
75 Correct 840 ms 64384 KB Output is correct