oj.uz

Submission #305656

# Submission time Handle Problem Language Result Execution time Memory
305656 2020-09-23T18:13:38 Z andremfq Carnival Tickets (IOI20_tickets) C++17
100 / 100
 1154 ms 93000 KB 
#include "tickets.h"
#include <bits/stdc++.h>
//sol yan

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;
}

Subtask #1
11.0 / 11.0

# 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

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 32 ms 2432 KB Output is correct
6 Correct 770 ms 51704 KB Output is correct

Subtask #3
14.0 / 14.0

# 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 0 ms 384 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 27 ms 2804 KB Output is correct
6 Correct 689 ms 62360 KB Output is correct
7 Correct 721 ms 68248 KB Output is correct
8 Correct 4 ms 896 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 7 ms 1024 KB Output is correct
13 Correct 25 ms 2676 KB Output is correct
14 Correct 25 ms 2812 KB Output is correct
15 Correct 742 ms 72896 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 1 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 43 ms 3572 KB Output is correct
6 Correct 7 ms 896 KB Output is correct
7 Correct 8 ms 1148 KB Output is correct
8 Correct 1154 ms 93000 KB Output is correct
9 Correct 1064 ms 91108 KB Output is correct
10 Correct 1052 ms 90912 KB Output is correct
11 Correct 1145 ms 92796 KB Output is correct

Subtask #5
12.0 / 12.0

# 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 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 3 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 3 ms 512 KB Output is correct
11 Correct 3 ms 640 KB Output is correct
12 Correct 3 ms 640 KB Output is correct

Subtask #6
23.0 / 23.0

# 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 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 3 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 3 ms 512 KB Output is correct
11 Correct 3 ms 640 KB Output is correct
12 Correct 3 ms 640 KB Output is correct
13 Correct 32 ms 2424 KB Output is correct
14 Correct 33 ms 2432 KB Output is correct
15 Correct 37 ms 2924 KB Output is correct
16 Correct 44 ms 3564 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 3 ms 512 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 33 ms 3060 KB Output is correct
21 Correct 38 ms 3052 KB Output is correct
22 Correct 38 ms 3572 KB Output is correct
23 Correct 41 ms 3564 KB Output is correct

Subtask #7
10.0 / 10.0

# 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 0 ms 384 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 32 ms 2432 KB Output is correct
12 Correct 770 ms 51704 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 3 ms 512 KB Output is correct
17 Correct 27 ms 2804 KB Output is correct
18 Correct 689 ms 62360 KB Output is correct
19 Correct 721 ms 68248 KB Output is correct
20 Correct 4 ms 896 KB Output is correct
21 Correct 0 ms 384 KB Output is correct
22 Correct 0 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 7 ms 1024 KB Output is correct
25 Correct 25 ms 2676 KB Output is correct
26 Correct 25 ms 2812 KB Output is correct
27 Correct 742 ms 72896 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 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 43 ms 3572 KB Output is correct
33 Correct 7 ms 896 KB Output is correct
34 Correct 8 ms 1148 KB Output is correct
35 Correct 1154 ms 93000 KB Output is correct
36 Correct 1064 ms 91108 KB Output is correct
37 Correct 1052 ms 90912 KB Output is correct
38 Correct 1145 ms 92796 KB Output is correct
39 Correct 1 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 3 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 3 ms 512 KB Output is correct
49 Correct 3 ms 640 KB Output is correct
50 Correct 3 ms 640 KB Output is correct
51 Correct 32 ms 2424 KB Output is correct
52 Correct 33 ms 2432 KB Output is correct
53 Correct 37 ms 2924 KB Output is correct
54 Correct 44 ms 3564 KB Output is correct
55 Correct 1 ms 384 KB Output is correct
56 Correct 3 ms 512 KB Output is correct
57 Correct 2 ms 512 KB Output is correct
58 Correct 33 ms 3060 KB Output is correct
59 Correct 38 ms 3052 KB Output is correct
60 Correct 38 ms 3572 KB Output is correct
61 Correct 41 ms 3564 KB Output is correct
62 Correct 87 ms 6096 KB Output is correct
63 Correct 91 ms 6136 KB Output is correct
64 Correct 138 ms 9188 KB Output is correct
65 Correct 419 ms 27868 KB Output is correct
66 Correct 494 ms 35840 KB Output is correct
67 Correct 9 ms 1148 KB Output is correct
68 Correct 7 ms 896 KB Output is correct
69 Correct 776 ms 51452 KB Output is correct
70 Correct 964 ms 62360 KB Output is correct
71 Correct 1148 ms 92696 KB Output is correct
72 Correct 974 ms 91832 KB Output is correct
73 Correct 1060 ms 75032 KB Output is correct
74 Correct 807 ms 61972 KB Output is correct
75 Correct 935 ms 61464 KB Output is correct