답안 #962520

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
962520	2024-04-13T18:28:11 Z	alex_2008	가장 긴 여행 (IOI23_longesttrip)	C++17	85 / 100	20 ms	860 KB

longesttrip

#include "longesttrip.h"
#include <vector>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <chrono>
#include <random>
using namespace std;
bool find_edge(int a, int b) {
	return are_connected({ a }, { b });
}
vector <int> longest_trip(int n, int d) {
	vector <int> perm(n);
	for (int i = 0; i < n; i++) {
		perm[i] = i;
	}
	mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	shuffle(perm.begin(), perm.end(), rng);
	vector <int> p1, p2;
	p1.push_back(perm[0]);
	p2.push_back(perm[1]);
	for (int j = 2; j < n; j++) {
		int i = perm[j];
		if (find_edge(p1.back(), i)) {
			p1.push_back(i);
		}
		else if (find_edge(p2.back(), i)) {
			p2.push_back(i);
		}
		else {
			while (!p2.empty()) {
				p1.push_back(p2.back()); 
				p2.pop_back();
			}
			p2.push_back(i);
		}
	}
	if (find_edge(p1[0], p2[0])) {
		vector <int> ans;
		reverse(p1.begin(), p1.end());
		for (auto& it : p1) {
			ans.push_back(it);
		}
		for (auto& it : p2) {
			ans.push_back(it);
		}
		return ans;
	}
	if (find_edge(p1[0], p2.back())) {
		vector <int> ans;
		reverse(p1.begin(), p1.end());
		reverse(p2.begin(), p2.end());
		for (auto& it : p1) {
			ans.push_back(it);
		}
		for (auto& it : p2) {
			ans.push_back(it);
		}
		return ans;
	}
	if (find_edge(p1.back(), p2[0])) {
		vector <int> ans;
		for (auto& it : p1) {
			ans.push_back(it);
		}
		for (auto& it : p2) {
			ans.push_back(it);
		}
		return ans;
	}
	if (find_edge(p1.back(), p2.back())) {
		vector <int> ans;
		reverse(p2.begin(), p2.end());
		for (auto& it : p1) {
			ans.push_back(it);
		}
		for (auto& it : p2) {
			ans.push_back(it);
		}
		return ans;
	}
	if (!are_connected(p1, p2)) {
		if ((int)p1.size() > (int)p2.size()) {
			return p1;
		}
		return p2;
	}
	int l = 0, r = (int)p1.size() - 1, ans = -1;
	while (l <= r) {
		int mid = (l + r) / 2;
		vector <int> w;
		for (int i = mid; i < (int)p1.size(); i++) {
			w.push_back(p1[i]);
		}
		if (are_connected(w, p2)) {
			ans = mid;
			l = mid + 1;
		}
		else r = mid - 1;
	}
	int vert1 = ans;
	l = 0; r = (int)p2.size() - 1; ans = -1;
	while (l <= r) {
		int mid = (l + r) / 2;
		vector <int> w;
		for (int i = mid; i < (int)p2.size(); i++) {
			w.push_back(p2[i]);
		}
		if (are_connected({ p1[vert1] }, w)) {
			ans = mid;
			l = mid + 1;
		}
		else r = mid - 1;
	}
	int vert2 = ans;
	vector <int> final_ans;
	for (int i = vert1 + 1; i < (int)p1.size(); i++) {
		final_ans.push_back(p1[i]);
	}
	for (int i = 0; i <= vert1; i++) {
		final_ans.push_back(p1[i]);
	}
	for (int i = vert2; i < (int)p2.size(); i++) {
		final_ans.push_back(p2[i]);
	}
	for (int i = 0; i < vert2; i++) {
		final_ans.push_back(p2[i]);
	}
	return final_ans;
}

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	7 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

Subtask #2

10.0 / 10.0

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

25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	344 KB	Output is correct
2	Correct	7 ms	344 KB	Output is correct
3	Correct	5 ms	344 KB	Output is correct
4	Correct	6 ms	344 KB	Output is correct
5	Correct	5 ms	344 KB	Output is correct
6	Correct	9 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	6 ms	344 KB	Output is correct
10	Correct	7 ms	600 KB	Output is correct
11	Correct	5 ms	344 KB	Output is correct
12	Correct	5 ms	344 KB	Output is correct
13	Correct	4 ms	344 KB	Output is correct
14	Correct	15 ms	344 KB	Output is correct
15	Correct	12 ms	344 KB	Output is correct
16	Correct	8 ms	344 KB	Output is correct
17	Correct	6 ms	416 KB	Output is correct
18	Correct	6 ms	344 KB	Output is correct
19	Correct	6 ms	344 KB	Output is correct
20	Correct	7 ms	344 KB	Output is correct
21	Correct	5 ms	444 KB	Output is correct
22	Correct	8 ms	600 KB	Output is correct
23	Correct	6 ms	344 KB	Output is correct
24	Correct	6 ms	344 KB	Output is correct
25	Correct	13 ms	344 KB	Output is correct
26	Correct	20 ms	344 KB	Output is correct
27	Correct	9 ms	344 KB	Output is correct
28	Correct	8 ms	344 KB	Output is correct
29	Correct	8 ms	344 KB	Output is correct
30	Correct	5 ms	344 KB	Output is correct
31	Correct	6 ms	344 KB	Output is correct
32	Correct	8 ms	344 KB	Output is correct
33	Correct	5 ms	600 KB	Output is correct
34	Correct	5 ms	600 KB	Output is correct
35	Correct	6 ms	440 KB	Output is correct
36	Correct	5 ms	344 KB	Output is correct
37	Correct	5 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	8 ms	600 KB	Output is correct
41	Correct	7 ms	344 KB	Output is correct
42	Correct	8 ms	612 KB	Output is correct
43	Correct	8 ms	600 KB	Output is correct
44	Correct	7 ms	600 KB	Output is correct
45	Correct	9 ms	344 KB	Output is correct
46	Correct	9 ms	344 KB	Output is correct
47	Correct	9 ms	344 KB	Output is correct
48	Correct	9 ms	344 KB	Output is correct
49	Correct	8 ms	344 KB	Output is correct
50	Correct	6 ms	444 KB	Output is correct
51	Correct	8 ms	432 KB	Output is correct
52	Correct	10 ms	440 KB	Output is correct
53	Correct	6 ms	600 KB	Output is correct
54	Correct	6 ms	344 KB	Output is correct
55	Correct	6 ms	344 KB	Output is correct
56	Correct	6 ms	696 KB	Output is correct
57	Correct	6 ms	696 KB	Output is correct
58	Correct	6 ms	448 KB	Output is correct
59	Correct	10 ms	608 KB	Output is correct
60	Correct	7 ms	608 KB	Output is correct
61	Correct	8 ms	860 KB	Output is correct
62	Correct	7 ms	604 KB	Output is correct
63	Correct	7 ms	600 KB	Output is correct
64	Correct	9 ms	448 KB	Output is correct

