oj.uz

Submission #420009

# Submission time Handle Problem Language Result Execution time Memory
420009 2021-06-07T21:54:24 Z MohamedAhmed04 Carnival Tickets (IOI20_tickets) C++14
100 / 100
 1237 ms 100976 KB 
#include <bits/stdc++.h>
#include "tickets.h"
//#include "grader.cpp"

using namespace std ;

const int MAX = 1500 + 10 ;

int cnt[MAX] ;

vector< vector<int> >sign ;
vector<int>neg[MAX] , pos[MAX] ;

vector< vector<int> >v ;
int n , m , k ;

void Allocate()
{
	vector< vector<int> >alo = vector< vector<int> >(n , vector<int>(m , -1)) ;
	for(int i = 0 ; i < n ; ++i)
	{
		for(int j = 0 ; j < m ; ++j)
		{
			if(sign[i][j] == 1)
				pos[i].push_back(j) ;
			else if(sign[i][j] == -1)
				neg[i].push_back(j) ;
		}
		if(pos[i].size() + neg[i].size() != k)
			while(1) ;
	}
	vector< pair<int , int> >vp ;
	for(int i = 0 ; i < k ; ++i)
	{
		vp.clear() ;
		for(int j = 0 ; j < n ; ++j)
			vp.emplace_back(neg[j].size() , j) ;
		sort(vp.begin() , vp.end()) ;
		for(int j = 0 ; j < n ; ++j)
		{
			int idx = vp[j].second ;
			if(j < n/2)
			{
				alo[idx][pos[idx].back()] = i ;
				pos[idx].pop_back() ;
			}
			else
			{
				alo[idx][neg[idx].back()] = i ;
				neg[idx].pop_back() ;
			}
		}
	}
	allocate_tickets(alo) ;
}

long long find_maximum(int K, std::vector<std::vector<int>> arr) 
{
	v = arr ;
	n = v.size() , m = v[0].size() , k = K ;
	long long ans = 0 ;
	vector< array<int , 3> >v2 ;
	sign = vector< vector<int> >(n , vector<int>(m , 0)) ;
	for(int i = 0 ; i < n ; ++i)
	{
		for(int j = m-1 ; j > m-1-k ; --j)
		{
			ans += v[i][j] , sign[i][j] = 1 ;
		}
		for(int j = 0 ; j < k ; ++j)
		{
			if(m-1-k+1+j < m)
				v2.push_back({v[i][j] + v[i][m-1-k+1+j] , i , j}) ;
		}
	}
	sort(v2.begin() , v2.end()) ;
	int taken = 0 ;
	for(auto &p : v2)
	{
		if(taken == n*k/2)
			break ;
		if(cnt[p[1]] == k)
			continue ;
		taken++ ;
		ans -= p[0] ;
		cnt[p[1]]++ ;
		sign[p[1]][p[2]] = -1 ;
		if(m != k)
			sign[p[1]][m-1-k+1+p[2]] = 0 ;
	}
	Allocate() ;
	return ans ;
}

Compilation message

tickets.cpp: In function 'void Allocate()':
tickets.cpp:29:36: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   29 |   if(pos[i].size() + neg[i].size() != k)
      |      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 2 ms 972 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 26 ms 3088 KB Output is correct
6 Correct 681 ms 69380 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 3 ms 588 KB Output is correct
5 Correct 33 ms 3672 KB Output is correct
6 Correct 853 ms 81772 KB Output is correct
7 Correct 899 ms 89032 KB Output is correct
8 Correct 5 ms 784 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 8 ms 1292 KB Output is correct
13 Correct 28 ms 3396 KB Output is correct
14 Correct 29 ms 3428 KB Output is correct
15 Correct 976 ms 93692 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 3 ms 588 KB Output is correct
5 Correct 42 ms 4612 KB Output is correct
6 Correct 7 ms 1040 KB Output is correct
7 Correct 9 ms 1356 KB Output is correct
8 Correct 1126 ms 100876 KB Output is correct
9 Correct 1088 ms 95048 KB Output is correct
10 Correct 1100 ms 94276 KB Output is correct
11 Correct 1237 ms 100976 KB Output is correct

