Submission #370665

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
370665	2021-02-24T12:57:17 Z	anakib1	Carnival Tickets (IOI20_tickets)	C++17	100 / 100	803 ms	84116 KB

tickets

//나는 가상 소녀들에게 큰 호감이 있습니다.

#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <chrono>
#include <functional>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <deque>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <stdarg.h>
#include <utility>

using namespace std;

#define pb push_back
#define mp make_pair
#define ll long long
#define ull unisgned long long
#define ld long double
#define all(a) a.begin(), a.end()
#define SORT(a) sort(all(a))
#define pii pair<int, int>
#define tii triple<int, int, int>
#define e 1e-7
#define PI acos(-1)
#define sz(a) (int)(a.size())
#define inf 1e17
#define vi vector<int>
#define F first
#define S second
#define rng(x) for(int _ = 0; _ < (x); _++)
#define rngi(i, x) for(int i = 0; i < (x); i++)
#define rngsi(s, i, x) for(int i = (s); i <(x); i++)
#define problem "a"

template<typename A, typename B, typename C>
struct triple {
	A X;
	B Y;
	C Z;
	triple(A a = 0, B b = 0, C c = 0) :X(a), Y(b), Z(c) {}
};
template<typename A, typename B, typename C>
triple<A, B, C> make_triple(A a = 0, B b = 0, C c = 0) {
	return triple<A, B, C>(a, b, c);
}
template<typename A, typename B, typename C>
bool operator<(const triple<A, B, C>& a, const triple<A, B, C>& b) {
	if (a.X != b.X)
		return a.X < b.X;
	if (a.Y != b.Y)
		return a.Y < b.Y;
	return a.Z < b.Z;
}
template<typename T, typename SS>
ostream& operator<<(ostream& ofs, const pair<T, SS>& p) {
	ofs << "( " << p.F << " , " << p.S << " )";
	return ofs;
}
template<typename T>
void print(T a) {
	for (auto i : a)
		cout << i << ' ';
	cout << '\n';
}
template<typename T>
T max(T a, T b, T c) {
	return max(a, max(b, c));
}
template<typename T>
T min(T a, T b, T c) {
	return min(a, min(b, c));
}
template<typename T, typename D>
D min(T a) {
	return *min_element(all(a));
}
template<typename T, typename D>
D max(T a) {
	return *max_element(all(a));
}
struct custom_hash {
	static uint64_t splitmix64(uint64_t x) {
		x += 0x9e3779b97f4a7c15;
		x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
		x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
		return x ^ (x >> 31);
	}

	size_t operator()(uint64_t x) const {
		static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
		return splitmix64(x + FIXED_RANDOM);
	}
};
#include "tickets.h"

long long find_maximum(int k, std::vector<std::vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	vector < pair<ll, int>> pairs;
	vi cur0(n), cur1(n, m), cnt0(n), cnt1(n), rank(n);
	ll ans = 0;
	rngi(i, n) rngi(j, k)pairs.emplace_back(x[i][k - j - 1] + x[i][m - j - 1], i), ans -= x[i][j];
	nth_element(pairs.rbegin(), pairs.rbegin() + n / 2 * k, pairs.rend());
	rngi(i, n / 2 * k) ++cnt1[pairs[i].second], ans += pairs[i].first;
	rngi(i, n) cnt0[i] = k - cnt1[i], rank[i] = i;
	rngi(i, n) fill(all(x[i]), -1);
	auto cmp = [&](int x, int y) {return cnt0[x] < cnt0[y]; };
	rngi(R, k) {
		nth_element(rank.begin(), rank.begin() + n / 2, rank.end(), cmp);
		rngi(i, n / 2) x[rank[i]][--cur1[rank[i]]] = R, --cnt1[rank[i]];
		for (int i = n / 2; i < n; ++i) x[rank[i]][cur0[rank[i]]++] = R, --cnt0[rank[i]];
	}
	allocate_tickets(x);
	return ans;
}

Subtask #1
11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	2 ms	768 KB	Output is correct

Subtask #2
16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	3 ms	492 KB	Output is correct
5	Correct	28 ms	2572 KB	Output is correct
6	Correct	663 ms	42604 KB	Output is correct

Subtask #3
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	2 ms	492 KB	Output is correct
5	Correct	25 ms	2664 KB	Output is correct
6	Correct	591 ms	53908 KB	Output is correct
7	Correct	637 ms	59796 KB	Output is correct
8	Correct	4 ms	752 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	7 ms	1000 KB	Output is correct
13	Correct	21 ms	2532 KB	Output is correct
14	Correct	21 ms	2536 KB	Output is correct
15	Correct	657 ms	64532 KB	Output is correct

Subtask #4
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	3 ms	620 KB	Output is correct
5	Correct	31 ms	3688 KB	Output is correct
6	Correct	6 ms	1024 KB	Output is correct
7	Correct	6 ms	1136 KB	Output is correct
8	Correct	795 ms	83916 KB	Output is correct
9	Correct	747 ms	82704 KB	Output is correct
10	Correct	744 ms	82740 KB	Output is correct
11	Correct	803 ms	84116 KB	Output is correct

