oj.uz

Submission #305658

# Submission time Handle Problem Language Result Execution time Memory
305658 2020-09-23T18:19:43 Z CaroLinda Carnival Tickets (IOI20_tickets) C++14
100 / 100
 1342 ms 101836 KB 
#include "tickets.h"
#include <bits/stdc++.h>

#define ff first
#define ss second
#define mk make_pair
#define all(x) x.begin(),x.end()
#define pii pair<int,int>

using namespace std ;

long long find_maximum(int k, std::vector<std::vector<int>> x) {
	
	int n = x.size();
	int m = x[0].size();
	long long tot = 0LL ;
	
	vector< vector<int> > answer( n , vector<int>(m,-1) ) ;
	vector< vector<int> > idx(n , vector<int>(m) ) ;
	vector< pair<long long, int> > somas ;
	vector<int> peguei(n,0) ;

	for(int i = 0 ; i < n ; i++ )
	{
		iota(all(idx[i]) , 0 ) ;
		sort( all(idx[i]) , [&](int a, int b) { return x[i][a] < x[i][b] ; } ) ;

		for(int j = 0 ; j < k ; j++ ) tot -= x[i][ idx[i][j] ] ;

		for(int j = k-1 , g = m-1 ; j >= 0 ; j-- , g-- )
			somas.push_back( mk(x[i][j] + x[i][g] , i) ) ;

	}

	sort(all(somas)) ;
	reverse(all(somas)) ;
	
	for(int i = 0 ; i < (n * k)/2 ; i++ )
	{
		peguei[ somas[i].second ]++ ;
		tot += somas[i].first;
	}

	set< pii > s ;

	for(int i = 0 ; i < n ; i++ ) 
		if( peguei[i] ) s.insert( mk( -peguei[i] , i ) ) ;

	for(int round=0 ; round < k ; round++ )
	{

		vector<pii> toReInsert ;

		for(int i = 0 ; i < n/2 ; i++ )
		{
			auto topo = *s.begin() ;
			s.erase(s.begin()) ;

			if(-topo.ff != 1)
				toReInsert.push_back( mk( topo.ff +1 , topo.ss ) ) ;

			answer[ topo.ss ][ idx[topo.ss].back() ] = round ;
			idx[topo.ss].pop_back() ;

		}

		for(auto p : toReInsert) s.insert(p) ;

	}

	vector<bool> freq(m,false) ;

	for(int i = 0 ; i < n ; i++ )
	{	
		for(int j = 0 ; j < m ; j++ )
			if(answer[i][j] != -1) freq[ answer[i][j] ] = true ;

		int ptr = 0 ;

		for(int j = 0 ; j < k - peguei[i]; j++ )
		{
			while( ptr < k && freq[ptr] ) ptr++ ;
			answer[i][ idx[i][j] ] =  ptr ;
			freq[ptr] = true ;
		}

		for(int j = 0 ; j < k ; j++ ) freq[j] =false ;

	}
	
	allocate_tickets(answer);
	return tot ;
}

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 256 KB Output is correct
3 Correct 1 ms 256 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 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 32 ms 2808 KB Output is correct
6 Correct 773 ms 60408 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 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 32 ms 3188 KB Output is correct
6 Correct 905 ms 71224 KB Output is correct
7 Correct 866 ms 77172 KB Output is correct
8 Correct 5 ms 896 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 9 ms 1152 KB Output is correct
13 Correct 28 ms 2932 KB Output is correct
14 Correct 28 ms 3060 KB Output is correct
15 Correct 909 ms 81816 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 4 ms 640 KB Output is correct
5 Correct 58 ms 3956 KB Output is correct
6 Correct 8 ms 900 KB Output is correct
7 Correct 9 ms 1152 KB Output is correct
8 Correct 1327 ms 101836 KB Output is correct
9 Correct 1236 ms 99208 KB Output is correct
10 Correct 1221 ms 99232 KB Output is correct
11 Correct 1310 ms 101784 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 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 3 ms 512 KB Output is correct
6 Correct 4 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 4 ms 640 KB Output is correct
12 Correct 5 ms 640 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 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 3 ms 512 KB Output is correct
6 Correct 4 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 4 ms 640 KB Output is correct
12 Correct 5 ms 640 KB Output is correct
13 Correct 32 ms 2816 KB Output is correct
14 Correct 31 ms 2808 KB Output is correct
15 Correct 40 ms 3188 KB Output is correct
16 Correct 50 ms 3956 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 38 ms 3312 KB Output is correct
21 Correct 41 ms 3312 KB Output is correct
22 Correct 43 ms 3960 KB Output is correct
23 Correct 45 ms 3960 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 256 KB Output is correct
3 Correct 1 ms 256 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 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 32 ms 2808 KB Output is correct
12 Correct 773 ms 60408 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 3 ms 512 KB Output is correct
17 Correct 32 ms 3188 KB Output is correct
18 Correct 905 ms 71224 KB Output is correct
19 Correct 866 ms 77172 KB Output is correct
20 Correct 5 ms 896 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 1 ms 256 KB Output is correct
24 Correct 9 ms 1152 KB Output is correct
25 Correct 28 ms 2932 KB Output is correct
26 Correct 28 ms 3060 KB Output is correct
27 Correct 909 ms 81816 KB Output is correct
28 Correct 1 ms 256 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 4 ms 640 KB Output is correct
32 Correct 58 ms 3956 KB Output is correct
33 Correct 8 ms 900 KB Output is correct
34 Correct 9 ms 1152 KB Output is correct
35 Correct 1327 ms 101836 KB Output is correct
36 Correct 1236 ms 99208 KB Output is correct
37 Correct 1221 ms 99232 KB Output is correct
38 Correct 1310 ms 101784 KB Output is correct
39 Correct 1 ms 256 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 3 ms 512 KB Output is correct
44 Correct 4 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 4 ms 640 KB Output is correct
50 Correct 5 ms 640 KB Output is correct
51 Correct 32 ms 2816 KB Output is correct
52 Correct 31 ms 2808 KB Output is correct
53 Correct 40 ms 3188 KB Output is correct
54 Correct 50 ms 3956 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 38 ms 3312 KB Output is correct
59 Correct 41 ms 3312 KB Output is correct
60 Correct 43 ms 3960 KB Output is correct
61 Correct 45 ms 3960 KB Output is correct
62 Correct 84 ms 7016 KB Output is correct
63 Correct 84 ms 7072 KB Output is correct
64 Correct 136 ms 10212 KB Output is correct
65 Correct 449 ms 31824 KB Output is correct
66 Correct 587 ms 39748 KB Output is correct
67 Correct 11 ms 1200 KB Output is correct
68 Correct 8 ms 900 KB Output is correct
69 Correct 763 ms 60280 KB Output is correct
70 Correct 1038 ms 71064 KB Output is correct
71 Correct 1342 ms 101736 KB Output is correct
72 Correct 1156 ms 100528 KB Output is correct
73 Correct 1219 ms 83544 KB Output is correct
74 Correct 923 ms 70504 KB Output is correct
75 Correct 1018 ms 69920 KB Output is correct