oj.uz

Submission #395626

# Submission time Handle Problem Language Result Execution time Memory
395626 2021-04-28T17:20:09 Z AmineWeslati Carnival Tickets (IOI20_tickets) C++14
100 / 100
 1197 ms 57816 KB 
#include "tickets.h"
#include "bits/stdc++.h"
using namespace std;

typedef long long ll;
typedef vector<int>vi;
#define pb push_back
#define sz(v) (int) v.size()
typedef pair<ll,ll>pi;
#define fi first
#define se second
typedef vector<pi>vpi;
#define FOR(i,a,b) for(int i=a; i<b; i++)

ll find_maximum(int K, vector<vi> x) {
	int N=x.size();
	int M=x[0].size();
	vector<vi> ans(N,vi(M,-1));

	ll val=0;
	vi l(N,K-1),r(N,M);
	set<pi,greater<pi>>s;
	FOR(i,0,N){
		FOR(j,0,K) val-=x[i][j];
		s.insert({x[i][M-1]+x[i][K-1],i});
	}

	int rep=(N*K)/2;
	while(rep--){
		auto it=s.begin();
		int i=(*it).se;
		ll v=(*it).fi;
		s.erase(it);

		val+=v;
		l[i]--; r[i]--;
		if(l[i]>=0)
			s.insert({x[i][r[i]-1]+x[i][l[i]],i});
	}

	int k=0;
	FOR(i,0,N){
		set<int>s;
		FOR(j,0,K) s.insert(j);

		FOR(j,0,l[i]+1){
			ans[i][j]=k;
			s.erase(k);
			k++; k%=K;
		}

		FOR(j,r[i],M){
			auto it=s.begin();
			ans[i][j]=*it;
			s.erase(it);
		}
	}


	allocate_tickets(ans);	
	return val;
}

/*
2 3 2
0 2 5
1 1 3
*/

/*
4 2 1
5 9
1 4
3 6
2 7
*/

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 272 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 296 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 716 KB Output is correct

Subtask #2
16.0 / 16.0

# 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 292 KB Output is correct
4 Correct 3 ms 436 KB Output is correct
5 Correct 28 ms 3248 KB Output is correct
6 Correct 710 ms 53576 KB Output is correct

Subtask #3
14.0 / 14.0

# 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 448 KB Output is correct
5 Correct 30 ms 2468 KB Output is correct
6 Correct 716 ms 56864 KB Output is correct
7 Correct 863 ms 57220 KB Output is correct
8 Correct 5 ms 460 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 8 ms 764 KB Output is correct
13 Correct 29 ms 2132 KB Output is correct
14 Correct 35 ms 2120 KB Output is correct
15 Correct 891 ms 57816 KB Output is correct

Subtask #4
14.0 / 14.0

# 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 5 ms 460 KB Output is correct
5 Correct 50 ms 3284 KB Output is correct
6 Correct 9 ms 716 KB Output is correct
7 Correct 9 ms 1072 KB Output is correct
8 Correct 1194 ms 55260 KB Output is correct
9 Correct 1120 ms 51628 KB Output is correct
10 Correct 1090 ms 51772 KB Output is correct
11 Correct 1197 ms 55320 KB Output is correct

Subtask #5
12.0 / 12.0

# 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 436 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 3 ms 460 KB Output is correct
6 Correct 4 ms 460 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 3 ms 448 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 4 ms 492 KB Output is correct

Subtask #6
23.0 / 23.0

# 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 436 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 3 ms 460 KB Output is correct
6 Correct 4 ms 460 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 3 ms 448 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 4 ms 492 KB Output is correct
13 Correct 37 ms 3248 KB Output is correct
14 Correct 29 ms 3224 KB Output is correct
15 Correct 38 ms 3232 KB Output is correct
16 Correct 54 ms 3352 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 3 ms 432 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 35 ms 2628 KB Output is correct
21 Correct 39 ms 3112 KB Output is correct
22 Correct 40 ms 2628 KB Output is correct
23 Correct 44 ms 3108 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 272 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 296 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 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 292 KB Output is correct
10 Correct 3 ms 436 KB Output is correct
11 Correct 28 ms 3248 KB Output is correct
12 Correct 710 ms 53576 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 448 KB Output is correct
17 Correct 30 ms 2468 KB Output is correct
18 Correct 716 ms 56864 KB Output is correct
19 Correct 863 ms 57220 KB Output is correct
20 Correct 5 ms 460 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 8 ms 764 KB Output is correct
25 Correct 29 ms 2132 KB Output is correct
26 Correct 35 ms 2120 KB Output is correct
27 Correct 891 ms 57816 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 5 ms 460 KB Output is correct
32 Correct 50 ms 3284 KB Output is correct
33 Correct 9 ms 716 KB Output is correct
34 Correct 9 ms 1072 KB Output is correct
35 Correct 1194 ms 55260 KB Output is correct
36 Correct 1120 ms 51628 KB Output is correct
37 Correct 1090 ms 51772 KB Output is correct
38 Correct 1197 ms 55320 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 436 KB Output is correct
42 Correct 3 ms 460 KB Output is correct
43 Correct 3 ms 460 KB Output is correct
44 Correct 4 ms 460 KB Output is correct
45 Correct 1 ms 204 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 3 ms 448 KB Output is correct
48 Correct 3 ms 460 KB Output is correct
49 Correct 3 ms 460 KB Output is correct
50 Correct 4 ms 492 KB Output is correct
51 Correct 37 ms 3248 KB Output is correct
52 Correct 29 ms 3224 KB Output is correct
53 Correct 38 ms 3232 KB Output is correct
54 Correct 54 ms 3352 KB Output is correct
55 Correct 2 ms 332 KB Output is correct
56 Correct 3 ms 432 KB Output is correct
57 Correct 2 ms 332 KB Output is correct
58 Correct 35 ms 2628 KB Output is correct
59 Correct 39 ms 3112 KB Output is correct
60 Correct 40 ms 2628 KB Output is correct
61 Correct 44 ms 3108 KB Output is correct
62 Correct 82 ms 8400 KB Output is correct
63 Correct 78 ms 8388 KB Output is correct
64 Correct 127 ms 8556 KB Output is correct
65 Correct 405 ms 28868 KB Output is correct
66 Correct 525 ms 29336 KB Output is correct
67 Correct 9 ms 1076 KB Output is correct
68 Correct 9 ms 728 KB Output is correct
69 Correct 674 ms 51636 KB Output is correct
70 Correct 938 ms 52512 KB Output is correct
71 Correct 1169 ms 54500 KB Output is correct
72 Correct 920 ms 57668 KB Output is correct
73 Correct 1091 ms 52300 KB Output is correct
74 Correct 768 ms 56264 KB Output is correct
75 Correct 908 ms 51060 KB Output is correct