Subtask #5
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	3 ms	492 KB	Output is correct
3	Correct	3 ms	492 KB	Output is correct
4	Correct	3 ms	492 KB	Output is correct
5	Correct	3 ms	620 KB	Output is correct
6	Correct	3 ms	748 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	2 ms	492 KB	Output is correct
10	Correct	3 ms	620 KB	Output is correct
11	Correct	3 ms	620 KB	Output is correct
12	Correct	3 ms	620 KB	Output is correct

Subtask #6
23.0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	3 ms	492 KB	Output is correct
3	Correct	3 ms	492 KB	Output is correct
4	Correct	3 ms	492 KB	Output is correct
5	Correct	3 ms	620 KB	Output is correct
6	Correct	3 ms	748 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	2 ms	492 KB	Output is correct
10	Correct	3 ms	620 KB	Output is correct
11	Correct	3 ms	620 KB	Output is correct
12	Correct	3 ms	620 KB	Output is correct
13	Correct	27 ms	2540 KB	Output is correct
14	Correct	28 ms	2668 KB	Output is correct
15	Correct	30 ms	2920 KB	Output is correct
16	Correct	31 ms	3688 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	3 ms	620 KB	Output is correct
19	Correct	2 ms	492 KB	Output is correct
20	Correct	26 ms	3040 KB	Output is correct
21	Correct	29 ms	3040 KB	Output is correct
22	Correct	28 ms	3552 KB	Output is correct
23	Correct	31 ms	3680 KB	Output is correct

Subtask #7
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	2 ms	768 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	3 ms	492 KB	Output is correct
11	Correct	28 ms	2572 KB	Output is correct
12	Correct	663 ms	42604 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	2 ms	492 KB	Output is correct
17	Correct	25 ms	2664 KB	Output is correct
18	Correct	591 ms	53908 KB	Output is correct
19	Correct	637 ms	59796 KB	Output is correct
20	Correct	4 ms	752 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	1 ms	364 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	7 ms	1000 KB	Output is correct
25	Correct	21 ms	2532 KB	Output is correct
26	Correct	21 ms	2536 KB	Output is correct
27	Correct	657 ms	64532 KB	Output is correct
28	Correct	1 ms	364 KB	Output is correct
29	Correct	1 ms	364 KB	Output is correct
30	Correct	1 ms	364 KB	Output is correct
31	Correct	3 ms	620 KB	Output is correct
32	Correct	31 ms	3688 KB	Output is correct
33	Correct	6 ms	1024 KB	Output is correct
34	Correct	6 ms	1136 KB	Output is correct
35	Correct	795 ms	83916 KB	Output is correct
36	Correct	747 ms	82704 KB	Output is correct
37	Correct	744 ms	82740 KB	Output is correct
38	Correct	803 ms	84116 KB	Output is correct
39	Correct	1 ms	364 KB	Output is correct
40	Correct	3 ms	492 KB	Output is correct
41	Correct	3 ms	492 KB	Output is correct
42	Correct	3 ms	492 KB	Output is correct
43	Correct	3 ms	620 KB	Output is correct
44	Correct	3 ms	748 KB	Output is correct
45	Correct	1 ms	364 KB	Output is correct
46	Correct	1 ms	364 KB	Output is correct
47	Correct	2 ms	492 KB	Output is correct
48	Correct	3 ms	620 KB	Output is correct
49	Correct	3 ms	620 KB	Output is correct
50	Correct	3 ms	620 KB	Output is correct
51	Correct	27 ms	2540 KB	Output is correct
52	Correct	28 ms	2668 KB	Output is correct
53	Correct	30 ms	2920 KB	Output is correct
54	Correct	31 ms	3688 KB	Output is correct
55	Correct	1 ms	364 KB	Output is correct
56	Correct	3 ms	620 KB	Output is correct
57	Correct	2 ms	492 KB	Output is correct
58	Correct	26 ms	3040 KB	Output is correct
59	Correct	29 ms	3040 KB	Output is correct
60	Correct	28 ms	3552 KB	Output is correct
61	Correct	31 ms	3680 KB	Output is correct
62	Correct	77 ms	5612 KB	Output is correct
63	Correct	75 ms	5532 KB	Output is correct
64	Correct	86 ms	8664 KB	Output is correct
65	Correct	321 ms	24396 KB	Output is correct
66	Correct	348 ms	32328 KB	Output is correct
67	Correct	8 ms	1136 KB	Output is correct
68	Correct	6 ms	1004 KB	Output is correct
69	Correct	665 ms	42708 KB	Output is correct
70	Correct	734 ms	53432 KB	Output is correct
71	Correct	793 ms	83860 KB	Output is correct
72	Correct	680 ms	83504 KB	Output is correct
73	Correct	747 ms	66452 KB	Output is correct
74	Correct	648 ms	53648 KB	Output is correct
75	Correct	708 ms	52756 KB	Output is correct

Submission #370665

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 16.0 / 16.0

Subtask #3 14.0 / 14.0

Subtask #4 14.0 / 14.0

Subtask #5 12.0 / 12.0

Subtask #6 23.0 / 23.0

Subtask #7 10.0 / 10.0

Subtask #1
11.0 / 11.0

Subtask #2
16.0 / 16.0

Subtask #3
14.0 / 14.0

Subtask #4
14.0 / 14.0

Subtask #5
12.0 / 12.0

Subtask #6
23.0 / 23.0

Subtask #7
10.0 / 10.0