oj.uz

Submission #441107

# Submission time Handle Problem Language Result Execution time Memory
441107 2021-07-04T07:26:30 Z roseanne_pcy Carnival Tickets (IOI20_tickets) C++14
14 / 100
 571 ms 57772 KB 
#include "tickets.h"
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> ii;
typedef vector<int> vi;
typedef long long ll;

#define f first
#define s second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rsz resize

const int md = 1e9+7;
const ll inf = 1e18;
const int maxn = 2e3+5;

template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }

int zeros[maxn], ones[maxn];
int p0[maxn], p1[maxn];
int n, m;

bool cmp(int x, int y)
{
	return zeros[x]> zeros[y];
}

long long find_maximum(int k, vector< vector<int> > x) 
{
	n = x.size(); m = x[0].size();
	for(int i = 0; i< n; i++)
	{
		for(int j = 0; j< m; j++)
		{
			zeros[i] += (x[i][j] == 0);
			ones[i] += (x[i][j] == 1);
		}
		p1[i] = zeros[i];
	}

	vector< vector<int> > res(n, vector<int>(m, -1));

	vector<int> all_nums;
	for(int i = 0; i< n; i++) all_nums.pb(i);
	
	ll sum = 0;

	for(int r = 0; r< k; r++)
	{
		sort(all(all_nums), cmp);
		int minus = 0, plus = 0;
		for(int i = 0; i< n/2; i++)
		{
			int x = all_nums[i];
			if(zeros[x]> 0)
			{
				zeros[x]--;
				res[x][p0[x]++] = r;
			}
			else
			{
				ones[x]--;
				minus++;
				res[x][p1[x]++] = r;
			}
		}
		for(int i = n/2; i< n; i++)
		{
			int x = all_nums[i];
			if(ones[x]> 0)
			{
				ones[x]--;
				plus++;
				res[x][p1[x]++] = r;
			}
			else
			{
				zeros[x]--;
				res[x][p0[x]++] = r;
			}
		}
		sum += plus-minus;
	}
	allocate_tickets(res);
	return sum;
}

Subtask #1
0 / 11.0

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

Subtask #2
0 / 16.0

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

Subtask #3
14.0 / 14.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 0 ms 204 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 26 ms 2552 KB Output is correct
6 Correct 555 ms 56772 KB Output is correct
7 Correct 558 ms 57284 KB Output is correct
8 Correct 3 ms 460 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 6 ms 824 KB Output is correct
13 Correct 19 ms 2124 KB Output is correct
14 Correct 19 ms 2156 KB Output is correct
15 Correct 571 ms 57772 KB Output is correct

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 -6
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

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

Subtask #6
0 / 23.0

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

Subtask #7
0 / 10.0

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