Submission #841610

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
841610	2023-09-01T18:31:09 Z	andrei_c1	Longest Trip (IOI23_longesttrip)	C++17	40 / 100	9 ms	600 KB

longesttrip

#include "longesttrip.h"
#include <bits/stdc++.h>

using namespace std;

uint64_t randomAddress() {
	char *p = new char;
	delete p;
	return uint64_t(p);
}
uint64_t SEED = chrono::steady_clock::now().time_since_epoch().count() * (randomAddress() | 1);
// mt19937 rng(SEED);

void concat(vector<int> &t1, vector<int> &t2) {
	if(t1.size() < t2.size()) {
		swap(t1, t2);
	}
	while(!t2.empty()) {
		t1.emplace_back(t2.back());
		t2.pop_back();
	}
}

std::vector<int> longest_trip(int n, int D) {
	srand(SEED);
	vector<int> res, ord(n);
	iota(ord.begin(), ord.end(), 0);
	random_shuffle(ord.begin(), ord.end());
	if(D == 3) {
		for(const auto &u: ord) {
			res.emplace_back(u);
		}
	} else if(D == 2) {
		deque<int> dq;
		dq.emplace_back(ord.back());
		ord.pop_back();
		for(vector<int>::iterator it = ord.begin(); it != ord.end(); it++) {
			if(are_connected({dq.back()}, {*it})) {
				dq.emplace_back(*it);
				ord.erase(it);
				break;
			}
		}
		assert((int) dq.size() == 2);
		for(const auto &u: ord) {
			if(are_connected({u}, {dq.back()})) {
				dq.emplace_back(u);
			} else {
				assert(are_connected({u}, {dq.front()}));
				dq.emplace_front(u);
			}
		}
		for(const auto &u: dq) {
			res.emplace_back(u);
		}
	} else {
		vector<int> t1, t2;
		t1.emplace_back(ord.back());
		ord.pop_back();
		t2.emplace_back(ord.back());
		ord.pop_back();
		for(const auto &u: ord) {
			if(are_connected({u}, {t1.back()})) {
				t1.emplace_back(u);
			} else if(are_connected({u}, {t2.back()})) {
				t2.emplace_back(u);
			} else {
				concat(t1, t2);
				t2.emplace_back(u);
			}
		}
		if(t1.size() < t2.size()) {
			swap(t1, t2);
		}
		for(const auto &u: t1) {
			res.emplace_back(u);
		}
	}
	return res;
}

Subtask #0

0.0 / 0.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	344 KB	Incorrect
2	Halted	0 ms	0 KB	-

Subtask #1

5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	344 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct
3	Correct	1 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

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

Subtask #3

25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	344 KB	Output is correct
2	Correct	4 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	4 ms	344 KB	Output is correct
6	Correct	5 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	4 ms	344 KB	Output is correct
11	Correct	4 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	5 ms	344 KB	Output is correct
15	Correct	6 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	344 KB	Output is correct
20	Correct	5 ms	344 KB	Output is correct
21	Correct	5 ms	344 KB	Output is correct
22	Correct	5 ms	344 KB	Output is correct
23	Correct	5 ms	600 KB	Output is correct
24	Correct	5 ms	344 KB	Output is correct
25	Correct	5 ms	344 KB	Output is correct
26	Correct	5 ms	344 KB	Output is correct
27	Correct	5 ms	344 KB	Output is correct
28	Correct	5 ms	344 KB	Output is correct
29	Correct	6 ms	344 KB	Output is correct
30	Correct	4 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	4 ms	344 KB	Output is correct
34	Correct	5 ms	344 KB	Output is correct
35	Correct	5 ms	344 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	7 ms	344 KB	Output is correct
40	Correct	7 ms	344 KB	Output is correct
41	Correct	7 ms	344 KB	Output is correct
42	Correct	7 ms	344 KB	Output is correct
43	Correct	6 ms	344 KB	Output is correct
44	Correct	6 ms	344 KB	Output is correct
45	Correct	6 ms	344 KB	Output is correct
46	Correct	8 ms	344 KB	Output is correct
47	Correct	7 ms	344 KB	Output is correct
48	Correct	7 ms	344 KB	Output is correct
49	Correct	5 ms	344 KB	Output is correct
50	Correct	5 ms	344 KB	Output is correct
51	Correct	5 ms	344 KB	Output is correct
52	Correct	7 ms	344 KB	Output is correct
53	Correct	5 ms	344 KB	Output is correct
54	Correct	4 ms	344 KB	Output is correct
55	Correct	6 ms	600 KB	Output is correct
56	Correct	4 ms	344 KB	Output is correct
57	Correct	4 ms	344 KB	Output is correct
58	Correct	6 ms	344 KB	Output is correct
59	Correct	6 ms	344 KB	Output is correct
60	Correct	8 ms	344 KB	Output is correct
61	Correct	7 ms	344 KB	Output is correct
62	Correct	7 ms	344 KB	Output is correct
63	Correct	7 ms	344 KB	Output is correct
64	Correct	8 ms	344 KB	Output is correct

Subtask #4

0.0 / 60.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	344 KB	Incorrect
2	Halted	0 ms	0 KB	-