Submission #464039

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
464039	2021-08-12T09:48:02 Z	Elias	Fun Tour (APIO20_fun)	C++17	26 / 100	115 ms	16700 KB

#include "fun.h"

#include <vector>
#include <climits>

using namespace std;

vector<vector<int>> adj;
vector<bool> blocked;

pair<int, int> dfsLongest(int i, int parent = -1)
{
	pair<int, int> longest{0, i};

	for (int c : adj[i])
	{
		if (c == parent || blocked[c])
			continue;

		auto newLongest = dfsLongest(c, i);
		newLongest.first++;

		longest = max(longest, newLongest);
	}

	return longest;
}

vector<signed> createFunTour(signed N, signed Q)
{

	adj = vector<vector<int>>(N);
	for (int i = 0; i < N; i++)
		for (int j = 0; j < N; j++)
			if (hoursRequired(i, j) == 1) // vertices are connected
				adj[i].push_back(j);

	vector<int> solution;
	blocked = vector<bool>(N);

	int node = dfsLongest(0).second;

	for (int i = 0; i < N; i++)
	{
		int longestNode = dfsLongest(node).second;
		solution.push_back(node);
		blocked[node] = true;
		node = longestNode;
	}
	return solution;
}

/*int npow = (1LL << N);

	vector<vector<int>> dp(n, vector<int>(npow, LLONG_MAX));
	dp[0][0] = 0;

	for (int bm = 1; bm < npow; bm++)
	{
		for (int v = 0; v < n; v++)
		{
			for (int u = 0; u < n; u++)
			{
				if (u == v)
					continue;
				if (((1LL << u) & bm) == 0) // check that node was visited
					continue;
				dp[bm][v] = min(dp[bm - (1LL << u)][u] + hoursRequired(u, v), dp[bm][v]);
			}
		}
	}*/

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	320 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct

Subtask #2
16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	320 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	0 ms	204 KB	Output is correct
23	Correct	0 ms	204 KB	Output is correct
24	Correct	20 ms	352 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	1 ms	204 KB	Output is correct
27	Correct	3 ms	204 KB	Output is correct
28	Correct	0 ms	204 KB	Output is correct
29	Correct	22 ms	332 KB	Output is correct
30	Correct	1 ms	204 KB	Output is correct
31	Correct	4 ms	204 KB	Output is correct
32	Correct	7 ms	328 KB	Output is correct
33	Correct	2 ms	284 KB	Output is correct
34	Correct	20 ms	372 KB	Output is correct
35	Correct	23 ms	352 KB	Output is correct
36	Correct	25 ms	344 KB	Output is correct
37	Correct	2 ms	204 KB	Output is correct
38	Correct	22 ms	340 KB	Output is correct
39	Correct	7 ms	204 KB	Output is correct
40	Correct	11 ms	332 KB	Output is correct
41	Correct	4 ms	204 KB	Output is correct

Subtask #3
0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	1 ms	320 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	20 ms	352 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	3 ms	204 KB	Output is correct
16	Correct	20 ms	352 KB	Output is correct
17	Correct	21 ms	332 KB	Output is correct
18	Incorrect	115 ms	16700 KB	Too many queries
19	Halted	0 ms	0 KB	-

Subtask #4
0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	22 ms	332 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	4 ms	204 KB	Output is correct
11	Correct	7 ms	328 KB	Output is correct
12	Correct	2 ms	284 KB	Output is correct
13	Incorrect	35 ms	408 KB	Too many queries
14	Halted	0 ms	0 KB	-

Subtask #5
0 / 34.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	320 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	0 ms	204 KB	Output is correct
23	Correct	0 ms	204 KB	Output is correct
24	Correct	20 ms	352 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	1 ms	204 KB	Output is correct
27	Correct	3 ms	204 KB	Output is correct
28	Correct	0 ms	204 KB	Output is correct
29	Correct	22 ms	332 KB	Output is correct
30	Correct	1 ms	204 KB	Output is correct
31	Correct	4 ms	204 KB	Output is correct
32	Correct	7 ms	328 KB	Output is correct
33	Correct	2 ms	284 KB	Output is correct
34	Correct	20 ms	372 KB	Output is correct
35	Correct	23 ms	352 KB	Output is correct
36	Correct	25 ms	344 KB	Output is correct
37	Correct	2 ms	204 KB	Output is correct
38	Correct	22 ms	340 KB	Output is correct
39	Correct	7 ms	204 KB	Output is correct
40	Correct	11 ms	332 KB	Output is correct
41	Correct	4 ms	204 KB	Output is correct
42	Correct	20 ms	352 KB	Output is correct
43	Correct	21 ms	332 KB	Output is correct
44	Incorrect	115 ms	16700 KB	Too many queries
45	Halted	0 ms	0 KB	-

Submission #464039

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 16.0 / 16.0

Subtask #3 0 / 21.0

Subtask #4 0 / 19.0

Subtask #5 0 / 34.0

Subtask #1
10.0 / 10.0

Subtask #2
16.0 / 16.0

Subtask #3
0 / 21.0

Subtask #4
0 / 19.0

Subtask #5
0 / 34.0