oj.uz

Submission #841806

# Submission time Handle Problem Language Result Execution time Memory
841806 2023-09-02T06:40:08 Z emuyumi Longest Trip (IOI23_longesttrip) C++17
85 / 100
 13 ms 1460 KB 
#include "longesttrip.h"

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

vector<int> longest_trip(int N, int D) {

	int calls = 0;
	auto my_are_connected = [&](vector<int> a, vector<int> b) {
		calls ++;
		return are_connected(a, b);
	};

	bool found = 0;
	vector<int> answer;
	using vi = vector<int>;
	auto halves = [&](vector<int> v) -> pair<vi, vi> {
		int m = v.size() / 2;
		return {{v.begin(), v.begin()+m}, {v.begin()+m, v.end()}};
	};
	auto locate = [&](vector<int> src, vector<int> dest) -> int {
		while (src.size() != 1) {
			auto [a, b] = halves(src);
			if (my_are_connected(a, dest)) src = a;
			else src = b;
		}
		return src[0];
	};

	vector<int> path = {0};
	vector<int> left(N-1);
	vector<int> clique;
	iota(left.begin(), left.end(), 1);
	auto cleanClique = [&]() {
		int v = path.back();
		if (!clique.empty()) {
			if (my_are_connected(clique, {v})) {
				int b = locate(clique, {v});
				clique.erase(find(clique.begin(), clique.end(), b));
				path.push_back(b);
				for (int x : clique) path.push_back(x);
				clique.clear();
			}
		}
	};
	while (left.size()) {
		cleanClique();
		int v = path.back();
		while (!left.empty()) {
			int nxt = left.back(); left.pop_back();
			if (!my_are_connected({nxt}, {v})) {
				clique.push_back(nxt);
			}
			else {
				path.push_back(nxt);
				break;
			}
		}
		v = path.back();
	}
	cleanClique();

	if (!clique.empty()) {
		if (!my_are_connected(path, clique)) {
			if (path.size() > clique.size()) return path;
			else return clique;
		}
		int a = locate(path, clique);
		int b = locate(clique, {a});

		vector<int> ans = clique;
		ans.erase(find(ans.begin(), ans.end(), b));
		ans.push_back(b);
		int j = find(path.begin(), path.end(), a) - path.begin();
		if (j == 0) {
			for (int x : path) {
				ans.push_back(x);
			}
		}
		else {
			for (int i = j; i >= 0; --i) {
				ans.push_back(path[i]);
			}
			for (int i = path.size()-1; i > j; --i) {
				ans.push_back(path[i]);
			}
		}
		return ans;
	}
	return path;
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:15:7: warning: unused variable 'found' [-Wunused-variable]
   15 |  bool found = 0;
      |       ^~~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 596 KB Output is correct
2 Correct 2 ms 600 KB Output is correct

Subtask #1
5.0 / 5.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 5 ms 344 KB Output is correct
5 Correct 4 ms 344 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 6 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 504 KB Output is correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 5 ms 344 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 4 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 4 ms 344 KB Output is correct
13 Correct 5 ms 344 KB Output is correct
14 Correct 9 ms 344 KB Output is correct
15 Correct 7 ms 344 KB Output is correct
16 Correct 7 ms 344 KB Output is correct
17 Correct 6 ms 344 KB Output is correct
18 Correct 9 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 6 ms 600 KB Output is correct
23 Correct 5 ms 344 KB Output is correct
24 Correct 5 ms 436 KB Output is correct
25 Correct 7 ms 344 KB Output is correct
26 Correct 7 ms 344 KB Output is correct
27 Correct 7 ms 344 KB Output is correct
28 Correct 7 ms 344 KB Output is correct
29 Correct 6 ms 344 KB Output is correct
30 Correct 7 ms 344 KB Output is correct
31 Correct 7 ms 440 KB Output is correct
32 Correct 7 ms 432 KB Output is correct
33 Correct 7 ms 344 KB Output is correct
34 Correct 8 ms 344 KB Output is correct
35 Correct 7 ms 344 KB Output is correct
36 Correct 7 ms 344 KB Output is correct
37 Correct 8 ms 344 KB Output is correct
38 Correct 12 ms 448 KB Output is correct
39 Correct 12 ms 688 KB Output is correct
40 Correct 9 ms 956 KB Output is correct
41 Correct 11 ms 452 KB Output is correct
42 Correct 8 ms 448 KB Output is correct
43 Correct 8 ms 456 KB Output is correct
44 Correct 8 ms 888 KB Output is correct
45 Correct 9 ms 344 KB Output is correct
46 Correct 11 ms 344 KB Output is correct
47 Correct 8 ms 344 KB Output is correct
48 Correct 8 ms 344 KB Output is correct
49 Correct 10 ms 344 KB Output is correct
50 Correct 6 ms 692 KB Output is correct
51 Correct 9 ms 688 KB Output is correct
52 Correct 7 ms 684 KB Output is correct
53 Correct 6 ms 600 KB Output is correct
54 Correct 7 ms 600 KB Output is correct
55 Correct 7 ms 600 KB Output is correct
56 Correct 6 ms 1116 KB Output is correct
57 Correct 7 ms 612 KB Output is correct
58 Correct 10 ms 704 KB Output is correct
59 Correct 9 ms 696 KB Output is correct
60 Correct 9 ms 972 KB Output is correct
61 Correct 8 ms 708 KB Output is correct
62 Correct 11 ms 952 KB Output is correct
63 Correct 9 ms 620 KB Output is correct
64 Correct 9 ms 704 KB Output is correct

Subtask #4
45.0 / 60.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 5 ms 344 KB Output is correct
5 Correct 6 ms 600 KB Output is correct
6 Correct 8 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 4 ms 344 KB Output is correct
14 Correct 12 ms 344 KB Output is correct
15 Correct 7 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 600 KB Output is correct
19 Correct 5 ms 344 KB Output is correct
20 Correct 5 ms 612 KB Output is correct
21 Correct 8 ms 344 KB Output is correct
22 Correct 8 ms 344 KB Output is correct
23 Correct 8 ms 344 KB Output is correct
24 Correct 9 ms 340 KB Output is correct
25 Correct 7 ms 344 KB Output is correct
26 Correct 7 ms 344 KB Output is correct
27 Correct 8 ms 432 KB Output is correct
28 Correct 7 ms 436 KB Output is correct
29 Correct 6 ms 344 KB Output is correct
30 Correct 9 ms 596 KB Output is correct
31 Correct 8 ms 344 KB Output is correct
32 Correct 7 ms 344 KB Output is correct
33 Correct 9 ms 344 KB Output is correct
34 Correct 7 ms 344 KB Output is correct
35 Correct 10 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 8 ms 944 KB Output is correct
39 Correct 8 ms 688 KB Output is correct
40 Correct 6 ms 856 KB Output is correct
41 Correct 7 ms 692 KB Output is correct
42 Correct 7 ms 452 KB Output is correct
43 Correct 7 ms 344 KB Output is correct
44 Correct 6 ms 852 KB Output is correct
45 Correct 6 ms 344 KB Output is correct
46 Correct 6 ms 692 KB Output is correct
47 Partially correct 8 ms 344 KB Output is partially correct
48 Partially correct 11 ms 600 KB Output is partially correct
49 Partially correct 10 ms 600 KB Output is partially correct
50 Partially correct 13 ms 856 KB Output is partially correct
51 Partially correct 9 ms 960 KB Output is partially correct
52 Correct 9 ms 704 KB Output is correct
53 Correct 9 ms 704 KB Output is correct
54 Correct 8 ms 948 KB Output is correct
55 Correct 9 ms 952 KB Output is correct
56 Partially correct 8 ms 344 KB Output is partially correct
57 Partially correct 8 ms 856 KB Output is partially correct
58 Partially correct 9 ms 956 KB Output is partially correct
59 Partially correct 8 ms 960 KB Output is partially correct
60 Correct 10 ms 704 KB Output is correct
61 Correct 8 ms 696 KB Output is correct
62 Partially correct 8 ms 1460 KB Output is partially correct
63 Partially correct 8 ms 968 KB Output is partially correct
64 Partially correct 8 ms 968 KB Output is partially correct
65 Partially correct 11 ms 452 KB Output is partially correct
66 Partially correct 8 ms 720 KB Output is partially correct
67 Partially correct 9 ms 972 KB Output is partially correct
68 Partially correct 8 ms 952 KB Output is partially correct
69 Partially correct 9 ms 1124 KB Output is partially correct
70 Partially correct 8 ms 960 KB Output is partially correct
71 Partially correct 7 ms 1120 KB Output is partially correct
72 Partially correct 8 ms 872 KB Output is partially correct
73 Partially correct 10 ms 944 KB Output is partially correct
74 Partially correct 8 ms 716 KB Output is partially correct
75 Partially correct 10 ms 964 KB Output is partially correct
76 Partially correct 9 ms 704 KB Output is partially correct
77 Partially correct 9 ms 856 KB Output is partially correct
78 Partially correct 10 ms 868 KB Output is partially correct
79 Partially correct 9 ms 724 KB Output is partially correct
80 Partially correct 9 ms 720 KB Output is partially correct
81 Partially correct 9 ms 716 KB Output is partially correct
82 Correct 9 ms 712 KB Output is correct