oj.uz

Submission #421419

# Submission time Handle Problem Language Result Execution time Memory
421419 2021-06-09T06:59:14 Z Mazaalai Carnival Tickets (IOI20_tickets) C++14
27 / 100
 632 ms 69524 KB 
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair <ll, ll> PII;
#define ff first
#define ss second
 
long long find_maximum(int k1, vector <vector <int> > x1) {
	ll n = x1.size();
	ll m = x1[0].size();
	ll k = k1;
	vector <vector <int> > answer(n, vector <int>(m, -1));
	vector <vector <bool> > state(n, vector <bool>(m, 0));
	vector <vector <ll> > x(n, vector<ll>(m));
	for (int i = 0; i < n; i++)
	for (int j = 0; j < m; j++) x[i][j] = x1[i][j];

	vector <ll> hiIdx(n+5, m-1);
	vector <ll> loIdx(n+5, k-1);
	// number picked : n * k -> + (n/2*k)(-), (n/2*k)(+)
	set <PII> dif; // val, line
	ll ans = 0, half = n * k / 2;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < k; j++) {
			state[i][j] = 1;
			ans -= x[i][j];
		}
		dif.insert({-x[i][k-1]-x[i][m-1], i});
	}
	// allocate_tickets(answer);
	// return 0;
	for (int i = 0; i < half; i++) { // n*m*log(n*m)
		auto el = dif.begin();
		dif.erase(el);
		ll a, b;
		tie(a, b) = *el;
		ans -= a;
		if (loIdx[b] >= 0) state[b][loIdx[b]--] = 0;
		if (hiIdx[b] >= 0) state[b][hiIdx[b]--] = 1;
		if ( loIdx[b] >= 0)
			dif.insert({-x[b][loIdx[b]]-x[b][hiIdx[b]], b});
	}
	for (int i = 0; i < n; i++) {
		int cur = 0;
		for (int j = 0; j < m; j++) {
			if (state[i][j]) answer[i][j] = cur++;
		}
	}
	allocate_tickets(answer);
	return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 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 1 ms 332 KB Output is correct
6 Correct 2 ms 844 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 280 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 4 ms 460 KB Output is correct
5 Correct 26 ms 3020 KB Output is correct
6 Correct 632 ms 69524 KB Output is correct

Subtask #3
0 / 14.0

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

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Contestant returned 5 but the tickets gives a total value of 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 5 but the tickets gives a total value of 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 5 but the tickets gives a total value of 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 0 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 1 ms 332 KB Output is correct
6 Correct 2 ms 844 KB Output is correct
7 Correct 1 ms 280 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 4 ms 460 KB Output is correct
11 Correct 26 ms 3020 KB Output is correct
12 Correct 632 ms 69524 KB Output is correct
13 Incorrect 1 ms 204 KB Contestant returned 2 but the tickets gives a total value of 6
14 Halted 0 ms 0 KB -