oj.uz

Submission #302706

# Submission time Handle Problem Language Result Execution time Memory
302706 2020-09-19T04:30:42 Z arnold518 Carnival Tickets (IOI20_tickets) C++14
100 / 100
 1186 ms 97788 KB 
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 1500;

int N, M, K;
int A[MAXN+10][MAXN+10];
int P[MAXN+10], Q[MAXN+10];
int ans2[MAXN+10][MAXN+10];
ll ans;

int L[MAXN+10], R[MAXN+10], chk[MAXN+10];

ll find_maximum(int _K, vector<vector<int>> _X)
{
	N=_X.size(); M=_X[0].size(); K=_K;
	for(int i=1; i<=N; i++) for(int j=1; j<=M; j++) A[i][j]=_X[i-1][j-1];

	for(int i=1; i<=N; i++) P[i]=0;

	vector<pll> V;
	for(int i=1; i<=N; i++) for(int j=1; j<=K; j++) V.push_back({A[i][j+M-K]+A[i][j], i});
	sort(V.begin(), V.end());

	for(int i=0; i<V.size()/2; i++) P[V[i].second]++;
	for(int i=V.size()/2; i<V.size(); i++) Q[V[i].second]++;

	for(int i=1; i<=N; i++) L[i]=1, R[i]=1;
	for(int i=1; i<=K; i++)
	{
		vector<pii> V;
		for(int j=1; j<=N; j++) V.push_back({Q[j]-R[j]-P[j]+L[j], j});
		sort(V.begin(), V.end());

		for(int j=1; j<=N; j++) chk[j]=0;
		for(int j=0; j<N/2; j++) chk[V[j].second]=1;

		for(int j=1; j<=N; j++)
		{
			if(!chk[j])
			{
				ans+=A[j][M-R[j]+1];
				ans2[j][M-R[j]+1]=i;
				R[j]++;
			}
			else
			{
				ans-=A[j][L[j]];
				ans2[j][L[j]]=i;
				L[j]++;
			}
		}
	}

	vector<vector<int>> answer;
	answer=vector<vector<int>>(N, vector<int>(M));
	for(int i=1; i<=N; i++) for(int j=1; j<=M; j++) answer[i-1][j-1]=ans2[i][j]-1;
	allocate_tickets(answer);
	return ans;
}

Compilation message

tickets.cpp: In function 'll find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:30:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |  for(int i=0; i<V.size()/2; i++) P[V[i].second]++;
      |               ~^~~~~~~~~~~
tickets.cpp:31:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |  for(int i=V.size()/2; i<V.size(); i++) Q[V[i].second]++;
      |                        ~^~~~~~~~~

Subtask #1
11.0 / 11.0

# 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 0 ms 384 KB Output is correct
4 Correct 1 ms 1024 KB Output is correct
5 Correct 2 ms 2816 KB Output is correct
6 Correct 7 ms 12800 KB Output is correct

Subtask #2
16.0 / 16.0

