Submission #962546

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
962546	2024-04-13T19:05:26 Z	alex_2008	Longest Trip (IOI23_longesttrip)	C++17	100 / 100	16 ms	1116 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 i = 2; i < n - 1; i += 2) {
		int a = perm[i], b = perm[i + 1];
		if (find_edge(a, b)) {
			if (find_edge(p1.back(), a)) {
				p1.push_back(a);
				p1.push_back(b);
			}
			else if (find_edge(p2.back(), a)) {
				p2.push_back(a);
				p2.push_back(b);
			}
			else {
				while (!p2.empty()) {
					p1.push_back(p2.back());
					p2.pop_back();
				}
				p2.push_back(a);
				p2.push_back(b);
			}
		}
		else {
			if (find_edge(p1.back(), a)) p1.push_back(a);
			else {
				p1.push_back(b);
				b = a;
			}
			if (find_edge(p2.back(), b)) {
				p2.push_back(b);
			}
			else {
				while (!p2.empty()) {
					p1.push_back(p2.back());
					p2.pop_back();
				}
				p2.push_back(b);
			}
		}
	}
	if (n % 2 == 1) {
		int a = perm.back();
		if (find_edge(p1.back(), a)) {
			p1.push_back(a);
		}
		else if (find_edge(p2.back(), a)) {
			p2.push_back(a);
		}
		else {
			while (!p2.empty()) {
				p1.push_back(p2.back());
				p2.pop_back();
			}
			p2.push_back(a);
		}
	}
	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

#	Verdict	Execution time	Memory	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

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	344 KB	Output is correct
2	Correct	7 ms	340 KB	Output is correct
3	Correct	5 ms	344 KB	Output is correct
4	Correct	4 ms	344 KB	Output is correct
5	Correct	6 ms	436 KB	Output is correct

Subtask #2

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	340 KB	Output is correct
2	Correct	6 ms	344 KB	Output is correct
3	Correct	4 ms	344 KB	Output is correct
4	Correct	4 ms	344 KB	Output is correct
5	Correct	6 ms	600 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	340 KB	Output is correct
9	Correct	5 ms	600 KB	Output is correct
10	Correct	4 ms	344 KB	Output is correct
11	Correct	5 ms	344 KB	Output is correct
12	Correct	4 ms	344 KB	Output is correct
13	Correct	5 ms	344 KB	Output is correct

Subtask #3

25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	344 KB	Output is correct
2	Correct	7 ms	344 KB	Output is correct
3	Correct	4 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	9 ms	344 KB	Output is correct
7	Correct	7 ms	596 KB	Output is correct
8	Correct	5 ms	344 KB	Output is correct
9	Correct	4 ms	532 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	4 ms	344 KB	Output is correct
14	Correct	14 ms	344 KB	Output is correct
15	Correct	11 ms	344 KB	Output is correct
16	Correct	6 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	5 ms	600 KB	Output is correct
20	Correct	5 ms	600 KB	Output is correct
21	Correct	5 ms	344 KB	Output is correct
22	Correct	5 ms	608 KB	Output is correct
23	Correct	6 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	11 ms	344 KB	Output is correct
27	Correct	10 ms	344 KB	Output is correct
28	Correct	9 ms	344 KB	Output is correct
29	Correct	8 ms	344 KB	Output is correct
30	Correct	6 ms	344 KB	Output is correct
31	Correct	6 ms	344 KB	Output is correct
32	Correct	6 ms	344 KB	Output is correct
33	Correct	5 ms	340 KB	Output is correct
34	Correct	5 ms	440 KB	Output is correct
35	Correct	5 ms	600 KB	Output is correct
36	Correct	4 ms	344 KB	Output is correct
37	Correct	5 ms	344 KB	Output is correct
38	Correct	5 ms	344 KB	Output is correct
39	Correct	6 ms	344 KB	Output is correct
40	Correct	6 ms	344 KB	Output is correct
41	Correct	6 ms	344 KB	Output is correct
42	Correct	7 ms	600 KB	Output is correct
43	Correct	6 ms	344 KB	Output is correct
44	Correct	6 ms	344 KB	Output is correct
45	Correct	8 ms	344 KB	Output is correct
46	Correct	10 ms	344 KB	Output is correct
47	Correct	8 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	5 ms	440 KB	Output is correct
51	Correct	7 ms	684 KB	Output is correct
52	Correct	8 ms	440 KB	Output is correct
53	Correct	5 ms	344 KB	Output is correct
54	Correct	6 ms	600 KB	Output is correct
55	Correct	6 ms	344 KB	Output is correct
56	Correct	6 ms	608 KB	Output is correct
57	Correct	5 ms	1116 KB	Output is correct
58	Correct	6 ms	644 KB	Output is correct
59	Correct	7 ms	848 KB	Output is correct
60	Correct	8 ms	604 KB	Output is correct
61	Correct	7 ms	600 KB	Output is correct
62	Correct	7 ms	856 KB	Output is correct
63	Correct	9 ms	448 KB	Output is correct
64	Correct	8 ms	448 KB	Output is correct

