oj.uz

Submission #300171

# Submission time Handle Problem Language Result Execution time Memory
300171 2020-09-16T22:07:53 Z model_code Carnival Tickets (IOI20_tickets) C++17
25 / 100
 1467 ms 107600 KB 
// wy-subtask4
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;

int sum[1505], f[1505], b[1505];
vector< vector<int> > ret;

long long find_maximum(int k, std::vector<std::vector<int>> d) {
	int c = d.size();
	int s = d[0].size();
	vector< pair<long long, pair<int, int> > > V;
	long long ans = 0;
	vector<vector<pair<int, int>>> d2;
	d2.resize(c);
	for (int i = 0; i < c; i++) {
		for (int j = 0; j < s; j++) {
			d2[i].push_back(make_pair(d[i][j], j));
		}
		sort(d2[i].begin(), d2[i].end());
	}

	for (int i = 0; i < c; i++) for (int j = 0; j < s; j++) V.push_back(make_pair(d[i][j], make_pair(i, j)));
	sort(V.begin(), V.end());
	for (int i = 0; i < c*s/2; i++) {
		ans -= V[i].first;
	}
	for (int i = c*s/2; i < c*s; i++) {
		ans += V[i].first;
		sum[V[i].second.first]++;
	}


	ret.resize(c);
	for (int i = 0; i < c; i++) {
		vector<int> v;
		v.resize(s, -1);
		ret[i] = v;
	}
	for (int i = 0; i < k; i++) {
		vector< pair<int, int> > v;
		for (int j = 0; j < c; j++) v.push_back(make_pair(sum[j], j));
		sort(v.begin(), v.end());
		for (int j = 0; j < c/2; j++) {
			ret[v[j].second][d2[v[j].second][f[v[j].second]].second] = i;
			f[v[j].second]++;
		}
		for (int j = c/2; j < c; j++) {
			ret[v[j].second][d2[v[j].second][s-b[v[j].second]-1].second] = i;
			b[v[j].second]++;
			sum[v[j].second]--;
		}
	}
	allocate_tickets(ret);
	return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 896 KB Output is correct

Subtask #2
0 / 16.0

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

Subtask #3
0 / 14.0

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

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 5 ms 672 KB Output is correct
5 Correct 52 ms 4824 KB Output is correct
6 Correct 8 ms 1024 KB Output is correct
7 Correct 10 ms 1276 KB Output is correct
8 Correct 1334 ms 107568 KB Output is correct
9 Correct 1310 ms 105236 KB Output is correct
10 Correct 1299 ms 104804 KB Output is correct
11 Correct 1467 ms 107600 KB Output is correct

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Incorrect 3 ms 664 KB Contestant returned 38987381968 but the tickets gives a total value of 1593618503176
3 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Incorrect 3 ms 664 KB Contestant returned 38987381968 but the tickets gives a total value of 1593618503176
3 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 896 KB Output is correct
7 Incorrect 1 ms 256 KB Contestant returned 860858182 but the tickets gives a total value of 1095508474
8 Halted 0 ms 0 KB -