Submission #1016516

# Submission time Handle Problem Language Result Execution time Memory
1016516 2024-07-08T07:25:41 Z pavement Longest Trip (IOI23_longesttrip) C++17
85 / 100
14 ms 712 KB
#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;

#define pb push_back

mt19937 rng(42);

vector<int> perm;

bool my_are_connected(vector<int> v1, vector<int> v2) {
	for (auto &i : v1) {
		i = perm[i];
	}
	for (auto &i : v2) {
		i = perm[i];
	}
	return are_connected(v1, v2);
}

vector<int> longest_trip(int N, int D) {
	vector<int> ret;
	perm.resize(N);
	iota(perm.begin(), perm.end(), 0);
	shuffle(perm.begin(), perm.end(), rng);
	if (D == 3) {
		ret.resize(N);
		iota(ret.begin(), ret.end(), 0);
	} else if (D == 2) {
		deque<int> dq;
		int st = -1;
		dq.pb(0);
		if (my_are_connected({0}, {1})) {
			dq.pb(1);
			st = 2;
		} else {
			dq.pb(2);
			dq.pb(1);
			st = 3;
		}
		for (int i = st; i < N; i++) {
			if (my_are_connected({i}, {dq.back()})) {
				dq.pb(i);
			} else {
				dq.push_front(i);
			}
		}
		ret = vector<int>(dq.begin(), dq.end());
	} else {
		deque<int> ch1, ch2;
		ch1.pb(0);
		for (int i = 1; i < N; i++) {
			if (ch2.empty()) {
				if (my_are_connected({ch1.back()}, {i})) {
					ch1.pb(i);
				} else {
					ch2.pb(i);
				}
			} else {
				bool b = rng() % 2;
				if (b) {
					if (my_are_connected({ch1.back()}, {i})) {
						ch1.pb(i);
						if (my_are_connected({ch2.back()}, {i})) {
							while (!ch2.empty()) {
								ch1.pb(ch2.back());
								ch2.pop_back();
							}
						}
					} else {
						ch2.pb(i);
					}
				} else {
					if (my_are_connected({ch2.back()}, {i})) {
						ch2.pb(i);
						if (my_are_connected({ch1.back()}, {i})) {
							while (!ch1.empty()) {
								ch2.pb(ch1.back());
								ch1.pop_back();
							}
							swap(ch1, ch2);
						}
					} else {
						ch1.pb(i);
					}
				}
			}
		}
		vector<int> vec1(ch1.begin(), ch1.end()), vec2(ch2.begin(), ch2.end());
		if (vec2.empty()) {
			ret = vec1;
		} else {
			if (my_are_connected({vec1[0]}, {vec2.back()})) {
				for (int i = (int)vec1.size() - 1; i >= 0; i--) {
					ret.pb(vec1[i]);
				}
				for (int i = (int)vec2.size() - 1; i >= 0; i--) {
					ret.pb(vec2[i]);
				}
			} else if (my_are_connected({vec1.back()}, {vec2[0]})) {
				for (int i = 0; i < (int)vec1.size(); i++) {
					ret.pb(vec1[i]);
				}
				for (int i = 0; i < (int)vec2.size(); i++) {
					ret.pb(vec2[i]);
				}
			} else {
				int lo = 0, hi = (int)vec1.size() - 1, idx1 = -1;
				while (lo <= hi) {
					int mid = (lo + hi) / 2;
					if (my_are_connected(vector<int>(vec1.begin(), vec1.begin() + mid + 1), vec2)) {
						idx1 = mid;
						hi = mid - 1;
					} else {
						lo = mid + 1;
					}
				}
				if (idx1 == -1) {
					if (vec1.size() > vec2.size()) {
						ret = vec1;
					} else {
						ret = vec2;
					}
				} else {
					assert(idx1 != -1);
					lo = 0, hi = (int)vec2.size() - 1;
					int idx2 = -1;
					while (lo <= hi) {
						int mid = (lo + hi) / 2;
						if (my_are_connected(vector<int>(vec2.begin(), vec2.begin() + mid + 1), {vec1[idx1]})) {
							idx2 = mid;
							hi = mid - 1;
						} else {
							lo = mid + 1;
						}
					}
					assert(idx2 != -1);
					// vec1[idx1] and vec2[idx2] are connected
					for (int i = (idx1 + 1) % (int)vec1.size(); i != idx1; i = (i + 1) % (int)vec1.size()) {
						ret.pb(vec1[i]);
					}
					ret.pb(vec1[idx1]);
					for (int i = idx2; (int)ret.size() != N; i = (i + 1) % (int)vec2.size()) {
						ret.pb(vec2[i]);
					}
				}
			}
		}
	}
	for (auto &i : ret) {
		i = perm[i];
	}
	return ret;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 344 KB Output is correct
2 Correct 7 ms 344 KB Output is correct
3 Correct 6 ms 344 KB Output is correct
4 Correct 5 ms 344 KB Output is correct
5 Correct 4 ms 344 KB Output is correct
6 Correct 6 ms 344 KB Output is correct
7 Correct 5 ms 344 KB Output is correct
8 Correct 6 ms 340 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Correct 5 ms 344 KB Output is correct
11 Correct 7 ms 344 KB Output is correct
12 Correct 6 ms 344 KB Output is correct
13 Correct 7 ms 344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 9 ms 344 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 5 ms 344 KB Output is correct
5 Correct 5 ms 344 KB Output is correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 5 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Correct 5 ms 344 KB Output is correct
11 Correct 5 ms 344 KB Output is correct
12 Correct 7 ms 344 KB Output is correct
13 Correct 6 ms 344 KB Output is correct
14 Correct 11 ms 344 KB Output is correct
15 Correct 7 ms 344 KB Output is correct
16 Correct 7 ms 344 KB Output is correct
17 Correct 9 ms 344 KB Output is correct
18 Correct 6 ms 344 KB Output is correct
19 Correct 8 ms 344 KB Output is correct
20 Correct 9 ms 344 KB Output is correct
21 Correct 4 ms 596 KB Output is correct
22 Correct 6 ms 344 KB Output is correct
23 Correct 5 ms 344 KB Output is correct
24 Correct 5 ms 344 KB Output is correct
25 Correct 13 ms 344 KB Output is correct
26 Correct 14 ms 344 KB Output is correct
27 Correct 9 ms 344 KB Output is correct
28 Correct 9 ms 344 KB Output is correct
29 Correct 9 ms 344 KB Output is correct
30 Correct 9 ms 344 KB Output is correct
31 Correct 11 ms 344 KB Output is correct
32 Correct 6 ms 344 KB Output is correct
33 Correct 7 ms 344 KB Output is correct
34 Correct 8 ms 344 KB Output is correct
35 Correct 12 ms 344 KB Output is correct
36 Correct 6 ms 344 KB Output is correct
37 Correct 7 ms 344 KB Output is correct
38 Correct 7 ms 344 KB Output is correct
39 Correct 6 ms 344 KB Output is correct
40 Correct 7 ms 344 KB Output is correct
41 Correct 10 ms 344 KB Output is correct
42 Correct 8 ms 344 KB Output is correct
43 Correct 10 ms 344 KB Output is correct
44 Correct 10 ms 344 KB Output is correct
45 Correct 7 ms 344 KB Output is correct
46 Correct 7 ms 344 KB Output is correct
47 Correct 7 ms 352 KB Output is correct
48 Correct 10 ms 344 KB Output is correct
49 Correct 10 ms 344 KB Output is correct
50 Correct 6 ms 344 KB Output is correct
51 Correct 9 ms 344 KB Output is correct
52 Correct 8 ms 344 KB Output is correct
53 Correct 7 ms 600 KB Output is correct
54 Correct 6 ms 344 KB Output is correct
55 Correct 8 ms 344 KB Output is correct
56 Correct 8 ms 440 KB Output is correct
57 Correct 10 ms 344 KB Output is correct
58 Correct 10 ms 456 KB Output is correct
59 Correct 6 ms 344 KB Output is correct
60 Correct 7 ms 448 KB Output is correct
61 Correct 7 ms 344 KB Output is correct
62 Correct 8 ms 344 KB Output is correct
63 Correct 9 ms 600 KB Output is correct
64 Correct 8 ms 344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 344 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 5 ms 344 KB Output is correct
5 Correct 5 ms 344 KB Output is correct
6 Correct 6 ms 344 KB Output is correct
7 Correct 7 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Correct 6 ms 344 KB Output is correct
11 Correct 5 ms 344 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 5 ms 344 KB Output is correct
14 Correct 11 ms 344 KB Output is correct
15 Correct 13 ms 344 KB Output is correct
16 Correct 11 ms 344 KB Output is correct
17 Correct 9 ms 344 KB Output is correct
18 Correct 6 ms 344 KB Output is correct
19 Correct 6 ms 344 KB Output is correct
20 Correct 6 ms 344 KB Output is correct
21 Correct 13 ms 344 KB Output is correct
22 Correct 12 ms 344 KB Output is correct
23 Correct 14 ms 344 KB Output is correct
24 Correct 13 ms 344 KB Output is correct
25 Correct 13 ms 344 KB Output is correct
26 Correct 9 ms 344 KB Output is correct
27 Correct 7 ms 344 KB Output is correct
28 Correct 6 ms 344 KB Output is correct
29 Correct 5 ms 344 KB Output is correct
30 Correct 8 ms 344 KB Output is correct
31 Correct 7 ms 344 KB Output is correct
32 Correct 8 ms 344 KB Output is correct
33 Correct 9 ms 344 KB Output is correct
34 Correct 7 ms 344 KB Output is correct
35 Correct 7 ms 344 KB Output is correct
36 Correct 9 ms 344 KB Output is correct
37 Correct 6 ms 344 KB Output is correct
38 Correct 6 ms 344 KB Output is correct
39 Correct 10 ms 344 KB Output is correct
40 Correct 7 ms 444 KB Output is correct
41 Correct 10 ms 344 KB Output is correct
42 Correct 8 ms 344 KB Output is correct
43 Correct 7 ms 344 KB Output is correct
44 Correct 8 ms 344 KB Output is correct
45 Correct 6 ms 344 KB Output is correct
46 Correct 7 ms 344 KB Output is correct
47 Correct 9 ms 600 KB Output is correct
48 Correct 12 ms 444 KB Output is correct
49 Correct 8 ms 344 KB Output is correct
50 Correct 7 ms 344 KB Output is correct
51 Correct 10 ms 344 KB Output is correct
52 Partially correct 10 ms 436 KB Output is partially correct
53 Partially correct 6 ms 344 KB Output is partially correct
54 Partially correct 11 ms 344 KB Output is partially correct
55 Partially correct 8 ms 344 KB Output is partially correct
56 Correct 10 ms 344 KB Output is correct
57 Correct 9 ms 452 KB Output is correct
58 Correct 8 ms 448 KB Output is correct
59 Partially correct 9 ms 344 KB Output is partially correct
60 Correct 8 ms 344 KB Output is correct
61 Partially correct 7 ms 440 KB Output is partially correct
62 Correct 5 ms 440 KB Output is correct
63 Correct 7 ms 344 KB Output is correct
64 Correct 5 ms 344 KB Output is correct
65 Partially correct 7 ms 456 KB Output is partially correct
66 Partially correct 9 ms 452 KB Output is partially correct
67 Partially correct 11 ms 456 KB Output is partially correct
68 Partially correct 8 ms 344 KB Output is partially correct
69 Partially correct 8 ms 712 KB Output is partially correct
70 Partially correct 10 ms 344 KB Output is partially correct
71 Partially correct 9 ms 344 KB Output is partially correct
72 Correct 6 ms 344 KB Output is correct
73 Partially correct 8 ms 456 KB Output is partially correct
74 Partially correct 6 ms 344 KB Output is partially correct
75 Correct 8 ms 344 KB Output is correct
76 Partially correct 8 ms 452 KB Output is partially correct
77 Partially correct 11 ms 344 KB Output is partially correct
78 Correct 10 ms 452 KB Output is correct
79 Partially correct 10 ms 344 KB Output is partially correct
80 Partially correct 7 ms 344 KB Output is partially correct
81 Partially correct 7 ms 444 KB Output is partially correct
82 Partially correct 8 ms 340 KB Output is partially correct