Subtask #4

60.0 / 60.0

#	Verdict	Execution time	Memory	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	4 ms	344 KB	Output is correct
6	Correct	9 ms	344 KB	Output is correct
7	Correct	6 ms	344 KB	Output is correct
8	Correct	5 ms	388 KB	Output is correct
9	Correct	5 ms	344 KB	Output is correct
10	Correct	4 ms	344 KB	Output is correct
11	Correct	5 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	16 ms	344 KB	Output is correct
15	Correct	10 ms	344 KB	Output is correct
16	Correct	9 ms	344 KB	Output is correct
17	Correct	6 ms	344 KB	Output is correct
18	Correct	5 ms	344 KB	Output is correct
19	Correct	5 ms	344 KB	Output is correct
20	Correct	6 ms	600 KB	Output is correct
21	Correct	12 ms	344 KB	Output is correct
22	Correct	12 ms	344 KB	Output is correct
23	Correct	9 ms	344 KB	Output is correct
24	Correct	7 ms	344 KB	Output is correct
25	Correct	8 ms	344 KB	Output is correct
26	Correct	6 ms	344 KB	Output is correct
27	Correct	6 ms	344 KB	Output is correct
28	Correct	6 ms	344 KB	Output is correct
29	Correct	5 ms	600 KB	Output is correct
30	Correct	5 ms	600 KB	Output is correct
31	Correct	5 ms	600 KB	Output is correct
32	Correct	10 ms	344 KB	Output is correct
33	Correct	8 ms	344 KB	Output is correct
34	Correct	10 ms	344 KB	Output is correct
35	Correct	10 ms	344 KB	Output is correct
36	Correct	7 ms	344 KB	Output is correct
37	Correct	7 ms	440 KB	Output is correct
38	Correct	7 ms	436 KB	Output is correct
39	Correct	7 ms	440 KB	Output is correct
40	Correct	6 ms	600 KB	Output is correct
41	Correct	5 ms	344 KB	Output is correct
42	Correct	6 ms	344 KB	Output is correct
43	Correct	5 ms	600 KB	Output is correct
44	Correct	5 ms	344 KB	Output is correct
45	Correct	5 ms	344 KB	Output is correct
46	Correct	5 ms	344 KB	Output is correct
47	Correct	5 ms	532 KB	Output is correct
48	Correct	5 ms	344 KB	Output is correct
49	Correct	6 ms	344 KB	Output is correct
50	Correct	6 ms	344 KB	Output is correct
51	Correct	7 ms	344 KB	Output is correct
52	Correct	6 ms	344 KB	Output is correct
53	Correct	6 ms	344 KB	Output is correct
54	Correct	6 ms	344 KB	Output is correct
55	Correct	7 ms	344 KB	Output is correct
56	Correct	5 ms	344 KB	Output is correct
57	Correct	7 ms	600 KB	Output is correct
58	Correct	6 ms	600 KB	Output is correct
59	Correct	6 ms	504 KB	Output is correct
60	Correct	6 ms	344 KB	Output is correct
61	Correct	6 ms	344 KB	Output is correct
62	Correct	5 ms	608 KB	Output is correct
63	Correct	6 ms	708 KB	Output is correct
64	Correct	6 ms	448 KB	Output is correct
65	Correct	7 ms	868 KB	Output is correct
66	Correct	8 ms	856 KB	Output is correct
67	Correct	8 ms	604 KB	Output is correct
68	Correct	8 ms	600 KB	Output is correct
69	Correct	8 ms	860 KB	Output is correct
70	Correct	7 ms	604 KB	Output is correct
71	Correct	6 ms	608 KB	Output is correct
72	Correct	6 ms	444 KB	Output is correct
73	Correct	7 ms	600 KB	Output is correct
74	Correct	7 ms	604 KB	Output is correct
75	Correct	8 ms	604 KB	Output is correct
76	Correct	9 ms	604 KB	Output is correct
77	Correct	5 ms	700 KB	Output is correct
78	Correct	7 ms	700 KB	Output is correct
79	Correct	7 ms	696 KB	Output is correct
80	Correct	7 ms	604 KB	Output is correct
81	Correct	7 ms	444 KB	Output is correct
82	Correct	7 ms	600 KB	Output is correct