oj.uz

Submission #838706

# Submission time Handle Problem Language Result Execution time Memory
838706 2023-08-27T15:35:00 Z mychecksedad Carnival Tickets (IOI20_tickets) C++17
27 / 100
 406 ms 73112 KB 
#include<tickets.h>
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod1 (1000000000+7)
#define mod (998244353)
#define pb push_back
#define all(x) x.begin(), x.end()
#define en cout << '\n'
const int N = 1e6+100, M = 1e5+10, K = 18;


// void allocate_tickets( std::vector<std::vector<int>> _x);
long long find_maximum(int k, vector<vector<int>> d){
	ll ans = 0;
	int n = d.size(), m = d[0].size();
	vector<vector<int>> A(n, vector<int>(m, -1));
	vector<array<int, 2>> a;
	vector<array<int, 3>> big, small;
	vector<int> H(n);

	for(int i = 0; i < n; ++i){
		H[i] = k;
		for(int j = m - k; j < m; ++j){
			ans += d[i][j];
			a.pb({-d[i][j]-d[i][j-(m-k)], i});
		}
	}

	sort(all(a), greater<array<int, 2>>());


	int c = 0;
	for(int i = 0; i < n*k/2; ++i, ++c){
		if(H[a[c][1]] == 0){
			--i;
			continue;
		}
		ans += a[c][0];
		H[a[c][1]]--;
	}	
	
	for(int i = 0; i < n; ++i){
		for(int j = m - 1; j >= m - H[i]; --j){
			big.pb({d[i][j], i, j});
		}
		for(int j = 0; j < k - H[i]; ++j){
			small.pb({d[i][j], i, j});
		}
	}
	
	sort(all(big));
	sort(all(small));

	for(int turn = 0; turn < k; ++turn){
		for(int j = turn * (n / 2); j < turn * (n / 2) + n / 2; ++j){
			A[big[j][1]][big[j][2]] = turn;
			A[small[j][1]][small[j][2]] = turn;
		}
	}

	allocate_tickets(A);
	return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 2 ms 724 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 260 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 17 ms 3156 KB Output is correct
6 Correct 406 ms 73112 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB There is multiple tickets of color 0 on day 0
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB There is no ticket of color 0 on day 0
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 260 KB There is no ticket of color 0 on day 0
2 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 260 KB There is no ticket of color 0 on day 0
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 2 ms 724 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 260 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 17 ms 3156 KB Output is correct
12 Correct 406 ms 73112 KB Output is correct
13 Incorrect 1 ms 212 KB There is multiple tickets of color 0 on day 0
14 Halted 0 ms 0 KB -