Submission #305651

# Submission time Handle Problem Language Result Execution time Memory
305651 2020-09-23T18:10:07 Z Lawliet Carnival Tickets (IOI20_tickets) C++14
100 / 100
1145 ms 92820 KB
#include "tickets.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long int lli;
typedef pair<int,int> pii;

const int MAXN = 1510;

int pL[MAXN], pR[MAXN];
int qtd[MAXN], ord[MAXN];

bool cmp(int i, int j) { return qtd[i] > qtd[j]; }

long long find_maximum(int k, vector< vector<int> > x) 
{
	int n = x.size();
	int m = x[0].size();

	vector< vector<int> > answer;

	for(int i = 0; i < n; i++) 
		answer.push_back( vector<int>( m , -1 ) );

	lli ans = 0;
	vector< pair<lli,int> > sum;

	for(int i = 0 ; i < n ; i++)
	{
		qtd[i] = k;

		for(int j = 0 ; j < k ; j++)
		{
			ans -= x[i][j];
			sum.push_back( { x[i][j] + x[i][m - k + j] , i } );
		}
	}

	sort( sum.begin() , sum.end() );
	reverse( sum.begin() , sum.end() );

	for(int i = 0 ; i < (n/2)*k ; i++)
	{
		ans += sum[i].first;
		qtd[ sum[i].second ]--;
	}

	iota( ord , ord + n , 0 );

	for(int i = 0 ; i < n ; i++)
		pL[i] = 0, pR[i] = m - 1;

	for(int t = 0 ; t < k ; t++)
	{
		sort( ord , ord + n , cmp );

		for(int i = 0 ; i < n/2 ; i++)
			answer[ ord[i] ][ pL[ ord[i] ]++ ] = t, qtd[ ord[i] ]--;

		for(int i = n/2 ; i < n ; i++)
			answer[ ord[i] ][ pR[ ord[i] ]-- ] = t;
	}

	allocate_tickets( answer );

	return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 768 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 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 31 ms 2400 KB Output is correct
6 Correct 751 ms 51512 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 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 2 ms 512 KB Output is correct
5 Correct 28 ms 2932 KB Output is correct
6 Correct 712 ms 62488 KB Output is correct
7 Correct 740 ms 68248 KB Output is correct
8 Correct 4 ms 896 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 24 ms 2676 KB Output is correct
14 Correct 24 ms 2812 KB Output is correct
15 Correct 746 ms 72984 KB Output is correct
# 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 44 ms 3572 KB Output is correct
6 Correct 7 ms 896 KB Output is correct
7 Correct 10 ms 1148 KB Output is correct
8 Correct 1116 ms 92820 KB Output is correct
9 Correct 1043 ms 90944 KB Output is correct
10 Correct 1050 ms 91040 KB Output is correct
11 Correct 1145 ms 92692 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 4 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 6 ms 640 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 4 ms 512 KB Output is correct
11 Correct 3 ms 640 KB Output is correct
12 Correct 4 ms 640 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 4 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 6 ms 640 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 4 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 33 ms 2432 KB Output is correct
14 Correct 32 ms 2432 KB Output is correct
15 Correct 38 ms 2804 KB Output is correct
16 Correct 43 ms 3564 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 5 ms 512 KB Output is correct
19 Correct 3 ms 512 KB Output is correct
20 Correct 34 ms 3052 KB Output is correct
21 Correct 37 ms 3060 KB Output is correct
22 Correct 37 ms 3572 KB Output is correct
23 Correct 42 ms 3580 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 768 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 31 ms 2400 KB Output is correct
12 Correct 751 ms 51512 KB Output is correct
13 Correct 1 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 2 ms 512 KB Output is correct
17 Correct 28 ms 2932 KB Output is correct
18 Correct 712 ms 62488 KB Output is correct
19 Correct 740 ms 68248 KB Output is correct
20 Correct 4 ms 896 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 24 ms 2676 KB Output is correct
26 Correct 24 ms 2812 KB Output is correct
27 Correct 746 ms 72984 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 44 ms 3572 KB Output is correct
33 Correct 7 ms 896 KB Output is correct
34 Correct 10 ms 1148 KB Output is correct
35 Correct 1116 ms 92820 KB Output is correct
36 Correct 1043 ms 90944 KB Output is correct
37 Correct 1050 ms 91040 KB Output is correct
38 Correct 1145 ms 92692 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 3 ms 512 KB Output is correct
41 Correct 4 ms 512 KB Output is correct
42 Correct 3 ms 512 KB Output is correct
43 Correct 3 ms 512 KB Output is correct
44 Correct 6 ms 640 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 4 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 33 ms 2432 KB Output is correct
52 Correct 32 ms 2432 KB Output is correct
53 Correct 38 ms 2804 KB Output is correct
54 Correct 43 ms 3564 KB Output is correct
55 Correct 2 ms 384 KB Output is correct
56 Correct 5 ms 512 KB Output is correct
57 Correct 3 ms 512 KB Output is correct
58 Correct 34 ms 3052 KB Output is correct
59 Correct 37 ms 3060 KB Output is correct
60 Correct 37 ms 3572 KB Output is correct
61 Correct 42 ms 3580 KB Output is correct
62 Correct 103 ms 6136 KB Output is correct
63 Correct 112 ms 6184 KB Output is correct
64 Correct 118 ms 9192 KB Output is correct
65 Correct 407 ms 27868 KB Output is correct
66 Correct 483 ms 35780 KB Output is correct
67 Correct 10 ms 1148 KB Output is correct
68 Correct 7 ms 896 KB Output is correct
69 Correct 768 ms 51580 KB Output is correct
70 Correct 943 ms 62488 KB Output is correct
71 Correct 1134 ms 92696 KB Output is correct
72 Correct 993 ms 91832 KB Output is correct
73 Correct 1029 ms 74900 KB Output is correct
74 Correct 792 ms 62104 KB Output is correct
75 Correct 908 ms 61464 KB Output is correct