Submission #757987

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
757987	2023-06-14T04:09:46 Z	SanguineChameleon	Archery (IOI09_archery)	C++17	68 / 100	2000 ms	4080 KB

archery

#include <bits/stdc++.h>
using namespace std;

void just_do_it();

int main() {
	#ifdef KAMIRULEZ
		freopen("kamirulez.inp", "r", stdin);
		freopen("kamirulez.out", "w", stdout);
	#endif
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	just_do_it();
	return 0;
}

const int maxN = 2e5 + 20;
int a[maxN * 2];
int cnt1[maxN];
int cnt2[maxN];
int N, R, K;

void simulate(int start, int lim, int cnt[]) {
	for (int i = 1; i <= N; i++) {
		cnt[i] = 0;
	}
	for (int i = 1; i <= start * 2 - 1; i++) {
		if (a[i] >= lim) {
			cnt[(i + 1) / 2]++;
		}
	}
	if (K >= lim) {
		cnt[start]++;
	}
	for (int i = start * 2; i <= N * 2 - 1; i++) {
		if (a[i] >= lim) {
			cnt[i / 2 + 1]++;
		}
	}
	vector<int> free;
	vector<int> holes;
	for (int i = 1; i <= N; i++) {
		if (cnt[i] == 2) {
			if (!holes.empty()) {
				cnt[holes.back()] = 1;
				holes.pop_back();
			}
			else {
				free.push_back(i);
			}
			cnt[i] = 1;
		}
		else {
			if (cnt[1] == 1) {
				free.push_back(i);
				cnt[1] = 0;
			}
			if (cnt[i] == 0 && i > 1) {
				holes.push_back(i);
			}
		}
	}
	reverse(free.begin(), free.end());
	for (int i = N; i > 1 && !free.empty(); i--) {
		if (cnt[i] == 0) {
			free.pop_back();
			cnt[i] = 1;
		}
	}
	for (auto i: free) {
		cnt[((i - 1) + N - R % N) % N + 1]++;
	}
}

int solve(int start) {
	if (start == 1) {
		simulate(start, K, cnt1);
	}
	else if (a[start * 2 - 2] < K) {
		if (a[start * 2 - 3] < K) {
			if (a[start * 2 - 1] < K) {
				if (cnt1[start] == 0) {
					cnt1[start - 1] = 0;
					cnt1[start] = 1;
				}
			}
		}
		else {
			simulate(start, K, cnt1);
		}
	}
	if (start == 1 || (a[start * 2 - 2] > K)) {
		simulate(start, K + 1, cnt2);
	}
	for (int i = 1; i <= N; i++) {
		if (cnt1[i] != cnt2[i]) {
			return i;
		}
	}
	return -1;
}

void just_do_it() {
	cin >> N >> R >> K;
	for (int i = 1; i <= N * 2 - 1; i++) {
		cin >> a[i];
	}
	if (N == 1) {
		cout << 1;
		return;
	}
	if (K == 1) {
		cout << N;
		return;
	}
	if (K == N * 2) {
		cout << 2;
		return;
	}
	pair<int, int> res = make_pair(N + 1, 0);
	for (int i = 1; i <= N; i++) {
		res = min(res, make_pair(solve(i), -i));
	}
	cout << -res.second;
}

Subtask #1

6.0 / 6.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	89 ms	372 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct

Subtask #2

62.0 / 94.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	228 KB	Output is correct
3	Correct	27 ms	368 KB	Output is correct
4	Execution timed out	2083 ms	596 KB	Time limit exceeded
5	Execution timed out	2072 ms	3620 KB	Time limit exceeded
6	Correct	1 ms	340 KB	Output is correct
7	Correct	9 ms	360 KB	Output is correct
8	Execution timed out	2067 ms	596 KB	Time limit exceeded
9	Execution timed out	2082 ms	596 KB	Time limit exceeded
10	Correct	30 ms	460 KB	Output is correct
11	Execution timed out	2067 ms	724 KB	Time limit exceeded
12	Correct	55 ms	340 KB	Output is correct
13	Execution timed out	2091 ms	2900 KB	Time limit exceeded
14	Correct	344 ms	428 KB	Output is correct
15	Execution timed out	2095 ms	852 KB	Time limit exceeded
16	Correct	2 ms	340 KB	Output is correct
17	Correct	27 ms	364 KB	Output is correct
18	Correct	25 ms	340 KB	Output is correct
19	Correct	93 ms	400 KB	Output is correct
20	Correct	322 ms	340 KB	Output is correct
21	Execution timed out	2043 ms	724 KB	Time limit exceeded
22	Execution timed out	2080 ms	852 KB	Time limit exceeded
23	Execution timed out	2072 ms	3936 KB	Time limit exceeded
24	Correct	1 ms	340 KB	Output is correct
25	Correct	7 ms	364 KB	Output is correct
26	Correct	120 ms	424 KB	Output is correct
27	Execution timed out	2085 ms	724 KB	Time limit exceeded
28	Execution timed out	2055 ms	2912 KB	Time limit exceeded
29	Correct	6 ms	340 KB	Output is correct
30	Correct	37 ms	340 KB	Output is correct
31	Correct	1662 ms	684 KB	Output is correct
32	Execution timed out	2071 ms	3732 KB	Time limit exceeded
33	Correct	1 ms	340 KB	Output is correct
34	Correct	1 ms	212 KB	Output is correct
35	Correct	11 ms	392 KB	Output is correct
36	Correct	22 ms	388 KB	Output is correct
37	Correct	1089 ms	608 KB	Output is correct
38	Execution timed out	2078 ms	724 KB	Time limit exceeded
39	Correct	1 ms	340 KB	Output is correct
40	Correct	5 ms	340 KB	Output is correct
41	Correct	18 ms	340 KB	Output is correct
42	Correct	22 ms	388 KB	Output is correct
43	Correct	103 ms	412 KB	Output is correct
44	Correct	302 ms	516 KB	Output is correct
45	Correct	1115 ms	704 KB	Output is correct
46	Execution timed out	2076 ms	596 KB	Time limit exceeded
47	Execution timed out	2071 ms	4080 KB	Time limit exceeded