Submission #409463

# Submission time Handle Problem Language Result Execution time Memory
409463 2021-05-20T19:43:48 Z achibasadzishvili Carnival Tickets (IOI20_tickets) C++17
100 / 100
1104 ms 62136 KB
#include "tickets.h"
#include <vector>
#include<bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pb push_back
using namespace std;
ll l[50005],r[50005],t[50005],ind[50005];
long long find_maximum(int k, std::vector<std::vector<int>> x) {
	int n = (int)x.size() , m = (int)x[0].size();
	vector<vector<int> >ans;
	vector<int>g;
	ll pas = 0;
	for(int i=0; i<m; i++)
		g.pb(-1);
	for(int i=0; i<n; i++)ans.pb(g);
	for(int i=0; i<k; i++){
		t[i] = m - 1 - (k - i - 1);
	}
	set<pair<ll,ll> >st;
	for(int i=0; i<n; i++){
		sort(x[i].begin() , x[i].end());
		for(int j=0; j<k; j++){
			pas -= x[i][j];
		}
		ind[i] = k - 1;
		st.insert({x[i][ind[i]] + x[i][t[ind[i]]] , i});
	}
	ll raod = n * k / 2;
	while(raod--){
		pair<ll,ll>p = *(--st.end());
		pas += p.f;
		st.erase(st.find(p));
		ll a = p.s;
		ind[a]--;
		if(ind[a] >= 0){
			st.insert({x[a][ind[a]] + x[a][t[ind[a]]] , a});
		}
	}
	for(int i=0; i<n; i++){
		l[i] = 0;
		r[i] = m - 1;
	}
	pas = 0;
	//cout << k << '\n';
	for(int val=0; val<k; val++){
		vector<pair<int,int> >v;
		for(int i=0; i<n; i++){
			//cout << i << " " << ind[i] << '\n';
			v.pb({ind[i] , i});
		}
		sort(v.begin() , v.end());
		int P = 0;
		//cout << val << " " << '\n';
		for(auto to : v){
			P++;
			int i = to.s;
			if(P > n / 2){
				ans[i][l[i]] = val;
				pas -= x[i][l[i]];
				l[i]++;
				ind[i]--;
			}
			else{
				pas += x[i][r[i]];
				ans[i][r[i]] = val;
				r[i]--;
			}
		}
	}
	allocate_tickets(ans);
	return pas;
}
# 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 1 ms 332 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 2 ms 716 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 280 KB Output is correct
4 Correct 3 ms 432 KB Output is correct
5 Correct 27 ms 3232 KB Output is correct
6 Correct 629 ms 52376 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 460 KB Output is correct
5 Correct 29 ms 2480 KB Output is correct
6 Correct 676 ms 56876 KB Output is correct
7 Correct 722 ms 57412 KB Output is correct
8 Correct 4 ms 460 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 8 ms 844 KB Output is correct
13 Correct 24 ms 2240 KB Output is correct
14 Correct 24 ms 2104 KB Output is correct
15 Correct 754 ms 58040 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 460 KB Output is correct
5 Correct 39 ms 3276 KB Output is correct
6 Correct 7 ms 716 KB Output is correct
7 Correct 9 ms 1064 KB Output is correct
8 Correct 1024 ms 55680 KB Output is correct
9 Correct 992 ms 52036 KB Output is correct
10 Correct 997 ms 52040 KB Output is correct
11 Correct 1104 ms 55788 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 3 ms 460 KB Output is correct
3 Correct 3 ms 460 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 4 ms 524 KB Output is correct
6 Correct 3 ms 460 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 4 ms 460 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 4 ms 460 KB Output is correct
12 Correct 4 ms 460 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 3 ms 460 KB Output is correct
3 Correct 3 ms 460 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 4 ms 524 KB Output is correct
6 Correct 3 ms 460 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 4 ms 460 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 4 ms 460 KB Output is correct
12 Correct 4 ms 460 KB Output is correct
13 Correct 26 ms 3248 KB Output is correct
14 Correct 27 ms 3264 KB Output is correct
15 Correct 33 ms 3244 KB Output is correct
16 Correct 40 ms 3308 KB Output is correct
17 Correct 2 ms 316 KB Output is correct
18 Correct 3 ms 460 KB Output is correct
19 Correct 2 ms 444 KB Output is correct
20 Correct 33 ms 2628 KB Output is correct
21 Correct 35 ms 3116 KB Output is correct
22 Correct 36 ms 2600 KB Output is correct
23 Correct 38 ms 3116 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 1 ms 332 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 2 ms 716 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 280 KB Output is correct
10 Correct 3 ms 432 KB Output is correct
11 Correct 27 ms 3232 KB Output is correct
12 Correct 629 ms 52376 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 3 ms 460 KB Output is correct
17 Correct 29 ms 2480 KB Output is correct
18 Correct 676 ms 56876 KB Output is correct
19 Correct 722 ms 57412 KB Output is correct
20 Correct 4 ms 460 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 8 ms 844 KB Output is correct
25 Correct 24 ms 2240 KB Output is correct
26 Correct 24 ms 2104 KB Output is correct
27 Correct 754 ms 58040 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 460 KB Output is correct
32 Correct 39 ms 3276 KB Output is correct
33 Correct 7 ms 716 KB Output is correct
34 Correct 9 ms 1064 KB Output is correct
35 Correct 1024 ms 55680 KB Output is correct
36 Correct 992 ms 52036 KB Output is correct
37 Correct 997 ms 52040 KB Output is correct
38 Correct 1104 ms 55788 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 3 ms 460 KB Output is correct
41 Correct 3 ms 460 KB Output is correct
42 Correct 3 ms 460 KB Output is correct
43 Correct 4 ms 524 KB Output is correct
44 Correct 3 ms 460 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 4 ms 460 KB Output is correct
48 Correct 3 ms 460 KB Output is correct
49 Correct 4 ms 460 KB Output is correct
50 Correct 4 ms 460 KB Output is correct
51 Correct 26 ms 3248 KB Output is correct
52 Correct 27 ms 3264 KB Output is correct
53 Correct 33 ms 3244 KB Output is correct
54 Correct 40 ms 3308 KB Output is correct
55 Correct 2 ms 316 KB Output is correct
56 Correct 3 ms 460 KB Output is correct
57 Correct 2 ms 444 KB Output is correct
58 Correct 33 ms 2628 KB Output is correct
59 Correct 35 ms 3116 KB Output is correct
60 Correct 36 ms 2600 KB Output is correct
61 Correct 38 ms 3116 KB Output is correct
62 Correct 70 ms 8368 KB Output is correct
63 Correct 72 ms 8400 KB Output is correct
64 Correct 110 ms 8644 KB Output is correct
65 Correct 364 ms 33200 KB Output is correct
66 Correct 452 ms 33628 KB Output is correct
67 Correct 9 ms 1100 KB Output is correct
68 Correct 7 ms 716 KB Output is correct
69 Correct 631 ms 53068 KB Output is correct
70 Correct 836 ms 53832 KB Output is correct
71 Correct 1032 ms 57488 KB Output is correct
72 Correct 865 ms 57028 KB Output is correct
73 Correct 1028 ms 62136 KB Output is correct
74 Correct 743 ms 59204 KB Output is correct
75 Correct 846 ms 60428 KB Output is correct