oj.uz

Submission #435828

# Submission time Handle Problem Language Result Execution time Memory
435828 2021-06-23T18:56:19 Z prvocislo Carnival Tickets (IOI20_tickets) C++17
49 / 100
 3000 ms 86552 KB 
#include "tickets.h"
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

long long find_maximum(int k, vector<vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	ll ans = 0;
	vector<int> mi(n, 0); // kolko minusov mame v tomto riadku
	priority_queue<pair<ll, int> > p1; // vymenime nejake velke cislo za male cislo
	for (int i = 0; i < n/2; i++) // zoberieme len maxima
	{
		for (int j = 0; j < k; j++)
		{
			p1.push({-x[i][j] - x[i][m - k + j], i});
			ans += x[i][m - k + j];
		}
	}
	priority_queue<pair<ll, int> > p2;
	for (int i = n/2; i < n; i++) // zoberieme len minima
	{
		mi[i] = k;
		for (int j = 0; j < k; j++)
		{
			p2.push({x[i][j] + x[i][m - k + j], i});
			ans -= x[i][j];
		}
	}
	while (p1.top().first + p2.top().first > 0) // vieme to urobit aj lepsie
	{
		ans += p1.top().first + p2.top().first;
		mi[p1.top().second]++;
		mi[p2.top().second]--;
		p1.pop(), p2.pop();
	}
	vector<pair<int, int> > v(k);
	vector<vector<int> > s(n, vector<int>(m, -1));
	for (int i = 0; i < k; i++) v[i] = {0,i};
	for (int i = 0; i < n; i++)
	{
		int cnt = 0;
		sort(v.begin(), v.end());
		for (int j = 0; j < mi[i]; j++)
			v[j].first++, s[i][j] = v[cnt++].second;
		for (int j = m - (k - mi[i]); j < m; j++)
			s[i][j] = v[cnt++].second;
	}
	allocate_tickets(s);
	return ans;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3071 ms 204 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3097 ms 204 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Execution timed out 3057 ms 204 KB Time limit exceeded
3 Halted 0 ms 0 KB -

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 588 KB Output is correct
5 Correct 37 ms 4392 KB Output is correct
6 Correct 6 ms 972 KB Output is correct
7 Correct 7 ms 1108 KB Output is correct
8 Correct 1063 ms 86552 KB Output is correct
9 Correct 1004 ms 84196 KB Output is correct
10 Correct 987 ms 84284 KB Output is correct
11 Correct 1049 ms 86540 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 436 KB Output is correct
3 Correct 3 ms 460 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 588 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 3 ms 428 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 3 ms 556 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 204 KB Output is correct
2 Correct 3 ms 436 KB Output is correct
3 Correct 3 ms 460 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 588 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 3 ms 428 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 3 ms 556 KB Output is correct
12 Correct 3 ms 588 KB Output is correct
13 Correct 25 ms 3136 KB Output is correct
14 Correct 26 ms 3296 KB Output is correct
15 Correct 32 ms 3664 KB Output is correct
16 Correct 36 ms 4316 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 3 ms 460 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 30 ms 3268 KB Output is correct
21 Correct 32 ms 3700 KB Output is correct
22 Correct 35 ms 3668 KB Output is correct
23 Correct 34 ms 4128 KB Output is correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3071 ms 204 KB Time limit exceeded
2 Halted 0 ms 0 KB -