# 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 3 ms 1152 KB Output is correct
5 Correct 33 ms 5240 KB Output is correct
6 Correct 756 ms 64860 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 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 3 ms 1280 KB Output is correct
5 Correct 28 ms 5880 KB Output is correct
6 Correct 711 ms 80152 KB Output is correct
7 Correct 769 ms 85912 KB Output is correct
8 Correct 4 ms 1536 KB Output is correct
9 Correct 0 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 2428 KB Output is correct
13 Correct 29 ms 7288 KB Output is correct
14 Correct 25 ms 4600 KB Output is correct
15 Correct 763 ms 90652 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 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 4 ms 1304 KB Output is correct
5 Correct 47 ms 6636 KB Output is correct
6 Correct 7 ms 1024 KB Output is correct
7 Correct 15 ms 13312 KB Output is correct
8 Correct 1154 ms 97788 KB Output is correct
9 Correct 1100 ms 92524 KB Output is correct
10 Correct 1119 ms 91224 KB Output is correct
11 Correct 1186 ms 97748 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 3 ms 1152 KB Output is correct
3 Correct 3 ms 1152 KB Output is correct
4 Correct 3 ms 1152 KB Output is correct
5 Correct 3 ms 1280 KB Output is correct
6 Correct 4 ms 1280 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 1024 KB Output is correct
9 Correct 3 ms 1280 KB Output is correct
10 Correct 3 ms 1280 KB Output is correct
11 Correct 4 ms 1280 KB Output is correct
12 Correct 4 ms 1280 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 3 ms 1152 KB Output is correct
3 Correct 3 ms 1152 KB Output is correct
4 Correct 3 ms 1152 KB Output is correct
5 Correct 3 ms 1280 KB Output is correct
6 Correct 4 ms 1280 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 1024 KB Output is correct
9 Correct 3 ms 1280 KB Output is correct
10 Correct 3 ms 1280 KB Output is correct
11 Correct 4 ms 1280 KB Output is correct
12 Correct 4 ms 1280 KB Output is correct
13 Correct 33 ms 5368 KB Output is correct
14 Correct 33 ms 5632 KB Output is correct
15 Correct 39 ms 6000 KB Output is correct
16 Correct 45 ms 6772 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 4 ms 3072 KB Output is correct
19 Correct 3 ms 2944 KB Output is correct
20 Correct 38 ms 6132 KB Output is correct
21 Correct 40 ms 5996 KB Output is correct
22 Correct 40 ms 6504 KB Output is correct
23 Correct 44 ms 6376 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 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 1024 KB Output is correct
5 Correct 2 ms 2816 KB Output is correct
6 Correct 7 ms 12800 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 3 ms 1152 KB Output is correct
11 Correct 33 ms 5240 KB Output is correct
12 Correct 756 ms 64860 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 3 ms 1280 KB Output is correct
17 Correct 28 ms 5880 KB Output is correct
18 Correct 711 ms 80152 KB Output is correct
19 Correct 769 ms 85912 KB Output is correct
20 Correct 4 ms 1536 KB Output is correct
21 Correct 0 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 2428 KB Output is correct
25 Correct 29 ms 7288 KB Output is correct
26 Correct 25 ms 4600 KB Output is correct
27 Correct 763 ms 90652 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 1304 KB Output is correct
32 Correct 47 ms 6636 KB Output is correct
33 Correct 7 ms 1024 KB Output is correct
34 Correct 15 ms 13312 KB Output is correct
35 Correct 1154 ms 97788 KB Output is correct
36 Correct 1100 ms 92524 KB Output is correct
37 Correct 1119 ms 91224 KB Output is correct
38 Correct 1186 ms 97748 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 3 ms 1152 KB Output is correct
41 Correct 3 ms 1152 KB Output is correct
42 Correct 3 ms 1152 KB Output is correct
43 Correct 3 ms 1280 KB Output is correct
44 Correct 4 ms 1280 KB Output is correct
45 Correct 1 ms 512 KB Output is correct
46 Correct 1 ms 1024 KB Output is correct
47 Correct 3 ms 1280 KB Output is correct
48 Correct 3 ms 1280 KB Output is correct
49 Correct 4 ms 1280 KB Output is correct
50 Correct 4 ms 1280 KB Output is correct
51 Correct 33 ms 5368 KB Output is correct
52 Correct 33 ms 5632 KB Output is correct
53 Correct 39 ms 6000 KB Output is correct
54 Correct 45 ms 6772 KB Output is correct
55 Correct 1 ms 512 KB Output is correct
56 Correct 4 ms 3072 KB Output is correct
57 Correct 3 ms 2944 KB Output is correct
58 Correct 38 ms 6132 KB Output is correct
59 Correct 40 ms 5996 KB Output is correct
60 Correct 40 ms 6504 KB Output is correct
61 Correct 44 ms 6376 KB Output is correct
62 Correct 88 ms 11640 KB Output is correct
63 Correct 93 ms 11932 KB Output is correct
64 Correct 128 ms 15204 KB Output is correct
65 Correct 435 ms 39764 KB Output is correct
66 Correct 512 ms 47552 KB Output is correct
67 Correct 15 ms 13312 KB Output is correct
68 Correct 7 ms 1024 KB Output is correct
69 Correct 755 ms 66764 KB Output is correct
70 Correct 963 ms 80072 KB Output is correct
71 Correct 1149 ms 97756 KB Output is correct
72 Correct 1010 ms 93792 KB Output is correct
73 Correct 1106 ms 92084 KB Output is correct
74 Correct 826 ms 79652 KB Output is correct
75 Correct 954 ms 78488 KB Output is correct