Submission #1048273

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1048273	2024-08-08T06:18:38 Z	박영우(#11091)	Circle Passing (EGOI24_circlepassing)	C++17	59 / 100	37 ms	8584 KB

Main

//#define LOCAL
#include <bits/stdc++.h>
#include <cassert>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define MAX 2020202
#define MAXQ 101010
#define INF 1'000'000'100'000'000'000
#define bb ' '
#define ln '\n'
#define Ln '\n'
#define MOD 1000000007
#define TC 1
#ifdef LOCAL
#define DEBUG(a) cout<<a
#define TEST true
#else
#define DEBUG(...) 1234
#define TEST false
#endif
vector<int> vs;
int N, M, Q;
int K[MAX];
int f(int a, int b) {
	return min(abs(a - b), N * 2 - abs(a - b));
}
int g(int a, int b) {
	int ans = f(a, b);
	ans = min(ans, f((a + N) % (N * 2), b) + 1);
	ans = min(ans, f((b + N) % (N * 2), a) + 1);
	return ans;
}
signed main() {
	ios::sync_with_stdio(false), cin.tie(0);
	cin >> N >> M >> Q;
	int i;
	for (i = 0; i < M; i++) cin >> K[i], vs.push_back(K[i]);
	for (i = 0; i < M; i++) vs.push_back(K[i] + N);
	vs.insert(vs.begin(), K[M - 1] - N);
	vs.push_back(K[0] + N * 2);
	int a, b;
	while (Q--) {
		cin >> a >> b;
		int ind1 = lower_bound(vs.begin(), vs.end(), a) - vs.begin();
		int ind2 = lower_bound(vs.begin(), vs.end(), b) - vs.begin();
		int i, j;
		int ans = f(a, b);
		for (i = ind1 - 1; i <= ind1; i++) {
			for (j = ind2 - 1; j <= ind2; j++) {
				int x, y;
				x = (vs[i] + N * 2) % (N * 2);
				y = (vs[j] + N * 2) % (N * 2);
				ans = min(ans, f(a, x) + f(b, y) + g(x, y));
			}
		}
		cout << ans << ln;
	}
}

Subtask #1
0.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	348 KB	Output is correct
2	Correct	3 ms	468 KB	Output is correct
3	Correct	3 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	3 ms	348 KB	Output is correct
6	Correct	3 ms	604 KB	Output is correct
7	Correct	5 ms	468 KB	Output is correct
8	Incorrect	4 ms	604 KB	Output isn't correct
9	Halted	0 ms	0 KB	-

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	344 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct

Subtask #3
22.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	344 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	344 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	1 ms	600 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	0 ms	344 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	0 ms	348 KB	Output is correct
38	Correct	0 ms	348 KB	Output is correct
39	Correct	0 ms	348 KB	Output is correct
40	Correct	0 ms	348 KB	Output is correct
41	Correct	0 ms	348 KB	Output is correct
42	Correct	0 ms	348 KB	Output is correct
43	Correct	0 ms	348 KB	Output is correct
44	Correct	0 ms	348 KB	Output is correct
45	Correct	1 ms	348 KB	Output is correct
46	Correct	1 ms	348 KB	Output is correct
47	Correct	0 ms	348 KB	Output is correct
48	Correct	1 ms	348 KB	Output is correct
49	Correct	0 ms	348 KB	Output is correct
50	Correct	0 ms	348 KB	Output is correct
51	Correct	0 ms	348 KB	Output is correct
52	Correct	0 ms	348 KB	Output is correct

Subtask #4
17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	604 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	26 ms	8584 KB	Output is correct
4	Correct	10 ms	3800 KB	Output is correct
5	Correct	4 ms	604 KB	Output is correct
6	Correct	4 ms	532 KB	Output is correct
7	Correct	4 ms	604 KB	Output is correct
8	Correct	3 ms	604 KB	Output is correct
9	Correct	3 ms	604 KB	Output is correct
10	Correct	3 ms	604 KB	Output is correct
11	Correct	4 ms	604 KB	Output is correct
12	Correct	5 ms	604 KB	Output is correct
13	Correct	4 ms	604 KB	Output is correct
14	Correct	6 ms	604 KB	Output is correct
15	Correct	18 ms	4864 KB	Output is correct
16	Correct	21 ms	4824 KB	Output is correct
17	Correct	37 ms	7588 KB	Output is correct
18	Correct	35 ms	7256 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct

Subtask #5
0.0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	348 KB	Output is correct
2	Correct	3 ms	468 KB	Output is correct
3	Correct	3 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	3 ms	348 KB	Output is correct
6	Correct	3 ms	604 KB	Output is correct
7	Correct	5 ms	468 KB	Output is correct
8	Incorrect	4 ms	604 KB	Output isn't correct
9	Halted	0 ms	0 KB	-

Submission #1048273

Compilation message

Subtask #1 0.0 / 14.0

Subtask #2 20.0 / 20.0

Subtask #3 22.0 / 22.0

Subtask #4 17.0 / 17.0

Subtask #5 0.0 / 27.0

Subtask #1
0.0 / 14.0

Subtask #2
20.0 / 20.0

Subtask #3
22.0 / 22.0

Subtask #4
17.0 / 17.0

Subtask #5
0.0 / 27.0