oj.uz

Submission #307296

# Submission time Handle Problem Language Result Execution time Memory
307296 2020-09-27T14:57:17 Z rqi Carnival Tickets (IOI20_tickets) C++14
100 / 100
 1342 ms 73096 KB 
#include "tickets.h"
#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pi;
typedef vector<int> vi;
typedef long long ll;
typedef vector<ll> vl;
typedef pair<ll, ll> pl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;

#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) begin(x), end(x)
#define mp make_pair
#define f first
#define s second
#define bk back()

vi goods[1505];
vi bads[1505];
priority_queue<pi> szs; //size, index

long long find_maximum(int k, vector<vi> x) {

	int n = sz(x);
	int m = sz(x[0]);
	vector<vi> answer;
	for(int i = 0; i < n; i++){
		answer.pb(vi(m, -1));
	}
	ll ans = 0;
	for(int i = 0; i < n; i++){
		for(int j = 0; j < k; j++){
			bads[i].pb(j);
			ans-=x[i][j];
		}
		szs.push(mp(x[i][bads[i].bk]+x[i][bads[i].bk+m-k], i));
	}

	int cnt = 0;

	while(cnt < (n/2)*k){
		pi a = szs.top();
		szs.pop();
		ans+=a.f;
		goods[a.s].pb(bads[a.s].bk+m-k);
		bads[a.s].pop_back();
		if(sz(bads[a.s]) >= 1){
			szs.push(mp(x[a.s][bads[a.s].bk]+x[a.s][bads[a.s].bk+m-k], a.s));
		}
		cnt++;
	}

	priority_queue<pi> emp;
	swap(szs, emp);

	for(int i = 0; i < n; i++){
		szs.push(mp(sz(goods[i]), i));
	}

	for(int round = 0; round < k; round++){
		vpi trash;
		for(int i = 0; i < n/2; i++){
			pi a = szs.top();
			szs.pop();
			answer[a.s][goods[a.s].bk] = round;
			goods[a.s].pop_back();
			trash.pb(mp(a.f-1, a.s));
		}

		for(int i = 0; i < n/2; i++){
			pi a = szs.top();
			szs.pop();
			answer[a.s][bads[a.s].bk] = round;
			bads[a.s].pop_back();
			trash.pb(a);
		}

		for(auto u: trash){
			szs.push(u);
		}
	}
	allocate_tickets(answer);
	return ans;
	// if(k == m){
	// 	vector<pair<int, pi>> inds;
	// 	for(int i = 0; i < n; i++){
	// 		for(int j = 0; j < m; j++){
	// 			inds.pb(mp(x[i][j], mp(i, j)));
	// 			ans-=x[i][j];
	// 		}
	// 	}
	// 	sort(all(inds));
	// 	for(int i = 0; i < (n/2)*m; i++){
	// 		bads[inds[i].s.f].pb(inds[i].s.s);
	// 	}
	// 	for(int i = (n/2)*m; i < n*m; i++){
	// 		goods[inds[i].s.f].pb(inds[i].s.s);
	// 		ans+=2*inds[i].f;
	// 	}
	// 	for(int i = 0; i < n; i++){
	// 		szs.push(mp(sz(goods[i]), i));
	// 	}

	// 	for(int round = 0; round < k; round++){
	// 		vpi trash;
	// 		for(int i = 0; i < n/2; i++){
	// 			pi a = szs.top();
	// 			szs.pop();
	// 			answer[a.s][goods[a.s].bk] = round;
	// 			goods[a.s].pop_back();
	// 			trash.pb(mp(a.f-1, a.s));
	// 		}

	// 		for(int i = 0; i < n/2; i++){
	// 			pi a = szs.top();
	// 			szs.pop();
	// 			//cout << a.s << "\n";
	// 			answer[a.s][bads[a.s].bk] = round;
	// 			bads[a.s].pop_back();
	// 			trash.pb(a);
	// 		}

	// 		for(auto u: trash){
	// 			szs.push(u);
	// 		}
	// 	}
	// 	allocate_tickets(answer);
	// 	return ans;
	// }
	
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 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 896 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 33 ms 2560 KB Output is correct
6 Correct 810 ms 51712 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 512 KB Output is correct
5 Correct 30 ms 3072 KB Output is correct
6 Correct 814 ms 61688 KB Output is correct
7 Correct 874 ms 63088 KB Output is correct
8 Correct 5 ms 640 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 8 ms 1024 KB Output is correct
13 Correct 27 ms 2560 KB Output is correct
14 Correct 27 ms 2552 KB Output is correct
15 Correct 921 ms 71416 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 45 ms 3448 KB Output is correct
6 Correct 7 ms 896 KB Output is correct
7 Correct 10 ms 1152 KB Output is correct
8 Correct 1313 ms 73096 KB Output is correct
9 Correct 1238 ms 68600 KB Output is correct
10 Correct 1282 ms 67192 KB Output is correct
11 Correct 1342 ms 71920 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 4 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 640 KB Output is correct
12 Correct 4 ms 640 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 4 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 640 KB Output is correct
12 Correct 4 ms 640 KB Output is correct
13 Correct 36 ms 2552 KB Output is correct
14 Correct 33 ms 2560 KB Output is correct
15 Correct 39 ms 2988 KB Output is correct
16 Correct 46 ms 3448 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 4 ms 640 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 35 ms 2936 KB Output is correct
21 Correct 40 ms 2944 KB Output is correct
22 Correct 39 ms 3320 KB Output is correct
23 Correct 44 ms 3320 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 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 896 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 33 ms 2560 KB Output is correct
12 Correct 810 ms 51712 KB Output is correct
13 Correct 0 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 512 KB Output is correct
17 Correct 30 ms 3072 KB Output is correct
18 Correct 814 ms 61688 KB Output is correct
19 Correct 874 ms 63088 KB Output is correct
20 Correct 5 ms 640 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 8 ms 1024 KB Output is correct
25 Correct 27 ms 2560 KB Output is correct
26 Correct 27 ms 2552 KB Output is correct
27 Correct 921 ms 71416 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 45 ms 3448 KB Output is correct
33 Correct 7 ms 896 KB Output is correct
34 Correct 10 ms 1152 KB Output is correct
35 Correct 1313 ms 73096 KB Output is correct
36 Correct 1238 ms 68600 KB Output is correct
37 Correct 1282 ms 67192 KB Output is correct
38 Correct 1342 ms 71920 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 3 ms 512 KB Output is correct
41 Correct 3 ms 512 KB Output is correct
42 Correct 3 ms 512 KB Output is correct
43 Correct 4 ms 512 KB Output is correct
44 Correct 4 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 640 KB Output is correct
50 Correct 4 ms 640 KB Output is correct
51 Correct 36 ms 2552 KB Output is correct
52 Correct 33 ms 2560 KB Output is correct
53 Correct 39 ms 2988 KB Output is correct
54 Correct 46 ms 3448 KB Output is correct
55 Correct 1 ms 512 KB Output is correct
56 Correct 4 ms 640 KB Output is correct
57 Correct 2 ms 512 KB Output is correct
58 Correct 35 ms 2936 KB Output is correct
59 Correct 40 ms 2944 KB Output is correct
60 Correct 39 ms 3320 KB Output is correct
61 Correct 44 ms 3320 KB Output is correct
62 Correct 90 ms 6212 KB Output is correct
63 Correct 90 ms 6140 KB Output is correct
64 Correct 126 ms 8056 KB Output is correct
65 Correct 446 ms 27128 KB Output is correct
66 Correct 542 ms 30968 KB Output is correct
67 Correct 10 ms 1152 KB Output is correct
68 Correct 8 ms 896 KB Output is correct
69 Correct 806 ms 51716 KB Output is correct
70 Correct 1029 ms 61944 KB Output is correct
71 Correct 1312 ms 73080 KB Output is correct
72 Correct 1099 ms 69752 KB Output is correct
73 Correct 1265 ms 69368 KB Output is correct
74 Correct 872 ms 59736 KB Output is correct
75 Correct 1037 ms 59636 KB Output is correct