oj.uz

Submission #304806

# Submission time Handle Problem Language Result Execution time Memory
304806 2020-09-21T22:37:29 Z arthur_nascimento Carnival Tickets (IOI20_tickets) C++14
100 / 100
 1074 ms 54520 KB 
#include "tickets.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
#define maxn 1515
#define pii pair<int,int>

int ini[maxn];
int fim[maxn];

long long find_maximum(int k, std::vector<std::vector<int>> x) {

	int n = x.size();
	int m = x[0].size();

	std::vector<std::vector<int>> answer;

	for (int i = 0; i < n; i++) {
		std::vector<int> row(m);
		for (int j = 0; j < m; j++) {
			row[j] = -1;
		}
		answer.push_back(row);
	}

	long long ans = 0;

	set<pii> S;

	for(int i=0;i<n;i++){
		for(int j=m-k;j<m;j++){
			ans += x[i][j];
			answer[i][j] = -2;
		}
		ini[i] = 0;
		fim[i] = m-k;
		S.insert({x[i][ini[i]] + x[i][fim[i]],i});
	}	

	for(int i=0;i<(k*n)/2;i++){
		pii u = *S.begin();
		S.erase(S.begin());
		ans -= u.first;
		int id = u.second;
		
		
		answer[id][fim[id]] = -1;
		answer[id][ini[id]] = -3;
		fim[id]++;ini[id]++;
		
		
		if(fim[id] < m){
			S.insert({x[id][ini[id]] + x[id][fim[id]],id});
		}
	}

	int cur = 0, curcur = 0;
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			if(answer[i][j] == -3){
				answer[i][j] = cur;
				cur = (cur+1) % k;
				curcur = cur;
			}
			if(answer[i][j] == -2){
				answer[i][j] = curcur;
				curcur = (curcur+1) % k;
			}

		}
		//cur = curcur;
	}
	
	allocate_tickets(answer);
	return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 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 256 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 33 ms 2432 KB Output is correct
6 Correct 756 ms 51448 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 26 ms 2552 KB Output is correct
6 Correct 623 ms 52408 KB Output is correct
7 Correct 634 ms 52984 KB Output is correct
8 Correct 3 ms 512 KB Output is correct
9 Correct 0 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 7 ms 896 KB Output is correct
13 Correct 21 ms 2048 KB Output is correct
14 Correct 22 ms 2048 KB Output is correct
15 Correct 658 ms 53556 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 0 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 40 ms 2428 KB Output is correct
6 Correct 7 ms 640 KB Output is correct
7 Correct 8 ms 896 KB Output is correct
8 Correct 1066 ms 54392 KB Output is correct
9 Correct 987 ms 50680 KB Output is correct
10 Correct 972 ms 50808 KB Output is correct
11 Correct 1039 ms 54520 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 3 ms 512 KB Output is correct
6 Correct 3 ms 512 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 512 KB Output is correct
12 Correct 3 ms 512 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 3 ms 512 KB Output is correct
6 Correct 3 ms 512 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 512 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 35 ms 2552 KB Output is correct
14 Correct 32 ms 2476 KB Output is correct
15 Correct 36 ms 2432 KB Output is correct
16 Correct 43 ms 2428 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 4 ms 512 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 31 ms 2424 KB Output is correct
21 Correct 37 ms 2432 KB Output is correct
22 Correct 34 ms 2424 KB Output is correct
23 Correct 38 ms 2468 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 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 256 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 33 ms 2432 KB Output is correct
12 Correct 756 ms 51448 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 26 ms 2552 KB Output is correct
18 Correct 623 ms 52408 KB Output is correct
19 Correct 634 ms 52984 KB Output is correct
20 Correct 3 ms 512 KB Output is correct
21 Correct 0 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 7 ms 896 KB Output is correct
25 Correct 21 ms 2048 KB Output is correct
26 Correct 22 ms 2048 KB Output is correct
27 Correct 658 ms 53556 KB Output is correct
28 Correct 1 ms 256 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 3 ms 512 KB Output is correct
32 Correct 40 ms 2428 KB Output is correct
33 Correct 7 ms 640 KB Output is correct
34 Correct 8 ms 896 KB Output is correct
35 Correct 1066 ms 54392 KB Output is correct
36 Correct 987 ms 50680 KB Output is correct
37 Correct 972 ms 50808 KB Output is correct
38 Correct 1039 ms 54520 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 3 ms 512 KB Output is correct
44 Correct 3 ms 512 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 512 KB Output is correct
50 Correct 3 ms 512 KB Output is correct
51 Correct 35 ms 2552 KB Output is correct
52 Correct 32 ms 2476 KB Output is correct
53 Correct 36 ms 2432 KB Output is correct
54 Correct 43 ms 2428 KB Output is correct
55 Correct 1 ms 384 KB Output is correct
56 Correct 4 ms 512 KB Output is correct
57 Correct 2 ms 384 KB Output is correct
58 Correct 31 ms 2424 KB Output is correct
59 Correct 37 ms 2432 KB Output is correct
60 Correct 34 ms 2424 KB Output is correct
61 Correct 38 ms 2468 KB Output is correct
62 Correct 85 ms 6072 KB Output is correct
63 Correct 87 ms 6136 KB Output is correct
64 Correct 112 ms 6264 KB Output is correct
65 Correct 407 ms 23672 KB Output is correct
66 Correct 476 ms 24080 KB Output is correct
67 Correct 9 ms 896 KB Output is correct
68 Correct 7 ms 640 KB Output is correct
69 Correct 790 ms 51504 KB Output is correct
70 Correct 930 ms 52472 KB Output is correct
71 Correct 1074 ms 54392 KB Output is correct
72 Correct 783 ms 52344 KB Output is correct
73 Correct 995 ms 52216 KB Output is correct
74 Correct 712 ms 50812 KB Output is correct
75 Correct 886 ms 50808 KB Output is correct