oj.uz

Submission #428366

# Submission time Handle Problem Language Result Execution time Memory
428366 2021-06-15T11:00:02 Z egekabas Carnival Tickets (IOI20_tickets) C++14
41 / 100
 771 ms 53316 KB 
#include "tickets.h"
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pull;
typedef pair<int, int> pii;
typedef pair<ld, ld> pld;

long long find_maximum(int k, vector<vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	vector<int> beg(n), fin(n), sum(n);
	for(int i = 0; i < n; ++i){
		beg[i] = 0;
		fin[i] = m-1;
		for(int j = 0; j < m; ++j)
			sum[i] += x[i][j];
	}
	vector<vector<int>> ret(n, vector<int>(m, -1));
	ll ans = 0;
	for(int round = 0; round < k; ++round){
		vector<pair<pii, int>> vec;
		for(int i = 0; i < n; ++i)
			vec.pb({{x[i][beg[i]] + x[i][fin[i]], sum[i]}, i});
		sort(all(vec), greater<pair<pii, int>>());
		for(int i = 0; i < n; ++i){
			int idx = vec[i].ss;
			if(i < n/2){
				ans += x[idx][fin[idx]];
				ret[idx][fin[idx]] = round;
				sum[idx] -= x[idx][fin[idx]];
				--fin[idx];
			}
			else{
				ans -= x[idx][beg[idx]];
				ret[idx][beg[idx]] = round;
				sum[idx] -= x[idx][beg[idx]];
				++beg[idx];
			}
		}
	}
	allocate_tickets(ret);
	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 3 ms 588 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 29 ms 3116 KB Output is correct
6 Correct 655 ms 53040 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 204 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 27 ms 2272 KB Output is correct
6 Correct 735 ms 52348 KB Output is correct
7 Correct 771 ms 52704 KB Output is correct
8 Correct 4 ms 460 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 7 ms 800 KB Output is correct
13 Correct 23 ms 1948 KB Output is correct
14 Correct 22 ms 1988 KB Output is correct
15 Correct 695 ms 53316 KB Output is correct

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Contestant returned 11 while correct return value is 13.
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Contestant returned 11 while correct return value is 13.
2 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Contestant returned 11 while correct return value is 13.
2 Halted 0 ms 0 KB -

Subtask #7
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 3 ms 588 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 29 ms 3116 KB Output is correct
12 Correct 655 ms 53040 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 204 KB Output is correct
16 Correct 2 ms 332 KB Output is correct
17 Correct 27 ms 2272 KB Output is correct
18 Correct 735 ms 52348 KB Output is correct
19 Correct 771 ms 52704 KB Output is correct
20 Correct 4 ms 460 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 7 ms 800 KB Output is correct
25 Correct 23 ms 1948 KB Output is correct
26 Correct 22 ms 1988 KB Output is correct
27 Correct 695 ms 53316 KB Output is correct
28 Incorrect 1 ms 204 KB Contestant returned 11 while correct return value is 13.
29 Halted 0 ms 0 KB -