oj.uz

Submission #358575

# Submission time Handle Problem Language Result Execution time Memory
358575 2021-01-25T21:03:06 Z Jasiekstrz Carnival Tickets (IOI20_tickets) C++17
100 / 100
 1038 ms 71568 KB 
#include "tickets.h"
#include<bits/stdc++.h>
using namespace std;
long long find_maximum(int k, vector<vector<int>> x)
{
	int n = x.size();
	int m = x[0].size();
	int i,j;
	vector<int> it;
	vector<int> cnt[2];
	vector<vector<int>> ans;
	vector<pair<int,int>> pq;
	long long w=0;
	for(i=0;i<n;i++)
		it.push_back(m-1);
	for(i=0;i<n;i++)
	{
		ans.push_back({});
		for(j=0;j<m;j++)
			ans.back().push_back(-1);
	}
	for(i=0;i<n;i++)
	{
		for(j=0;j<k;j++)
			w-=x[i][j];
	}
	for(i=0;i<n;i++)
	{
		for(j=m-1;j>=m-k;j--)
			pq.push_back({-x[i][j]-x[i][j-m+k],i});
	}
	sort(pq.begin(),pq.end());
	for(i=0;i<k*n/2;i++)
	{
		w-=pq[i].first;
		it[pq[i].second]--;
	}
	for(i=0;i<n;i++)
	{
		cnt[0].push_back(m-1-it[i]);
		cnt[1].push_back(k-cnt[0].back());
	}
	while(k--)
	{
		vector<pair<int,int>> mx;
		for(i=0;i<n;i++)
			mx.push_back({-cnt[0][i],i});
		sort(mx.begin(),mx.end());
		for(i=0;i<n/2;i++)
			ans[mx[i].second][m-1-(--cnt[0][mx[i].second])]=k;
		for(i=n/2;i<n;i++)
			ans[mx[i].second][--cnt[1][mx[i].second]]=k;
	}
	allocate_tickets(ans);
	return w;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 620 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 27 ms 3052 KB Output is correct
6 Correct 639 ms 55136 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 28 ms 2936 KB Output is correct
6 Correct 704 ms 57140 KB Output is correct
7 Correct 735 ms 60212 KB Output is correct
8 Correct 4 ms 668 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 10 ms 1132 KB Output is correct
13 Correct 28 ms 2664 KB Output is correct
14 Correct 25 ms 2408 KB Output is correct
15 Correct 769 ms 66548 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 620 KB Output is correct
5 Correct 39 ms 3936 KB Output is correct
6 Correct 8 ms 884 KB Output is correct
7 Correct 8 ms 1260 KB Output is correct
8 Correct 994 ms 68556 KB Output is correct
9 Correct 978 ms 64656 KB Output is correct
10 Correct 959 ms 63848 KB Output is correct
11 Correct 1038 ms 68368 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 3 ms 620 KB Output is correct
3 Correct 3 ms 620 KB Output is correct
4 Correct 3 ms 620 KB Output is correct
5 Correct 3 ms 620 KB Output is correct
6 Correct 3 ms 620 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 3 ms 620 KB Output is correct
10 Correct 3 ms 620 KB Output is correct
11 Correct 3 ms 620 KB Output is correct
12 Correct 3 ms 620 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 3 ms 620 KB Output is correct
3 Correct 3 ms 620 KB Output is correct
4 Correct 3 ms 620 KB Output is correct
5 Correct 3 ms 620 KB Output is correct
6 Correct 3 ms 620 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 3 ms 620 KB Output is correct
10 Correct 3 ms 620 KB Output is correct
11 Correct 3 ms 620 KB Output is correct
12 Correct 3 ms 620 KB Output is correct
13 Correct 27 ms 3564 KB Output is correct
14 Correct 27 ms 3696 KB Output is correct
15 Correct 33 ms 3684 KB Output is correct
16 Correct 39 ms 3936 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 3 ms 640 KB Output is correct
19 Correct 2 ms 492 KB Output is correct
20 Correct 36 ms 3172 KB Output is correct
21 Correct 35 ms 3688 KB Output is correct
22 Correct 37 ms 3296 KB Output is correct
23 Correct 39 ms 3812 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 620 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 3 ms 492 KB Output is correct
11 Correct 27 ms 3052 KB Output is correct
12 Correct 639 ms 55136 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 2 ms 492 KB Output is correct
17 Correct 28 ms 2936 KB Output is correct
18 Correct 704 ms 57140 KB Output is correct
19 Correct 735 ms 60212 KB Output is correct
20 Correct 4 ms 668 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 10 ms 1132 KB Output is correct
25 Correct 28 ms 2664 KB Output is correct
26 Correct 25 ms 2408 KB Output is correct
27 Correct 769 ms 66548 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 3 ms 620 KB Output is correct
32 Correct 39 ms 3936 KB Output is correct
33 Correct 8 ms 884 KB Output is correct
34 Correct 8 ms 1260 KB Output is correct
35 Correct 994 ms 68556 KB Output is correct
36 Correct 978 ms 64656 KB Output is correct
37 Correct 959 ms 63848 KB Output is correct
38 Correct 1038 ms 68368 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 3 ms 620 KB Output is correct
41 Correct 3 ms 620 KB Output is correct
42 Correct 3 ms 620 KB Output is correct
43 Correct 3 ms 620 KB Output is correct
44 Correct 3 ms 620 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 3 ms 620 KB Output is correct
48 Correct 3 ms 620 KB Output is correct
49 Correct 3 ms 620 KB Output is correct
50 Correct 3 ms 620 KB Output is correct
51 Correct 27 ms 3564 KB Output is correct
52 Correct 27 ms 3696 KB Output is correct
53 Correct 33 ms 3684 KB Output is correct
54 Correct 39 ms 3936 KB Output is correct
55 Correct 1 ms 364 KB Output is correct
56 Correct 3 ms 640 KB Output is correct
57 Correct 2 ms 492 KB Output is correct
58 Correct 36 ms 3172 KB Output is correct
59 Correct 35 ms 3688 KB Output is correct
60 Correct 37 ms 3296 KB Output is correct
61 Correct 39 ms 3812 KB Output is correct
62 Correct 74 ms 8556 KB Output is correct
63 Correct 73 ms 8556 KB Output is correct
64 Correct 108 ms 9720 KB Output is correct
65 Correct 362 ms 33756 KB Output is correct
66 Correct 429 ms 37840 KB Output is correct
67 Correct 8 ms 1260 KB Output is correct
68 Correct 6 ms 884 KB Output is correct
69 Correct 643 ms 57460 KB Output is correct
70 Correct 812 ms 59444 KB Output is correct
71 Correct 985 ms 68368 KB Output is correct
72 Correct 937 ms 71568 KB Output is correct
73 Correct 989 ms 64960 KB Output is correct
74 Correct 784 ms 64436 KB Output is correct
75 Correct 819 ms 58076 KB Output is correct