Subtask #5
12.0 / 12.0

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

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 3 ms 460 KB Output is correct
3 Correct 2 ms 588 KB Output is correct
4 Correct 3 ms 588 KB Output is correct
5 Correct 4 ms 588 KB Output is correct
6 Correct 3 ms 588 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 3 ms 588 KB Output is correct
10 Correct 3 ms 588 KB Output is correct
11 Correct 3 ms 676 KB Output is correct
12 Correct 3 ms 588 KB Output is correct
13 Correct 26 ms 3072 KB Output is correct
14 Correct 26 ms 3208 KB Output is correct
15 Correct 34 ms 3656 KB Output is correct
16 Correct 40 ms 4548 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 3 ms 588 KB Output is correct
19 Correct 2 ms 460 KB Output is correct
20 Correct 35 ms 3776 KB Output is correct
21 Correct 35 ms 3784 KB Output is correct
22 Correct 43 ms 4260 KB Output is correct
23 Correct 41 ms 4148 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 2 ms 972 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 26 ms 3088 KB Output is correct
12 Correct 681 ms 69380 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 3 ms 588 KB Output is correct
17 Correct 33 ms 3672 KB Output is correct
18 Correct 853 ms 81772 KB Output is correct
19 Correct 899 ms 89032 KB Output is correct
20 Correct 5 ms 784 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 8 ms 1292 KB Output is correct
25 Correct 28 ms 3396 KB Output is correct
26 Correct 29 ms 3428 KB Output is correct
27 Correct 976 ms 93692 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 0 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 3 ms 588 KB Output is correct
32 Correct 42 ms 4612 KB Output is correct
33 Correct 7 ms 1040 KB Output is correct
34 Correct 9 ms 1356 KB Output is correct
35 Correct 1126 ms 100876 KB Output is correct
36 Correct 1088 ms 95048 KB Output is correct
37 Correct 1100 ms 94276 KB Output is correct
38 Correct 1237 ms 100976 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 3 ms 460 KB Output is correct
41 Correct 2 ms 588 KB Output is correct
42 Correct 3 ms 588 KB Output is correct
43 Correct 4 ms 588 KB Output is correct
44 Correct 3 ms 588 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 3 ms 588 KB Output is correct
48 Correct 3 ms 588 KB Output is correct
49 Correct 3 ms 676 KB Output is correct
50 Correct 3 ms 588 KB Output is correct
51 Correct 26 ms 3072 KB Output is correct
52 Correct 26 ms 3208 KB Output is correct
53 Correct 34 ms 3656 KB Output is correct
54 Correct 40 ms 4548 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 3 ms 588 KB Output is correct
57 Correct 2 ms 460 KB Output is correct
58 Correct 35 ms 3776 KB Output is correct
59 Correct 35 ms 3784 KB Output is correct
60 Correct 43 ms 4260 KB Output is correct
61 Correct 41 ms 4148 KB Output is correct
62 Correct 73 ms 8092 KB Output is correct
63 Correct 73 ms 8084 KB Output is correct
64 Correct 116 ms 11596 KB Output is correct
65 Correct 371 ms 36516 KB Output is correct
66 Correct 468 ms 44732 KB Output is correct
67 Correct 9 ms 1420 KB Output is correct
68 Correct 6 ms 1040 KB Output is correct
69 Correct 631 ms 69308 KB Output is correct
70 Correct 847 ms 81624 KB Output is correct
71 Correct 1133 ms 100868 KB Output is correct
72 Correct 1129 ms 96896 KB Output is correct
73 Correct 1086 ms 95760 KB Output is correct
74 Correct 845 ms 80472 KB Output is correct
75 Correct 871 ms 79924 KB Output is correct