Submission #744720

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
744720	2023-05-19T03:50:10 Z	pavement	Bitaro's travel (JOI23_travel)	C++17	15 / 100	3000 ms	12980 KB

travel

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

#define pb push_back
#define mp make_pair
#define mt make_tuple
#define int long long

using ii = pair<int, int>;
using iii = tuple<int, int, int>;

int N, Q, X[200005];

main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> N;
	for (int i = 1; i <= N; i++) {
		cin >> X[i];
	}
	cin >> Q;
	for (int S; Q--; ) {
		cin >> S;
		set<int> T;
		for (int i = 1; i <= N; i++) {
			T.insert(X[i]);
		}
		int cur = 0, chng = 0;
		bool dir = 0;
		for (int i = 1; i <= N; i++) {
			auto it = T.lower_bound(S);
			int x = (int)-1e16, y = (int)1e16;
			if (it != T.end()) {
				y = *it;
			}
			if (it != T.begin()) {
				--it;
				x = *it;
				++it;
			}
			cur += min(S - x, y - S);
			if (S - x <= y - S) {
				if (dir == 1) chng++;
				dir = 0;
				T.erase(x);
				S = x;
			} else {
				if (dir == 0) chng++;
				dir = 1;
				T.erase(y);
				S = y;
			}
		}
		cout << cur << '\n';
		assert(chng <= 60);
	}
}

Compilation message

travel.cpp:14:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   14 | main() {
      | ^~~~

Subtask #1

5.0 / 5.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	1 ms	340 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	332 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	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	332 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

#	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	1 ms	340 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	332 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	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	83 ms	12576 KB	Output is correct
18	Correct	93 ms	12684 KB	Output is correct
19	Correct	79 ms	12836 KB	Output is correct
20	Correct	79 ms	12716 KB	Output is correct
21	Correct	84 ms	12856 KB	Output is correct
22	Correct	92 ms	12948 KB	Output is correct
23	Correct	79 ms	12444 KB	Output is correct
24	Correct	85 ms	12548 KB	Output is correct
25	Correct	89 ms	12828 KB	Output is correct
26	Correct	87 ms	12864 KB	Output is correct
27	Correct	85 ms	12808 KB	Output is correct
28	Correct	85 ms	12980 KB	Output is correct
29	Correct	87 ms	12500 KB	Output is correct
30	Correct	85 ms	12620 KB	Output is correct
31	Correct	86 ms	12656 KB	Output is correct

Subtask #3

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Execution timed out	3065 ms	12464 KB	Time limit exceeded
8	Halted	0 ms	0 KB	-

Subtask #4

0 / 55.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	1 ms	340 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	332 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	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	83 ms	12576 KB	Output is correct
18	Correct	93 ms	12684 KB	Output is correct
19	Correct	79 ms	12836 KB	Output is correct
20	Correct	79 ms	12716 KB	Output is correct
21	Correct	84 ms	12856 KB	Output is correct
22	Correct	92 ms	12948 KB	Output is correct
23	Correct	79 ms	12444 KB	Output is correct
24	Correct	85 ms	12548 KB	Output is correct
25	Correct	89 ms	12828 KB	Output is correct
26	Correct	87 ms	12864 KB	Output is correct
27	Correct	85 ms	12808 KB	Output is correct
28	Correct	85 ms	12980 KB	Output is correct
29	Correct	87 ms	12500 KB	Output is correct
30	Correct	85 ms	12620 KB	Output is correct
31	Correct	86 ms	12656 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	340 KB	Output is correct
35	Correct	0 ms	212 KB	Output is correct
36	Correct	1 ms	212 KB	Output is correct
37	Correct	0 ms	212 KB	Output is correct
38	Execution timed out	3065 ms	12464 KB	Time limit exceeded
39	Halted	0 ms	0 KB	-