답안 #733036

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
733036	2023-04-30T03:20:34 Z	LittleCube	Bitaro's travel (JOI23_travel)	C++14	100 / 100	1018 ms	4356 KB

travel

#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define F first
#define S second
using namespace std;

int N, Q;
ll X[200005];

signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	cin >> N;
	for (int i = 1; i <= N; i++)
		cin >> X[i];
	X[0] = -1e18;
	X[N + 1] = 1e18;
	cin >> Q;
	for (int i = 1; i <= Q; i++)
	{
		ll ans = 0, S, L, R, cur;
		cin >> S;
		cur = L = R = S;
		while(L > X[1] || R < X[N])
		{
			//cerr << L << ' ' << R << '\n';
			int ldx = lower_bound(X + 1, X + 1 + N, L) - X - 1,
				rdx = upper_bound(X + 1, X + 1 + N, R) - X;
			if(cur - X[ldx] <= X[rdx] - cur)
			{
				// keep jump left
				int fL = max(1, (int)(lower_bound(X + 1, X + 1 + N, cur - (X[rdx] - cur)) - X));
				if (fL != 1 && X[fL] - X[fL - 1] <= X[rdx] - X[fL])	
					fL--;
				ans += cur - X[fL];
				cur = L = X[fL]; 
			}
			else
			{
				// keep jump right
				int fR = min(N, (int)(upper_bound(X + 1, X + 1 + N, cur + (cur - X[ldx])) - X - 1));
				if(fR != N && X[fR + 1] - X[fR] < X[fR] - X[ldx])
					fR++;
				ans += X[fR] - cur;
				cur = R = X[fR];
			}
		}
		cout << ans << '\n';
	}	
}

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	328 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	324 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	328 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	324 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	35 ms	1828 KB	Output is correct
18	Correct	35 ms	1876 KB	Output is correct
19	Correct	20 ms	1876 KB	Output is correct
20	Correct	21 ms	1828 KB	Output is correct
21	Correct	26 ms	1844 KB	Output is correct
22	Correct	20 ms	1824 KB	Output is correct
23	Correct	28 ms	1828 KB	Output is correct
24	Correct	21 ms	1808 KB	Output is correct
25	Correct	29 ms	1792 KB	Output is correct
26	Correct	53 ms	1816 KB	Output is correct
27	Correct	24 ms	1780 KB	Output is correct
28	Correct	19 ms	1816 KB	Output is correct
29	Correct	27 ms	1792 KB	Output is correct
30	Correct	20 ms	1808 KB	Output is correct
31	Correct	23 ms	1868 KB	Output is correct

Subtask #3
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	328 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	893 ms	3188 KB	Output is correct
8	Correct	866 ms	3172 KB	Output is correct
9	Correct	777 ms	3276 KB	Output is correct
10	Correct	838 ms	3368 KB	Output is correct
11	Correct	753 ms	3240 KB	Output is correct
12	Correct	752 ms	3420 KB	Output is correct
13	Correct	61 ms	2208 KB	Output is correct
14	Correct	35 ms	900 KB	Output is correct
15	Correct	484 ms	3588 KB	Output is correct
16	Correct	480 ms	3600 KB	Output is correct
17	Correct	489 ms	3680 KB	Output is correct
18	Correct	68 ms	2292 KB	Output is correct

Subtask #4
55.0 / 55.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	328 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	324 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	35 ms	1828 KB	Output is correct
18	Correct	35 ms	1876 KB	Output is correct
19	Correct	20 ms	1876 KB	Output is correct
20	Correct	21 ms	1828 KB	Output is correct
21	Correct	26 ms	1844 KB	Output is correct
22	Correct	20 ms	1824 KB	Output is correct
23	Correct	28 ms	1828 KB	Output is correct
24	Correct	21 ms	1808 KB	Output is correct
25	Correct	29 ms	1792 KB	Output is correct
26	Correct	53 ms	1816 KB	Output is correct
27	Correct	24 ms	1780 KB	Output is correct
28	Correct	19 ms	1816 KB	Output is correct
29	Correct	27 ms	1792 KB	Output is correct
30	Correct	20 ms	1808 KB	Output is correct
31	Correct	23 ms	1868 KB	Output is correct
32	Correct	1 ms	212 KB	Output is correct
33	Correct	0 ms	212 KB	Output is correct
34	Correct	1 ms	212 KB	Output is correct
35	Correct	1 ms	212 KB	Output is correct
36	Correct	1 ms	328 KB	Output is correct
37	Correct	0 ms	212 KB	Output is correct
38	Correct	893 ms	3188 KB	Output is correct
39	Correct	866 ms	3172 KB	Output is correct
40	Correct	777 ms	3276 KB	Output is correct
41	Correct	838 ms	3368 KB	Output is correct
42	Correct	753 ms	3240 KB	Output is correct
43	Correct	752 ms	3420 KB	Output is correct
44	Correct	61 ms	2208 KB	Output is correct
45	Correct	35 ms	900 KB	Output is correct
46	Correct	484 ms	3588 KB	Output is correct
47	Correct	480 ms	3600 KB	Output is correct
48	Correct	489 ms	3680 KB	Output is correct
49	Correct	68 ms	2292 KB	Output is correct
50	Correct	745 ms	4324 KB	Output is correct
51	Correct	654 ms	4328 KB	Output is correct
52	Correct	593 ms	4236 KB	Output is correct
53	Correct	939 ms	4212 KB	Output is correct
54	Correct	1018 ms	4356 KB	Output is correct
55	Correct	951 ms	4172 KB	Output is correct
56	Correct	114 ms	4208 KB	Output is correct
57	Correct	113 ms	4252 KB	Output is correct
58	Correct	114 ms	4268 KB	Output is correct

답안 #733036

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 10.0 / 10.0

Subtask #3 30.0 / 30.0

Subtask #4 55.0 / 55.0

Subtask #1
5.0 / 5.0

Subtask #2
10.0 / 10.0

Subtask #3
30.0 / 30.0

Subtask #4
55.0 / 55.0