oj.uz

Submission #428583

# Submission time Handle Problem Language Result Execution time Memory
428583 2021-06-15T13:00:45 Z SuhaibSawalha1 Carnival Tickets (IOI20_tickets) C++17
27 / 100
 767 ms 69248 KB 
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
 
long long calc (vector<long long> &a) {
	int n = a.size();
	long long sum = accumulate(a.begin(), a.end(), 0LL), m = LLONG_MAX, sum2 = 0;
	sort(a.begin(), a.end());
	for (int i = 0; i < n; ++i) {
		sum -= a[i];
		m = min(m, a[i] * i - sum2 + sum - a[i] * (n - i - 1));
		sum2 += a[i];
	}
	return m;
}
 
long long find_maximum(int k, vector<vector<int>> a) {
	long long ans = 0;
	int n = a.size();
	int m = a[0].size();
	vector<vector<int>> g(n, vector<int>(m, -1));
	if (k == m) {
		vector<vector<array<int, 2>>> a2(n, vector<array<int, 2>>(m));
		long long s = 0;
		for (int i = 0; i < n; ++i) {
			for (int j = 0; j < m; ++j) {
				a2[i][j] = {a[i][j], j};
			}
			sort(a2[i].begin(), a2[i].end());
		}
		for (int j = 0; j < m; ++j) {
			vector<long long> ask;
			for (int i = 0; i < n; ++i) {
				ask.push_back(a2[i][j][0]);
				g[i][a2[i][j][1]] = j;
			}
			s += calc(ask);
		}
		allocate_tickets(g);
		return s;
	}
	if (k == 1) {
		vector<vector<array<int, 2>>> a2(n, vector<array<int, 2>>(m));
		long long mxs = 0;
		vector<long long> ask;
		vector<array<int, 2>> ms;
		for (int i = 0; i < n; ++i) {
			for (int j = 0; j < m; ++j) {
				a2[i][j] = {a[i][j], j};
			}
			sort(a2[i].begin(), a2[i].end());
			mxs += a2[i][m - 1][0];
			ms.push_back({-a2[i][0][0] - a2[i][m - 1][0], i});
		}
		sort(ms.rbegin(), ms.rend());
		for (int i = 0; i < n / 2; ++i) {
			ask.push_back(a2[ms[i][1]][0][0]);
			g[ms[i][1]][a2[ms[i][1]][0][1]] = 0;
		}
		for (int i = 0; i < n; ++i) {
			if (count(g[i].begin(), g[i].end(), -1) == m) {
				ask.push_back(a2[i][m - 1][0]);
				g[i][a2[i][m - 1][1]] = 0;
			}
		}
		allocate_tickets(g);
		return calc(ask);
	}
	vector<pair<int, array<vector<int>, 2>>> t;
	for (int i = 0; i < n; ++i) {
		array<vector<int>, 2> v;
		for (int j = 0; j < m; ++j) {
			v[a[i][j]].push_back(j);
		}
		t.push_back({i, v});
	} 
	#define zero(a) a.second[0].size()
	#define one(a) a.second[1].size()
	for (int kc = 0; kc < k; ++kc) {
		sort(t.begin(), t.end(), [&] (auto &a, auto &b) {
			return zero(a) > zero(b);
		});
		int zeros = 0, ones = 0;
		for (int i = 0; i < n / 2; ++i) {
			if (zero(t[i])) {
				++zeros;
				g[t[i].first][t[i].second[0].back()] = kc;
				t[i].second[0].pop_back();
			}
			else {
				++ones;
				g[t[i].first][t[i].second[1].back()] = kc;
				t[i].second[1].pop_back();
			}
		}
		for (int i = n / 2; i < n; ++i) {
			if (one(t[i])) {
				++ones;
				g[t[i].first][t[i].second[1].back()] = kc;
				t[i].second[1].pop_back();
			}
			else {
				++zeros;
				g[t[i].first][t[i].second[0].back()] = kc;
				t[i].second[0].pop_back();
			}
		}	
		ans += min(ones, zeros);
	}
	allocate_tickets(g);
	return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 292 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 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 684 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 4 ms 460 KB Output is correct
5 Correct 39 ms 3192 KB Output is correct
6 Correct 767 ms 69248 KB Output is correct

Subtask #3
0 / 14.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 6 ms 432 KB Output is correct
5 Correct 38 ms 2756 KB Output is correct
6 Correct 709 ms 63092 KB Output is correct
7 Correct 714 ms 63356 KB Output is correct
8 Incorrect 4 ms 588 KB Contestant returned 391 while correct return value is 4989.
9 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 while correct return value is 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 while correct return value is 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 while correct return value is 13.
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 292 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 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 684 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 4 ms 460 KB Output is correct
11 Correct 39 ms 3192 KB Output is correct
12 Correct 767 ms 69248 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 6 ms 432 KB Output is correct
17 Correct 38 ms 2756 KB Output is correct
18 Correct 709 ms 63092 KB Output is correct
19 Correct 714 ms 63356 KB Output is correct
20 Incorrect 4 ms 588 KB Contestant returned 391 while correct return value is 4989.
21 Halted 0 ms 0 KB -