oj.uz

Submission #1069702

# Submission time Handle Problem Language Result Execution time Memory
1069702 2024-08-22T08:24:14 Z UmairAhmadMirza Longest Trip (IOI23_longesttrip) C++17
15 / 100
 1000 ms 600 KB 
#include <bits/stdc++.h>
using namespace std;

bool are_connected(vector<int> A, vector<int> B);

int const MAXN=260;
bool con[MAXN][MAXN];
vector<int> path,longest;
bool vis[MAXN];
int nn;
void dfs(int node){
	path.push_back(node);
	if(path.size()>longest.size())
		longest=path;
	vis[node]=1;
	for(int i=0;i<nn;i++)
		if(vis[i]==0 && con[node][i])
			dfs(i);
	path.pop_back();
}
vector<int> longest_trip(int n, int D){
	longest.clear();
	nn=n;
	for(int i=0;i<n;i++)
		for(int j=i+1;j<n;j++)
			con[i][j]=con[j][i]=are_connected({i},{j});
	if(D>1){
		path.clear();
		for (int i = 0; i < n; ++i)
			path.push_back(i);
		bool bl=0;
		for(int i=0;i<n-1;i++)
			if(con[path[i]][path[i+1]]==0){
				if(i==n-2)
					rotate(path.rbegin(), path.rbegin() + 1, path.rend());
				else
					swap(path[i+1],path[i+2]);
			}
		return path;
	}
	for (int i = 0; i < n; ++i)
	{
		path.clear();
		for(int j=0;j<n;j++)
			vis[j]=0;
		dfs(i);
	}
	return longest;
}

Compilation message

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

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 207 ms 476 KB Output is correct

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 21 ms 440 KB Output is correct
3 Correct 148 ms 344 KB Output is correct
4 Correct 415 ms 344 KB Output is correct
5 Correct 859 ms 480 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 344 KB Output is correct
2 Correct 27 ms 344 KB Output is correct
3 Correct 161 ms 344 KB Output is correct
4 Correct 421 ms 344 KB Output is correct
5 Correct 771 ms 476 KB Output is correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 22 ms 344 KB Output is correct
8 Correct 146 ms 344 KB Output is correct
9 Correct 253 ms 344 KB Output is correct
10 Correct 801 ms 480 KB Output is correct
11 Correct 771 ms 596 KB Output is correct
12 Correct 787 ms 484 KB Output is correct
13 Correct 754 ms 480 KB Output is correct

Subtask #3
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 23 ms 344 KB Output is correct
3 Correct 173 ms 456 KB Output is correct
4 Correct 424 ms 452 KB Output is correct
5 Correct 921 ms 480 KB Output is correct
6 Correct 10 ms 344 KB Output is correct
7 Correct 26 ms 344 KB Output is correct
8 Correct 162 ms 344 KB Output is correct
9 Correct 348 ms 440 KB Output is correct
10 Correct 954 ms 492 KB Output is correct
11 Correct 912 ms 480 KB Output is correct
12 Correct 904 ms 476 KB Output is correct
13 Correct 942 ms 592 KB Output is correct
14 Correct 5 ms 344 KB Output is correct
15 Correct 9 ms 340 KB Output is correct
16 Correct 38 ms 344 KB Output is correct
17 Correct 107 ms 344 KB Output is correct
18 Correct 159 ms 344 KB Output is correct
19 Correct 307 ms 344 KB Output is correct
20 Correct 293 ms 592 KB Output is correct
21 Correct 923 ms 480 KB Output is correct
22 Correct 940 ms 480 KB Output is correct
23 Correct 953 ms 480 KB Output is correct
24 Correct 897 ms 476 KB Output is correct
25 Correct 7 ms 596 KB Output is correct
26 Correct 9 ms 344 KB Output is correct
27 Correct 22 ms 344 KB Output is correct
28 Correct 23 ms 344 KB Output is correct
29 Correct 26 ms 344 KB Output is correct
30 Correct 202 ms 344 KB Output is correct
31 Correct 213 ms 344 KB Output is correct
32 Correct 208 ms 344 KB Output is correct
33 Correct 345 ms 344 KB Output is correct
34 Correct 350 ms 592 KB Output is correct
35 Correct 345 ms 344 KB Output is correct
36 Correct 962 ms 480 KB Output is correct
37 Correct 903 ms 476 KB Output is correct
38 Correct 910 ms 484 KB Output is correct
39 Correct 867 ms 592 KB Output is correct
40 Correct 853 ms 592 KB Output is correct
41 Correct 894 ms 480 KB Output is correct
42 Correct 895 ms 476 KB Output is correct
43 Correct 936 ms 484 KB Output is correct
44 Correct 915 ms 600 KB Output is correct
45 Correct 6 ms 344 KB Output is correct
46 Correct 10 ms 344 KB Output is correct
47 Correct 22 ms 344 KB Output is correct
48 Correct 20 ms 344 KB Output is correct
49 Correct 19 ms 344 KB Output is correct
50 Correct 216 ms 344 KB Output is correct
51 Correct 210 ms 592 KB Output is correct
52 Correct 208 ms 600 KB Output is correct
53 Correct 301 ms 344 KB Output is correct
54 Correct 298 ms 444 KB Output is correct
55 Correct 326 ms 444 KB Output is correct
56 Correct 924 ms 480 KB Output is correct
57 Execution timed out 1008 ms 476 KB Time limit exceeded
58 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 344 KB Output is correct
2 Correct 29 ms 344 KB Output is correct
3 Partially correct 124 ms 344 KB Output is partially correct
4 Partially correct 384 ms 600 KB Output is partially correct
5 Partially correct 850 ms 496 KB Output is partially correct
6 Correct 10 ms 344 KB Output is correct
7 Correct 22 ms 344 KB Output is correct
8 Partially correct 161 ms 452 KB Output is partially correct
9 Partially correct 330 ms 344 KB Output is partially correct
10 Partially correct 825 ms 480 KB Output is partially correct
11 Partially correct 806 ms 480 KB Output is partially correct
12 Partially correct 922 ms 476 KB Output is partially correct
13 Partially correct 816 ms 480 KB Output is partially correct
14 Correct 8 ms 344 KB Output is correct
15 Correct 11 ms 344 KB Output is correct
16 Incorrect 8 ms 344 KB Incorrect
17 Halted 0 ms 0 KB -