oj.uz

답안 #841033

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
841033 2023-09-01T06:13:17 Z jhwest2 가장 긴 여행 (IOI23_longesttrip) C++17
85 / 100
 18 ms 640 KB 
#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;

pair<int, int> find_edge(vector<int> p1, vector<int> p2) {
	if (p1.size() == 1 && p2.size() == 1) {
		return {p1[0], p2[0]};
	}
	if (p1.size() == 1) {
		int m = (int)p2.size() / 2;
		vector<int> left = vector<int>(p2.begin(), p2.begin() + m);
		vector<int> right = vector<int>(p2.begin() + m, p2.end());
		if (are_connected(p1, left)) 
			return find_edge(p1, left);
		else 
			return find_edge(p1, right);
	}
	else {
		int m = (int)p1.size() / 2;
		vector<int> left = vector<int>(p1.begin(), p1.begin() + m);
		vector<int> right = vector<int>(p1.begin() + m, p1.end());
		if (are_connected(left, p2))
			return find_edge(left, p2);
		else
			return find_edge(right, p2);
	}
}
vector<int> longest_trip(int N, int D)
{
	if (D == 3) {
		vector<int> res(N);
		iota(res.begin(), res.end(), 0);
		return res;
	}
	if (D == 2) {
		deque<int> dq = {0};
		vector<bool> chk(N);
		for (int i = 1; i < N; i++) {
			if (are_connected({0}, {i})) {
				dq.push_back(i);
				chk[i] = true;
				break;
			}
		}
		for (int i = 1; i < N; i++) {
			if (chk[i]) continue;
			if (are_connected({i}, {dq.back()}))
				dq.push_back(i);
			else
				dq.push_front(i);
		}
		return vector<int>(dq.begin(), dq.end());
	}
	vector<int> path = {0};
	vector<int> clique;
	int p = 1;
	while (true) {
		if (!clique.empty() && are_connected({path.back()}, clique)) {
			int s = -1;
			for (int x : clique) {
				if (are_connected({x}, {path.back()})) {
					s = x;
					break;
				}
			}
			path.push_back(s);
			for (int x : clique) if (s != x) {
				path.push_back(x);
			}
			clique.clear();
		}
		else {
			while (p < N && !are_connected({path.back()}, {p})) {
				clique.push_back(p++);
			}
			if (p == N) break;
			path.push_back(p++);
		}
	}
	if (clique.empty() || !are_connected(path, clique)) {
		if (path.size() < clique.size())
			return clique;
		else
			return path;
	}
	if (!clique.empty() && are_connected({path[0]}, clique)) {
		auto [u, v] = find_edge({path[0]}, clique);
		vector<int> ans;
		for (int x : clique) if (x != v) ans.push_back(x);
		ans.push_back(v);
		for (int x : path) ans.push_back(x);
		return ans;
	}
	auto [u, v] = find_edge(path, clique);
	vector<int> ans;
	for (int x : clique) if (x != v) ans.push_back(x);
	ans.push_back(v);
	p = find(path.begin(), path.end(), u) - path.begin();
	for (int i = p; i < path.size(); i++) ans.push_back(path[i]);
	for (int i = 0; i < p; i++) ans.push_back(path[i]);
	return ans;
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:99:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   99 |  for (int i = p; i < path.size(); i++) ans.push_back(path[i]);
      |                  ~~^~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

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

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 208 KB Output is correct
2 Correct 9 ms 208 KB Output is correct
3 Correct 7 ms 208 KB Output is correct
4 Correct 7 ms 208 KB Output is correct
5 Correct 6 ms 208 KB Output is correct
6 Correct 10 ms 208 KB Output is correct
7 Correct 7 ms 208 KB Output is correct
8 Correct 8 ms 208 KB Output is correct
9 Correct 7 ms 208 KB Output is correct
10 Correct 7 ms 208 KB Output is correct
11 Correct 9 ms 208 KB Output is correct
12 Correct 8 ms 208 KB Output is correct
13 Correct 6 ms 208 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 208 KB Output is correct
2 Correct 6 ms 208 KB Output is correct
3 Correct 5 ms 208 KB Output is correct
4 Correct 8 ms 208 KB Output is correct
5 Correct 9 ms 208 KB Output is correct
6 Correct 10 ms 208 KB Output is correct
7 Correct 9 ms 208 KB Output is correct
8 Correct 9 ms 208 KB Output is correct
9 Correct 7 ms 208 KB Output is correct
10 Correct 6 ms 208 KB Output is correct
11 Correct 7 ms 208 KB Output is correct
12 Correct 7 ms 208 KB Output is correct
13 Correct 7 ms 208 KB Output is correct
14 Correct 9 ms 208 KB Output is correct
15 Correct 8 ms 208 KB Output is correct
16 Correct 10 ms 208 KB Output is correct
17 Correct 11 ms 208 KB Output is correct
18 Correct 9 ms 208 KB Output is correct
19 Correct 9 ms 300 KB Output is correct
20 Correct 13 ms 208 KB Output is correct
21 Correct 8 ms 208 KB Output is correct
22 Correct 10 ms 208 KB Output is correct
23 Correct 9 ms 276 KB Output is correct
24 Correct 8 ms 208 KB Output is correct
25 Correct 12 ms 208 KB Output is correct
26 Correct 10 ms 208 KB Output is correct
27 Correct 9 ms 208 KB Output is correct
28 Correct 9 ms 208 KB Output is correct
29 Correct 10 ms 208 KB Output is correct
30 Correct 11 ms 208 KB Output is correct
31 Correct 13 ms 208 KB Output is correct
32 Correct 11 ms 208 KB Output is correct
33 Correct 8 ms 208 KB Output is correct
34 Correct 10 ms 208 KB Output is correct
35 Correct 12 ms 208 KB Output is correct
36 Correct 6 ms 208 KB Output is correct
37 Correct 18 ms 208 KB Output is correct
38 Correct 12 ms 208 KB Output is correct
39 Correct 17 ms 208 KB Output is correct
40 Correct 14 ms 208 KB Output is correct
41 Correct 12 ms 208 KB Output is correct
42 Correct 15 ms 208 KB Output is correct
43 Correct 14 ms 208 KB Output is correct
44 Correct 12 ms 208 KB Output is correct
45 Correct 12 ms 208 KB Output is correct
46 Correct 10 ms 208 KB Output is correct
47 Correct 14 ms 208 KB Output is correct
48 Correct 11 ms 208 KB Output is correct
49 Correct 12 ms 208 KB Output is correct
50 Correct 11 ms 208 KB Output is correct
51 Correct 11 ms 208 KB Output is correct
52 Correct 12 ms 208 KB Output is correct
53 Correct 9 ms 296 KB Output is correct
54 Correct 13 ms 208 KB Output is correct
55 Correct 11 ms 208 KB Output is correct
56 Correct 11 ms 208 KB Output is correct
57 Correct 17 ms 208 KB Output is correct
58 Correct 11 ms 208 KB Output is correct
59 Correct 14 ms 208 KB Output is correct
60 Correct 12 ms 296 KB Output is correct
61 Correct 12 ms 208 KB Output is correct
62 Correct 14 ms 220 KB Output is correct
63 Correct 14 ms 208 KB Output is correct
64 Correct 15 ms 208 KB Output is correct

Subtask #4
45.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 208 KB Output is correct
2 Correct 6 ms 208 KB Output is correct
3 Correct 8 ms 208 KB Output is correct
4 Correct 7 ms 208 KB Output is correct
5 Correct 7 ms 208 KB Output is correct
6 Correct 11 ms 208 KB Output is correct
7 Correct 9 ms 208 KB Output is correct
8 Correct 8 ms 208 KB Output is correct
9 Correct 7 ms 220 KB Output is correct
10 Correct 7 ms 208 KB Output is correct
11 Correct 7 ms 208 KB Output is correct
12 Correct 5 ms 208 KB Output is correct
13 Correct 5 ms 208 KB Output is correct
14 Correct 10 ms 208 KB Output is correct
15 Correct 13 ms 208 KB Output is correct
16 Correct 12 ms 208 KB Output is correct
17 Correct 8 ms 208 KB Output is correct
18 Correct 10 ms 208 KB Output is correct
19 Correct 12 ms 208 KB Output is correct
20 Correct 5 ms 208 KB Output is correct
21 Correct 10 ms 208 KB Output is correct
22 Correct 8 ms 208 KB Output is correct
23 Correct 11 ms 208 KB Output is correct
24 Correct 12 ms 208 KB Output is correct
25 Correct 13 ms 208 KB Output is correct
26 Correct 10 ms 208 KB Output is correct
27 Correct 11 ms 208 KB Output is correct
28 Correct 10 ms 208 KB Output is correct
29 Correct 9 ms 208 KB Output is correct
30 Correct 8 ms 208 KB Output is correct
31 Correct 10 ms 332 KB Output is correct
32 Correct 13 ms 260 KB Output is correct
33 Correct 10 ms 208 KB Output is correct
34 Correct 9 ms 208 KB Output is correct
35 Correct 14 ms 208 KB Output is correct
36 Correct 13 ms 208 KB Output is correct
37 Correct 12 ms 208 KB Output is correct
38 Correct 13 ms 208 KB Output is correct
39 Correct 11 ms 296 KB Output is correct
40 Correct 10 ms 332 KB Output is correct
41 Correct 7 ms 208 KB Output is correct
42 Correct 12 ms 208 KB Output is correct
43 Correct 9 ms 208 KB Output is correct
44 Correct 12 ms 208 KB Output is correct
45 Correct 6 ms 208 KB Output is correct
46 Correct 10 ms 336 KB Output is correct
47 Partially correct 11 ms 208 KB Output is partially correct
48 Partially correct 18 ms 208 KB Output is partially correct
49 Partially correct 14 ms 208 KB Output is partially correct
50 Partially correct 18 ms 208 KB Output is partially correct
51 Partially correct 13 ms 208 KB Output is partially correct
52 Correct 13 ms 208 KB Output is correct
53 Correct 12 ms 208 KB Output is correct
54 Correct 14 ms 208 KB Output is correct
55 Correct 12 ms 208 KB Output is correct
56 Partially correct 16 ms 208 KB Output is partially correct
57 Partially correct 13 ms 332 KB Output is partially correct
58 Partially correct 12 ms 208 KB Output is partially correct
59 Partially correct 12 ms 332 KB Output is partially correct
60 Correct 15 ms 208 KB Output is correct
61 Correct 12 ms 208 KB Output is correct
62 Correct 8 ms 208 KB Output is correct
63 Partially correct 12 ms 208 KB Output is partially correct
64 Partially correct 12 ms 336 KB Output is partially correct
65 Partially correct 16 ms 208 KB Output is partially correct
66 Partially correct 12 ms 332 KB Output is partially correct
67 Correct 17 ms 208 KB Output is correct
68 Partially correct 11 ms 316 KB Output is partially correct
69 Partially correct 13 ms 208 KB Output is partially correct
70 Partially correct 14 ms 208 KB Output is partially correct
71 Partially correct 16 ms 208 KB Output is partially correct
72 Partially correct 11 ms 304 KB Output is partially correct
73 Partially correct 11 ms 312 KB Output is partially correct
74 Partially correct 12 ms 640 KB Output is partially correct
75 Partially correct 12 ms 312 KB Output is partially correct
76 Partially correct 12 ms 208 KB Output is partially correct
77 Partially correct 14 ms 208 KB Output is partially correct
78 Partially correct 13 ms 208 KB Output is partially correct
79 Partially correct 16 ms 308 KB Output is partially correct
80 Partially correct 14 ms 320 KB Output is partially correct
81 Partially correct 15 ms 316 KB Output is partially correct
82 Partially correct 13 ms 208 KB Output is partially correct