oj.uz

Submission #436072

# Submission time Handle Problem Language Result Execution time Memory
436072 2021-06-24T07:40:14 Z prvocislo Carnival Tickets (IOI20_tickets) C++17
100 / 100
 1034 ms 73092 KB 
#include "tickets.h"
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

const int maxn = 2005;
vector<int> cntm(maxn, 0);
bool cmp(const int &i, const int &j) { return cntm[i] < cntm[j]; }
long long find_maximum(int k, vector<vector<int>> x) 
{
	int n = x.size();
	int m = x[0].size();
	ll ans = 0;
	vector<int> l(n, -1), r(n, m); // kolko minusov mame v tomto riadku
	vector<pair<int, int> > p1; // vymenime nejake velke cislo za male cislo
	for (int i = 0; i < n; i++) // zoberieme len maxima
	{
		l[i] = -1, r[i] = m - k;
		for (int j = 0; j < k; j++)
			p1.push_back({x[i][j]+x[i][r[i]+j], i}), ans += x[i][r[i]+j];
	}
	sort(p1.begin(), p1.end());
	for (int i = 0; i < (n * k)/2; i++)
		l[p1[i].second]++, r[p1[i].second]++, ans -= p1[i].first;
	vector<int> v(k);
	vector<vector<int> > s(n, vector<int>(m, -1));
	for (int i = 0; i < k; i++) v[i] = i;
	for (int i = 0; i < n; i++)
	{
		int cnt = 0;
		sort(v.begin(), v.end(), cmp);
		for (int j = 0; j <= l[i]; j++)
			cntm[v[j]]++, s[i][j] = v[cnt++];
		for (int j = r[i]; j < m; j++)
			s[i][j] = v[cnt++];
	}
	allocate_tickets(s);
	return ans;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 31 ms 3356 KB Output is correct
6 Correct 683 ms 73092 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 25 ms 2616 KB Output is correct
6 Correct 620 ms 57764 KB Output is correct
7 Correct 641 ms 60672 KB Output is correct
8 Correct 4 ms 588 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 9 ms 852 KB Output is correct
13 Correct 23 ms 2368 KB Output is correct
14 Correct 22 ms 2376 KB Output is correct
15 Correct 700 ms 63052 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 37 ms 2792 KB Output is correct
6 Correct 7 ms 716 KB Output is correct
7 Correct 7 ms 972 KB Output is correct
8 Correct 959 ms 62164 KB Output is correct
9 Correct 878 ms 58212 KB Output is correct
10 Correct 913 ms 58084 KB Output is correct
11 Correct 997 ms 62140 KB Output is correct

Subtask #5
12.0 / 12.0

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

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 3 ms 332 KB Output is correct
3 Correct 3 ms 332 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 3 ms 460 KB Output is correct
6 Correct 3 ms 460 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 3 ms 460 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 3 ms 460 KB Output is correct
13 Correct 28 ms 2272 KB Output is correct
14 Correct 26 ms 2344 KB Output is correct
15 Correct 31 ms 2380 KB Output is correct
16 Correct 36 ms 2784 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 4 ms 460 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 32 ms 2492 KB Output is correct
21 Correct 52 ms 2468 KB Output is correct
22 Correct 33 ms 2696 KB Output is correct
23 Correct 34 ms 2624 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 716 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 31 ms 3356 KB Output is correct
12 Correct 683 ms 73092 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 296 KB Output is correct
16 Correct 3 ms 460 KB Output is correct
17 Correct 25 ms 2616 KB Output is correct
18 Correct 620 ms 57764 KB Output is correct
19 Correct 641 ms 60672 KB Output is correct
20 Correct 4 ms 588 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 9 ms 852 KB Output is correct
25 Correct 23 ms 2368 KB Output is correct
26 Correct 22 ms 2376 KB Output is correct
27 Correct 700 ms 63052 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 3 ms 460 KB Output is correct
32 Correct 37 ms 2792 KB Output is correct
33 Correct 7 ms 716 KB Output is correct
34 Correct 7 ms 972 KB Output is correct
35 Correct 959 ms 62164 KB Output is correct
36 Correct 878 ms 58212 KB Output is correct
37 Correct 913 ms 58084 KB Output is correct
38 Correct 997 ms 62140 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 3 ms 332 KB Output is correct
41 Correct 3 ms 332 KB Output is correct
42 Correct 3 ms 460 KB Output is correct
43 Correct 3 ms 460 KB Output is correct
44 Correct 3 ms 460 KB Output is correct
45 Correct 1 ms 204 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 3 ms 460 KB Output is correct
48 Correct 3 ms 460 KB Output is correct
49 Correct 3 ms 460 KB Output is correct
50 Correct 3 ms 460 KB Output is correct
51 Correct 28 ms 2272 KB Output is correct
52 Correct 26 ms 2344 KB Output is correct
53 Correct 31 ms 2380 KB Output is correct
54 Correct 36 ms 2784 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 4 ms 460 KB Output is correct
57 Correct 2 ms 332 KB Output is correct
58 Correct 32 ms 2492 KB Output is correct
59 Correct 52 ms 2468 KB Output is correct
60 Correct 33 ms 2696 KB Output is correct
61 Correct 34 ms 2624 KB Output is correct
62 Correct 75 ms 8448 KB Output is correct
63 Correct 70 ms 8388 KB Output is correct
64 Correct 104 ms 9588 KB Output is correct
65 Correct 355 ms 33580 KB Output is correct
66 Correct 429 ms 37492 KB Output is correct
67 Correct 9 ms 1020 KB Output is correct
68 Correct 9 ms 844 KB Output is correct
69 Correct 665 ms 53196 KB Output is correct
70 Correct 834 ms 55168 KB Output is correct
71 Correct 1034 ms 63812 KB Output is correct
72 Correct 959 ms 67828 KB Output is correct
73 Correct 937 ms 60548 KB Output is correct
74 Correct 724 ms 60780 KB Output is correct
75 Correct 775 ms 53672 KB Output is correct