Submission #424996

# Submission time Handle Problem Language Result Execution time Memory
424996 2021-06-12T12:18:40 Z Mlxa Carnival Tickets (IOI20_tickets) C++14
27 / 100
731 ms 73116 KB
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(x) x.begin(), x.end()
#define mp make_pair
#define mt make_tuple
#define x first
#define y second
#include "tickets.h"
#include <vector>

ll find_maximum(int k, vector<vector<int>> x) {
	int n = (int)x.size();
	int m = (int)x[0].size();
	assert(k == 1);
	vector<vector<int>> answer(n, vector<int>(m, -1));
	vector<int> ord(n);
	iota(all(ord), 0);
	sort(all(ord), [&](int i, int j) {
		return x[i].front() + x[i].back() < x[j].front() + x[j].back();
	});
	ll sum = 0;
	for (int i = 0; i < n / 2; ++i) {
		sum -= x[ord[i]].front();
		answer[ord[i]].front() = 0;
	}
	for (int i = n / 2; i < n; ++i) {
		sum += x[ord[i]].back();
		answer[ord[i]].back() = 0;
	}
	allocate_tickets(answer);
	return sum;
}

#ifdef LC
#include "grader.cpp"
#endif
# 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 256 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 716 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 288 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 292 KB Output is correct
4 Correct 3 ms 500 KB Output is correct
5 Correct 32 ms 3112 KB Output is correct
6 Correct 731 ms 73116 KB Output is correct
# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 332 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 332 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 332 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 332 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -
# 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 256 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 716 KB Output is correct
7 Correct 1 ms 288 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 292 KB Output is correct
10 Correct 3 ms 500 KB Output is correct
11 Correct 32 ms 3112 KB Output is correct
12 Correct 731 ms 73116 KB Output is correct
13 Runtime error 1 ms 332 KB Execution killed with signal 6
14 Halted 0 ms 0 KB -