oj.uz

Submission #432438

# Submission time Handle Problem Language Result Execution time Memory
432438 2021-06-18T09:51:25 Z arayi Carnival Tickets (IOI20_tickets) C++17
27 / 100
 682 ms 54616 KB 
#include "tickets.h"
#include <vector>
#include <algorithm>
#include <iostream>
#include <queue>
#define ad push_back
#define lli long long
#define MP make_pair
#define sc second
#define fr first
using namespace std;

const int N = 2222;
int n, m;
vector<vector<int> > a;
int zr[N], l[N], r[N];
lli sum;
long long find_maximum(int k, std::vector<std::vector<int>> x) 
{
	n = x.size();
	m = x[0].size();
	a.resize(n);
	for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) a[i].ad(-1);	
	priority_queue<pair<lli, int> > q, q1;
	for (int i = 0; i < n; i++)
	{
		r[i] = m - 1;
		if(i < n/2) zr[i] = k/2;
		else zr[i] = (k+1)/2;
		for (int j = 0; j < zr[i]; j++) sum -= x[i][j];
		for (int j = m - 1; j >= m - k + zr[i]; j--) sum += x[i][j];
		if(zr[i] != 0) q.push(MP(x[i][zr[i]-1]+x[i][m-k+zr[i]-1], i));
		if(zr[i] != k) q1.push(MP(-x[i][zr[i]]-x[i][m-k-zr[i]], i));
	}
	while ((q.top().fr + q1.top().fr) > 0)
	{
		int i = q.top().sc, i1 = q1.top().sc;
		if(zr[i] == 0 || ((x[i][zr[i]-1]+x[i][m-k+zr[i]-1]) != q.top().fr)) {q.pop(); continue;}
		if(zr[i1] == k || ((-x[i1][zr[i1]]-x[i1][m-k-zr[i1]]) != q1.top().fr)) {q1.pop(); continue;}
		sum += q.top().fr + q1.top().fr;
		q.pop(); q1.pop();
		zr[i]--; zr[i1]++;
		if(zr[i] != 0) q.push(MP(x[i][zr[i]-1]+x[i][m-k+zr[i]-1], i));
		if(zr[i] != k) q1.push(MP(-x[i][zr[i]]-x[i][m-k-zr[i]], i));
		i = i1;
		if(zr[i] != 0) q.push(MP(x[i][zr[i]-1]+x[i][m-k+zr[i]-1], i));
		if(zr[i] != k) q1.push(MP(-x[i][zr[i]]-x[i][m-k-zr[i]], i));
	}
	for (int i = 0; i < k; i++)
	{
		vector<pair<int, int> > fp;
		for (int j = 0; j < n; j++)
			fp.ad(MP(zr[j], j));
		sort(fp.begin(), fp.end());
		reverse(fp.begin(), fp.end());
		for (int j = 0; j < n / 2; j++)
			a[fp[j].sc][l[fp[j].sc]++] = i, zr[fp[j].sc]--;
		for (int j = n/2; j < n; j++)
			a[fp[j].sc][r[fp[j].sc]--] = i;
	}
	allocate_tickets(a);
	return sum;
}

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 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 3 ms 716 KB Output is correct

Subtask #2
16.0 / 16.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 3 ms 460 KB Output is correct
5 Correct 26 ms 2572 KB Output is correct
6 Correct 682 ms 54616 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Contestant returned 6 but the tickets gives a total value of 7
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 11 but the tickets gives a total value of 9
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 but the tickets gives a total value of 9
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 but the tickets gives a total value of 9
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 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 3 ms 716 KB Output is correct
7 Correct 1 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 26 ms 2572 KB Output is correct
12 Correct 682 ms 54616 KB Output is correct
13 Incorrect 1 ms 204 KB Contestant returned 6 but the tickets gives a total value of 7
14 Halted 0 ms 0 KB -