oj.uz

답안 #1016502

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1016502 2024-07-08T07:13:08 Z pavement 가장 긴 여행 (IOI23_longesttrip) C++17
15 / 100
 15 ms 600 KB 
#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;

#define pb push_back

mt19937 rng(42);

int qu;
vector<int> perm;

bool my_are_connected(vector<int> v1, vector<int> v2) {
	qu++;
	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;
	qu = 0;
	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 (my_are_connected({ch1.back()}, {i})) {
				ch1.pb(i);
				if (!ch2.empty() && my_are_connected({ch2.back()}, {i})) {
					while (!ch2.empty()) {
						ch1.pb(ch2.back());
						ch2.pop_back();
					}
				}
			} else {
				ch2.pb(i);
			}
		}
		assert(qu <= 382);
		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 {
				//~ assert(qu <= 384);
				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;
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 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 4 ms 344 KB Output is correct
5 Correct 5 ms 600 KB Output is correct
6 Correct 6 ms 344 KB Output is correct
7 Correct 5 ms 344 KB Output is correct
8 Correct 7 ms 344 KB Output is correct
9 Correct 5 ms 596 KB Output is correct
10 Correct 6 ms 344 KB Output is correct
11 Correct 7 ms 344 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 5 ms 344 KB Output is correct

Subtask #3
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 7 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 7 ms 344 KB Output is correct
8 Correct 4 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 340 KB Output is correct
12 Correct 7 ms 344 KB Output is correct
13 Correct 7 ms 344 KB Output is correct
14 Correct 14 ms 344 KB Output is correct
15 Correct 7 ms 344 KB Output is correct
16 Correct 9 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 9 ms 344 KB Output is correct
20 Correct 9 ms 344 KB Output is correct
21 Correct 6 ms 344 KB Output is correct
22 Correct 6 ms 344 KB Output is correct
23 Correct 6 ms 344 KB Output is correct
24 Correct 4 ms 344 KB Output is correct
25 Correct 10 ms 344 KB Output is correct
26 Correct 7 ms 344 KB Output is correct
27 Correct 10 ms 344 KB Output is correct
28 Correct 10 ms 344 KB Output is correct
29 Correct 14 ms 344 KB Output is correct
30 Correct 8 ms 344 KB Output is correct
31 Correct 8 ms 344 KB Output is correct
32 Correct 7 ms 344 KB Output is correct
33 Correct 8 ms 344 KB Output is correct
34 Correct 9 ms 436 KB Output is correct
35 Correct 9 ms 344 KB Output is correct
36 Runtime error 3 ms 600 KB Execution killed with signal 6
37 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 356 KB Output is correct
2 Correct 8 ms 344 KB Output is correct
3 Correct 7 ms 436 KB Output is correct
4 Correct 5 ms 344 KB Output is correct
5 Correct 5 ms 344 KB Output is correct
6 Correct 4 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 6 ms 344 KB Output is correct
12 Correct 4 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 5 ms 344 KB Output is correct
17 Correct 7 ms 344 KB Output is correct
18 Correct 7 ms 344 KB Output is correct
19 Correct 6 ms 344 KB Output is correct
20 Correct 5 ms 344 KB Output is correct
21 Correct 10 ms 344 KB Output is correct
22 Correct 8 ms 344 KB Output is correct
23 Correct 11 ms 344 KB Output is correct
24 Correct 15 ms 344 KB Output is correct
25 Correct 10 ms 344 KB Output is correct
26 Correct 11 ms 344 KB Output is correct
27 Correct 8 ms 600 KB Output is correct
28 Correct 9 ms 344 KB Output is correct
29 Correct 9 ms 344 KB Output is correct
30 Correct 8 ms 344 KB Output is correct
31 Correct 8 ms 344 KB Output is correct
32 Correct 7 ms 344 KB Output is correct
33 Correct 8 ms 344 KB Output is correct
34 Correct 6 ms 344 KB Output is correct
35 Correct 10 ms 344 KB Output is correct
36 Correct 8 ms 344 KB Output is correct
37 Correct 7 ms 344 KB Output is correct
38 Correct 10 ms 344 KB Output is correct
39 Correct 9 ms 344 KB Output is correct
40 Correct 6 ms 340 KB Output is correct
41 Correct 15 ms 344 KB Output is correct
42 Correct 9 ms 444 KB Output is correct
43 Correct 10 ms 344 KB Output is correct
44 Correct 7 ms 344 KB Output is correct
45 Correct 5 ms 344 KB Output is correct
46 Correct 7 ms 344 KB Output is correct
47 Runtime error 3 ms 600 KB Execution killed with signal 6
48 Halted 0 ms 0 KB -