Subtask #4

45.0 / 60.0

#	결과	실행 시간	메모리	Grader output
1	Correct	9 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	4 ms	600 KB	Output is correct
5	Correct	4 ms	344 KB	Output is correct
6	Correct	10 ms	344 KB	Output is correct
7	Correct	6 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	340 KB	Output is correct
11	Correct	4 ms	344 KB	Output is correct
12	Correct	5 ms	344 KB	Output is correct
13	Correct	5 ms	344 KB	Output is correct
14	Correct	16 ms	344 KB	Output is correct
15	Correct	12 ms	344 KB	Output is correct
16	Correct	8 ms	344 KB	Output is correct
17	Correct	6 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	5 ms	600 KB	Output is correct
21	Correct	15 ms	344 KB	Output is correct
22	Correct	11 ms	344 KB	Output is correct
23	Correct	12 ms	344 KB	Output is correct
24	Correct	9 ms	344 KB	Output is correct
25	Correct	14 ms	344 KB	Output is correct
26	Correct	5 ms	344 KB	Output is correct
27	Correct	6 ms	344 KB	Output is correct
28	Correct	7 ms	344 KB	Output is correct
29	Correct	5 ms	344 KB	Output is correct
30	Correct	6 ms	600 KB	Output is correct
31	Correct	5 ms	344 KB	Output is correct
32	Correct	11 ms	344 KB	Output is correct
33	Correct	11 ms	500 KB	Output is correct
34	Correct	12 ms	344 KB	Output is correct
35	Correct	9 ms	344 KB	Output is correct
36	Correct	9 ms	344 KB	Output is correct
37	Correct	6 ms	432 KB	Output is correct
38	Correct	7 ms	440 KB	Output is correct
39	Correct	9 ms	440 KB	Output is correct
40	Correct	6 ms	600 KB	Output is correct
41	Correct	6 ms	600 KB	Output is correct
42	Correct	7 ms	344 KB	Output is correct
43	Correct	5 ms	344 KB	Output is correct
44	Correct	5 ms	344 KB	Output is correct
45	Correct	5 ms	600 KB	Output is correct
46	Correct	6 ms	600 KB	Output is correct
47	Correct	5 ms	600 KB	Output is correct
48	Correct	5 ms	600 KB	Output is correct
49	Correct	6 ms	344 KB	Output is correct
50	Partially correct	8 ms	344 KB	Output is partially correct
51	Partially correct	6 ms	344 KB	Output is partially correct
52	Correct	9 ms	344 KB	Output is correct
53	Correct	7 ms	344 KB	Output is correct
54	Correct	8 ms	344 KB	Output is correct
55	Correct	9 ms	600 KB	Output is correct
56	Correct	5 ms	344 KB	Output is correct
57	Correct	7 ms	344 KB	Output is correct
58	Correct	7 ms	344 KB	Output is correct
59	Partially correct	7 ms	344 KB	Output is partially correct
60	Correct	8 ms	344 KB	Output is correct
61	Correct	7 ms	344 KB	Output is correct
62	Correct	5 ms	440 KB	Output is correct
63	Correct	6 ms	604 KB	Output is correct
64	Correct	8 ms	856 KB	Output is correct
65	Partially correct	7 ms	444 KB	Output is partially correct
66	Partially correct	8 ms	600 KB	Output is partially correct
67	Partially correct	8 ms	444 KB	Output is partially correct
68	Partially correct	9 ms	604 KB	Output is partially correct
69	Partially correct	7 ms	604 KB	Output is partially correct
70	Partially correct	8 ms	852 KB	Output is partially correct
71	Correct	7 ms	604 KB	Output is correct
72	Partially correct	10 ms	444 KB	Output is partially correct
73	Partially correct	9 ms	672 KB	Output is partially correct
74	Partially correct	10 ms	856 KB	Output is partially correct
75	Partially correct	7 ms	600 KB	Output is partially correct
76	Partially correct	8 ms	696 KB	Output is partially correct
77	Partially correct	7 ms	856 KB	Output is partially correct
78	Correct	7 ms	708 KB	Output is correct
79	Partially correct	9 ms	600 KB	Output is partially correct
80	Partially correct	8 ms	600 KB	Output is partially correct
81	Partially correct	8 ms	444 KB	Output is partially correct
82	Partially correct	9 ms	856 KB	Output is partially correct