oj.uz

Submission #432069

# Submission time Handle Problem Language Result Execution time Memory
432069 2021-06-17T20:15:45 Z peuch Carnival Tickets (IOI20_tickets) C++17
27 / 100
 741 ms 86960 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<long long> dp (n);
	vector<vector<bool> > bt (n, vector<bool> (n, 0));
	vector<vector<pair<long long, int> > > ord (n, vector<pair<long long, int> > (m));
	vector<vector<int> > ans (n, vector<int> (m, -1));
	for(int i = 0; i < n; i++){
		for(int j = 0; j < m; j++)
			ord[i][j] = make_pair(x[i][j], j);
		sort(ord[i].begin(), ord[i].end());
//		printf("Para pilha %d, fundo = %d, topo = %d\n", i, ord[i][0].first, ord[i][m - 1].first);
	}
	
	for(int i = 0; i < n; i++){
		for(int j = n / 2; j >= 0; j--){
			dp[j] = dp[j] - ord[i][0].first;
			if(j != 0 && dp[j - 1] + ord[i][m - 1].first > dp[j]) dp[j] = dp[j - 1] + ord[i][m - 1].first, bt[i][j] = 1;
//			printf("dp[%d][%d] = %d\n", i, j, dp[j]);
		}
	}
	
	int curI = n - 1, curJ = n / 2;
	while(curI >= 0){
		if(bt[curI][curJ]) curJ--, ans[curI][ord[curI][m - 1].second] = 0;
		else ans[curI][ord[curI][0].second] = 0;
		curI--;
	}
	
	allocate_tickets(ans);
	return dp[n / 2];	
}

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 2 ms 344 KB Output is correct
6 Correct 5 ms 1112 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 3 ms 460 KB Output is correct
5 Correct 30 ms 3700 KB Output is correct
6 Correct 741 ms 86960 KB Output is correct

Subtask #3
0 / 14.0

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

Subtask #4
0 / 14.0

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

Subtask #5
0 / 12.0

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

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB There is no ticket of color 0 on day 1
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 2 ms 344 KB Output is correct
6 Correct 5 ms 1112 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 3 ms 460 KB Output is correct
11 Correct 30 ms 3700 KB Output is correct
12 Correct 741 ms 86960 KB Output is correct
13 Incorrect 1 ms 204 KB There is no ticket of color 0 on day 1
14 Halted 0 ms 0 KB -