oj.uz

Submission #837398

# Submission time Handle Problem Language Result Execution time Memory
837398 2023-08-25T10:20:55 Z KemalK Carnival Tickets (IOI20_tickets) C++17
27 / 100
 397 ms 51320 KB 
#include "tickets.h"
#include <vector>
#include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
long long find_maximum(int k, vector<std::vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	vector <vector <int>> ans(n, vector <int> (m, -1));
	ll sum = 0;
	vector <pair<ll, int>> ticket;
	for (int i = 0; i < n; i++){
		if (m > 1){
			ll cur = -x[i][0] - x[i][m - 1];
			ticket.push_back({cur, i});
		}
		else{
			ticket.push_back({-x[i][0], i});
		}
		sum += x[i][m - 1];
	}
	sort(ticket.begin(), ticket.end(), greater<pair<ll, int>>());
	for (int i = 0; i < n/2; i++){
		if (m > 1){
			sum += ticket[i].first;
		}
		else{
			sum += 2*ticket[i].first;
		}
		
		int pos = ticket[i].second;
		ans[pos][0] = 0;
	}
	for (int i = 0; i < n; i++){
		if (ans[i][0] != 0){
			ans[i][m - 1] = 0;
		}
	}
	// cout << sum << "\n";
// cout << "allocate" << "\n";

	allocate_tickets(ans);
	return sum;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 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 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 16 ms 2372 KB Output is correct
6 Correct 397 ms 51320 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 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 212 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 0 ms 212 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 0 ms 212 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 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 16 ms 2372 KB Output is correct
12 Correct 397 ms 51320 KB Output is correct
13 Incorrect 0 ms 212 KB There is no ticket of color 0 on day 1
14 Halted 0 ms 0 KB -