oj.uz

Submission #497268

# Submission time Handle Problem Language Result Execution time Memory
497268 2021-12-22T22:15:24 Z Hanksburger Carnival Tickets (IOI20_tickets) C++17
100 / 100
 695 ms 76184 KB 
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
priority_queue<pair<long long, long long> > pq;
pair<long long, long long> CNT[1505];
vector<vector<int> > ans;
long long cnt[1505];
bool chosen[1505];
vector<int> tmp;
long long find_maximum(int K, vector<vector<int> > X)
{
	long long N=X.size(), M=X[0].size(), sum=0;
	for (long long i=0; i<N; i++)
		for (long long j=0; j<K; j++)
			sum-=X[i][j];
	for (long long i=0; i<N; i++)
		pq.push({X[i][K-1]+X[i][M-1], i});
	for (long long i=0; i<N*K/2; i++)
	{
		long long p=pq.top().first, q=pq.top().second;
		pq.pop();
		sum+=p;
		cnt[q]++;
		if (cnt[q]<K)
			pq.push({X[q][K-cnt[q]-1]+X[q][M-cnt[q]-1], q});
	}
	for (long long i=0; i<N; i++)
	{
		tmp.clear();
		for (long long j=0; j<M; j++)
			tmp.push_back(-1);
		ans.push_back(tmp);
	}
	for (long long i=0; i<N; i++)
		CNT[i]={cnt[i], i};
	for (long long i=0; i<K; i++)
	{
		for (long long j=0; j<N; j++)
			chosen[j]=0;
		sort(CNT, CNT+N, greater<pair<long long, long long> >());
		for (long long j=0; j<N/2; j++)
		{
			long long q=CNT[j].second;
			chosen[q]=1;
			ans[q][M-cnt[q]]=i;
			cnt[q]--;
			CNT[j].first--;
		}
		for (long long j=0; j<N; j++)
			if (!chosen[j])
				ans[j][K-i-cnt[j]-1]=i;
	}
	allocate_tickets(ans);
	return sum;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
16.0 / 16.0

# 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 0 ms 204 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 18 ms 2344 KB Output is correct
6 Correct 440 ms 51416 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 2 ms 420 KB Output is correct
5 Correct 17 ms 2500 KB Output is correct
6 Correct 431 ms 56772 KB Output is correct
7 Correct 509 ms 57164 KB Output is correct
8 Correct 3 ms 468 KB Output is correct
9 Correct 1 ms 276 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 0 ms 208 KB Output is correct
12 Correct 5 ms 828 KB Output is correct
13 Correct 20 ms 2168 KB Output is correct
14 Correct 18 ms 2108 KB Output is correct
15 Correct 506 ms 57752 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 300 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 3 ms 448 KB Output is correct
5 Correct 24 ms 3240 KB Output is correct
6 Correct 4 ms 792 KB Output is correct
7 Correct 5 ms 968 KB Output is correct
8 Correct 695 ms 76036 KB Output is correct
9 Correct 619 ms 71036 KB Output is correct
10 Correct 614 ms 71044 KB Output is correct
11 Correct 692 ms 76184 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 300 KB Output is correct
2 Correct 2 ms 440 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 2 ms 464 KB Output is correct
5 Correct 2 ms 464 KB Output is correct
6 Correct 3 ms 464 KB Output is correct
7 Correct 1 ms 304 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 3 ms 424 KB Output is correct
10 Correct 2 ms 464 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 492 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 300 KB Output is correct
2 Correct 2 ms 440 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 2 ms 464 KB Output is correct
5 Correct 2 ms 464 KB Output is correct
6 Correct 3 ms 464 KB Output is correct
7 Correct 1 ms 304 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 3 ms 424 KB Output is correct
10 Correct 2 ms 464 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 492 KB Output is correct
13 Correct 19 ms 3252 KB Output is correct
14 Correct 22 ms 3448 KB Output is correct
15 Correct 21 ms 3236 KB Output is correct
16 Correct 23 ms 3252 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 2 ms 464 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 23 ms 2692 KB Output is correct
21 Correct 23 ms 3180 KB Output is correct
22 Correct 22 ms 2684 KB Output is correct
23 Correct 24 ms 3144 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 716 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 2 ms 460 KB Output is correct
11 Correct 18 ms 2344 KB Output is correct
12 Correct 440 ms 51416 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 2 ms 420 KB Output is correct
17 Correct 17 ms 2500 KB Output is correct
18 Correct 431 ms 56772 KB Output is correct
19 Correct 509 ms 57164 KB Output is correct
20 Correct 3 ms 468 KB Output is correct
21 Correct 1 ms 276 KB Output is correct
22 Correct 0 ms 208 KB Output is correct
23 Correct 0 ms 208 KB Output is correct
24 Correct 5 ms 828 KB Output is correct
25 Correct 20 ms 2168 KB Output is correct
26 Correct 18 ms 2108 KB Output is correct
27 Correct 506 ms 57752 KB Output is correct
28 Correct 0 ms 300 KB Output is correct
29 Correct 1 ms 300 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 3 ms 448 KB Output is correct
32 Correct 24 ms 3240 KB Output is correct
33 Correct 4 ms 792 KB Output is correct
34 Correct 5 ms 968 KB Output is correct
35 Correct 695 ms 76036 KB Output is correct
36 Correct 619 ms 71036 KB Output is correct
37 Correct 614 ms 71044 KB Output is correct
38 Correct 692 ms 76184 KB Output is correct
39 Correct 0 ms 300 KB Output is correct
40 Correct 2 ms 440 KB Output is correct
41 Correct 2 ms 460 KB Output is correct
42 Correct 2 ms 464 KB Output is correct
43 Correct 2 ms 464 KB Output is correct
44 Correct 3 ms 464 KB Output is correct
45 Correct 1 ms 304 KB Output is correct
46 Correct 1 ms 336 KB Output is correct
47 Correct 3 ms 424 KB Output is correct
48 Correct 2 ms 464 KB Output is correct
49 Correct 2 ms 468 KB Output is correct
50 Correct 2 ms 492 KB Output is correct
51 Correct 19 ms 3252 KB Output is correct
52 Correct 22 ms 3448 KB Output is correct
53 Correct 21 ms 3236 KB Output is correct
54 Correct 23 ms 3252 KB Output is correct
55 Correct 1 ms 328 KB Output is correct
56 Correct 2 ms 464 KB Output is correct
57 Correct 1 ms 336 KB Output is correct
58 Correct 23 ms 2692 KB Output is correct
59 Correct 23 ms 3180 KB Output is correct
60 Correct 22 ms 2684 KB Output is correct
61 Correct 24 ms 3144 KB Output is correct
62 Correct 52 ms 8392 KB Output is correct
63 Correct 51 ms 8376 KB Output is correct
64 Correct 64 ms 8600 KB Output is correct
65 Correct 251 ms 33160 KB Output is correct
66 Correct 261 ms 33652 KB Output is correct
67 Correct 6 ms 940 KB Output is correct
68 Correct 4 ms 724 KB Output is correct
69 Correct 453 ms 73192 KB Output is correct
70 Correct 566 ms 74220 KB Output is correct
71 Correct 602 ms 76136 KB Output is correct
72 Correct 545 ms 60580 KB Output is correct
73 Correct 665 ms 73408 KB Output is correct
74 Correct 490 ms 59080 KB Output is correct
75 Correct 558 ms 71844 KB Output is correct