oj.uz

Submission #819671

# Submission time Handle Problem Language Result Execution time Memory
819671 2023-08-10T12:32:08 Z Abrar_Al_Samit Carnival Tickets (IOI20_tickets) C++17
27 / 100
 508 ms 73136 KB 
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;

const int nax = 1500;

int val[nax][2], n, m;
int best[nax];
long long mx_ans = 0;

void solve(int med) {
	int cur[nax];

	long long ret = 0;

	int rit_cnt = 0;

	vector<pair<int,int>>del;
	for(int i=0; i<n; ++i) {
		if(val[i][0] > med) {
			cur[i] = 1;
			ret += val[i][1] - med;
			++rit_cnt;
		} else if(val[i][1] < med) {
			cur[i] = 0;
			ret += med - val[i][0];
		} else {
			cur[i] = 0;

			del.emplace_back((val[i][1]-med) - (med-val[i][0]), i);
			ret += med - val[i][0];
		}
	}

	if(rit_cnt * 2 > n) return;

	sort(del.rbegin(), del.rend());

	for(auto [d, i] : del) {
		if(rit_cnt * 2 == n) break;

		++rit_cnt;
		ret += d;
		cur[i] = 1;
	}
	if(rit_cnt * 2 != n) return;

	if(ret > mx_ans) {
		mx_ans = ret;
		for(int i=0; i<n; ++i) {
			best[i] = cur[i];
		}
	}
}
long long find_maximum(int k, vector<vector<int>> x) {
	n = x.size();
	m = x[0].size();

	for(int i=0; i<n; ++i) {
		val[i][0] = 2e9, val[i][1] = -1;
		for(int j=0; j<m; ++j) {
			val[i][0] = min(val[i][0], x[i][j]);
			val[i][1] = max(val[i][1], x[i][j]);
		}
	}

	for(int i=0; i<n; ++i) {
		solve(val[i][0]);
		solve(val[i][1]);
	}


	vector<vector<int>> ans(n, vector<int>(m, -1));
	for(int i=0; i<n; ++i) {
		for(int j=0; j<m; ++j) {
			if(val[i][best[i]]==x[i][j]) {
				ans[i][j] = 0;
				break;
			}
		}
	}
	allocate_tickets(ans);
	return mx_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 340 KB Output is correct
6 Correct 12 ms 628 KB Output is correct

Subtask #2
16.0 / 16.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 2 ms 496 KB Output is correct
5 Correct 20 ms 3156 KB Output is correct
6 Correct 508 ms 73136 KB Output is correct

Subtask #3
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 #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 312 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 312 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 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 340 KB Output is correct
6 Correct 12 ms 628 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 2 ms 496 KB Output is correct
11 Correct 20 ms 3156 KB Output is correct
12 Correct 508 ms 73136 KB Output is correct
13 Incorrect 1 ms 212 KB There is no ticket of color 0 on day 1
14 Halted 0 ms 0 KB -