oj.uz

Submission #432139

# Submission time Handle Problem Language Result Execution time Memory
432139 2021-06-17T21:39:35 Z peuch Carnival Tickets (IOI20_tickets) C++17
27 / 100
 707 ms 105860 KB 
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;


long long find_maximum(int k, vector<vector<int> > x) {
	
	int n = x.size();
	int m = x[0].size();
	
	vector<vector<pair<long long, int> > > ord (n, vector<pair<long long, int> > (m));
	vector<deque<pair<int, int> > > pilha (n);
	vector<vector<int> > ans (n, vector<int> (m, -1));
	int maxi = 0;
	for(int i = 0; i < n; i++){
		for(int j = 0; j < m; j++)
			ord[i][j] = make_pair(x[i][j], j), maxi = max(maxi, x[i][j]);
		sort(ord[i].begin(), ord[i].end());
		for(int j = 0; j < m; j++)
			pilha[i].push_back(ord[i][j]);
	}
	
	if(maxi == 1){
		long long sum = 0;
		long long ones = 0;
		long long zeros = 0;
		for(int i = 0; i < n; i++){
			long long cnt = 0;
			for(int j = 0; j < m; j++)
				cnt += x[i][j];
			if(cnt > m / 2){
				long long aux = m - cnt;
				sum += min(2 * aux, (long long)k);
				if(2 * aux >= k) continue; 
				ones += k - 2 * aux;
			}
			else{
				int aux = m - cnt;
				sum += min(2 * cnt, (long long)k);
				if(2 * cnt >= k) continue; 
				zeros += k - 2 * cnt;
			}
		}
		sum += 2 * min(zeros, ones);
		
		vector<int> coringa, zero, um;
		for(int i = 0; i < n; i++){
			coringa.push_back(i);
		}
		for(int i = 0; i < k; i++){
			int zeros = 0;
			int ones = 0;
			vector<int> marc(n, 0);
			for(int j = 0; j < n; j++){
				if(pilha[j].back().first == 0){
					ans[j][pilha[j].back().second] = i;
					pilha[j].pop_back();
					zeros++;
					marc[j] = 1;
				}
				if(pilha[j].front().first == 1){
					ans[j][pilha[j].front().second] = i;
					pilha[j].pop_front();
					ones++;
					marc[j] = 1;
				}
			}
			for(int j = 0; j < n; j++){
				if(marc[j]) continue;
				if(zeros < ones){
					ans[j][pilha[j].back().second] = i;
					pilha[j].pop_back();
					zeros++;
					marc[j] = 1;
				}
				else{
					ans[j][pilha[j].front().second] = i;
					pilha[j].pop_front();
					ones++;
					marc[j] = 1;
				}
			}
		}
		
		allocate_tickets(ans);
		return sum /= 2;
	}
	
	long long sum = 0;
	for(int c = 0; c < k; c++){
		vector<long long> dp (n);	
		vector<vector<bool> > bt (n, vector<bool> (n, 0));
		for(int i = 0; i < n; i++){
			for(int j = n / 2; j >= 0; j--){
				dp[j] = dp[j] - pilha[i].front().first;
				if(j != 0 && dp[j - 1] + pilha[i].back().first > dp[j]) dp[j] = dp[j - 1] + pilha[i].back().first, bt[i][j] = 1;
			}
		}
		
		int curI = n - 1, curJ = n / 2;
		while(curI >= 0){
			if(bt[curI][curJ]) curJ--, ans[curI][pilha[curI].back().second] = c, pilha[curI].pop_back();
			else ans[curI][pilha[curI].front().second] = c, pilha[curI].pop_front();
			curI--;
		}
		sum += dp[n / 2];
	}
	
	allocate_tickets(ans);
	return sum;	
}

Compilation message

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:38:9: warning: unused variable 'aux' [-Wunused-variable]
   38 |     int aux = m - cnt;
      |         ^~~

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 0 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 588 KB Output is correct
6 Correct 6 ms 1996 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 4 ms 588 KB Output is correct
5 Correct 29 ms 4484 KB Output is correct
6 Correct 707 ms 105860 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Contestant returned 4 but the tickets gives a total value of 5
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 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 0 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 588 KB Output is correct
6 Correct 6 ms 1996 KB Output is correct
7 Correct 0 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 4 ms 588 KB Output is correct
11 Correct 29 ms 4484 KB Output is correct
12 Correct 707 ms 105860 KB Output is correct
13 Incorrect 0 ms 204 KB Contestant returned 4 but the tickets gives a total value of 5
14 Halted 0 ms 0 KB -