oj.uz

답안 #1016460

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

#define pb push_back

vector<int> longest_trip(int N, int D) {
	vector<int> ret;
	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 (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 (are_connected({i}, {dq.back()})) {
				dq.pb(i);
			} else {
				dq.push_front(i);
			}
		}
		ret = vector<int>(dq.begin(), dq.end());
	} else {
		bool ch2_ring = 0;
		deque<int> ch1, ch2;
		ch1.pb(0);
		int i = 1;
		for (; i < N; i++) {
			vector<int> tmp;
			if (ch1.size() == 1) {
				tmp.pb(ch1.front());
			} else {
				tmp.pb(ch1.front());
				tmp.pb(ch1.back());
			}
			if (are_connected(tmp, {i})) {
				if (ch1.size() != 1 && are_connected({ch1.front()}, {i})) {
					ch1.push_front(i);
				} else {
					ch1.pb(i);
				}
			} else {
				ch2.pb(i);
				break;
			}
		}
		for (i++; i < N; i++) {
			if (are_connected({ch1.back()}, {i})) {
				ch1.pb(i);
				if (ch2.size() == 1) {
					if (are_connected({ch2.back()}, {i})) {
						ch1.pb(ch2.back());
						ch2.pop_back();
					}
					ch2_ring = 0;
				} else if (!ch2.empty()) {
					if (!ch2_ring || are_connected({ch2.front(), ch2.back()}, {i})) {
						if (are_connected({ch2.back()}, {i})) {
							while (!ch2.empty()) {
								ch1.pb(ch2.back());
								ch2.pop_back();
							}
						} else {
							while (!ch2.empty()) {
								ch1.pb(ch2.front());
								ch2.pop_front();
							}
						}
						ch2_ring = 0;
					} else {
						ch2_ring = 1;
					}
				}
			} else {
				ch2.pb(i);
				if (are_connected({ch1.front()}, {i})) {
					while (!ch2.empty()) {
						ch1.push_front(ch2.back());
						ch2.pop_back();
					}
				}
				ch2_ring = 0;
			}
		}
		vector<int> vec1(ch1.begin(), ch1.end()), vec2(ch2.begin(), ch2.end());
		if (!vec1.empty() && !vec2.empty() && are_connected(vec1, vec2)) {
			int lo = 0, hi = (int)vec1.size() - 1, idx1 = 0;
			while (lo < hi) {
				int mid = (lo + hi) / 2;
				if (are_connected(vector<int>(vec1.begin() + lo, vec1.begin() + mid + 1), vec2)) {
					idx1 = mid;
					hi = mid;
				} else {
					idx1 = mid + 1;
					lo = mid + 1;
				}
			}
			lo = 0, hi = (int)vec2.size() - 1;
			int idx2 = 0;
			while (lo < hi) {
				int mid = (lo + hi) / 2;
				if (are_connected(vector<int>(vec2.begin() + lo, vec2.begin() + mid + 1), {vec1[idx1]})) {
					idx2 = mid;
					hi = mid;
				} else {
					idx2 = mid + 1;
					lo = mid + 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]);
			}
		} else {
			if (vec1.size() > vec2.size()) {
				ret = vec1;
			} else {
				ret = vec2;
			}
		}
	}
	return ret;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 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 5 ms 344 KB Output is correct
2 Correct 6 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 6 ms 344 KB Output is correct
6 Correct 5 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 6 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 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 5 ms 344 KB Output is correct
2 Correct 13 ms 344 KB Output is correct
3 Correct 13 ms 344 KB Output is correct
4 Correct 10 ms 344 KB Output is correct
5 Correct 7 ms 436 KB Output is correct
6 Correct 5 ms 344 KB Output is correct
7 Correct 7 ms 344 KB Output is correct
8 Correct 9 ms 344 KB Output is correct
9 Correct 8 ms 344 KB Output is correct
10 Correct 10 ms 344 KB Output is correct
11 Correct 7 ms 344 KB Output is correct
12 Correct 10 ms 344 KB Output is correct
13 Correct 13 ms 600 KB Output is correct
14 Correct 10 ms 344 KB Output is correct
15 Incorrect 0 ms 344 KB Incorrect
16 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 12 ms 344 KB Output is correct
3 Correct 9 ms 344 KB Output is correct
4 Correct 11 ms 344 KB Output is correct
5 Partially correct 7 ms 340 KB Output is partially correct
6 Correct 9 ms 344 KB Output is correct
7 Correct 12 ms 424 KB Output is correct
8 Correct 13 ms 344 KB Output is correct
9 Correct 10 ms 344 KB Output is correct
10 Partially correct 10 ms 344 KB Output is partially correct
11 Partially correct 10 ms 344 KB Output is partially correct
12 Partially correct 10 ms 344 KB Output is partially correct
13 Partially correct 13 ms 444 KB Output is partially correct
14 Correct 8 ms 344 KB Output is correct
15 Incorrect 0 ms 344 KB Incorrect
16 Halted 0 ms 0 KB -