oj.uz

Submission #1069747

# Submission time Handle Problem Language Result Execution time Memory
1069747 2024-08-22T08:41:11 Z UmairAhmadMirza Longest Trip (IOI23_longesttrip) C++17
15 / 100
 1000 ms 708 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;
	vector<int> a,b;
	for(int i=0;i<n;i++){
		a={i};
		for(int j=i+1;j<n;j++){
			b={j};
			con[i][j]=con[j][i]=are_connected(a,b);
		}
		// a.pop_back();
	}
	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:37:8: warning: unused variable 'bl' [-Wunused-variable]
   37 |   bool bl=0;
      |        ^~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 219 ms 480 KB Output is correct

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 344 KB Output is correct
2 Correct 29 ms 344 KB Output is correct
3 Correct 136 ms 344 KB Output is correct
4 Correct 374 ms 344 KB Output is correct
5 Correct 758 ms 504 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 344 KB Output is correct
2 Correct 31 ms 344 KB Output is correct
3 Correct 127 ms 344 KB Output is correct
4 Correct 437 ms 344 KB Output is correct
5 Correct 845 ms 484 KB Output is correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 30 ms 344 KB Output is correct
8 Correct 158 ms 340 KB Output is correct
9 Correct 301 ms 344 KB Output is correct
10 Correct 884 ms 480 KB Output is correct
11 Correct 830 ms 480 KB Output is correct
12 Correct 844 ms 476 KB Output is correct
13 Correct 808 ms 476 KB Output is correct

Subtask #3
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 344 KB Output is correct
2 Correct 15 ms 344 KB Output is correct
3 Correct 146 ms 344 KB Output is correct
4 Correct 424 ms 460 KB Output is correct
5 Correct 959 ms 480 KB Output is correct
6 Correct 6 ms 344 KB Output is correct
7 Correct 29 ms 344 KB Output is correct
8 Correct 148 ms 600 KB Output is correct
9 Correct 326 ms 700 KB Output is correct
10 Correct 939 ms 480 KB Output is correct
11 Correct 922 ms 484 KB Output is correct
12 Correct 937 ms 476 KB Output is correct
13 Correct 903 ms 480 KB Output is correct
14 Correct 7 ms 344 KB Output is correct
15 Correct 11 ms 344 KB Output is correct
16 Correct 52 ms 344 KB Output is correct
17 Correct 97 ms 344 KB Output is correct
18 Correct 154 ms 344 KB Output is correct
19 Correct 325 ms 456 KB Output is correct
20 Correct 346 ms 592 KB Output is correct
21 Correct 941 ms 480 KB Output is correct
22 Correct 949 ms 476 KB Output is correct
23 Correct 968 ms 484 KB Output is correct
24 Correct 954 ms 480 KB Output is correct
25 Correct 9 ms 344 KB Output is correct
26 Correct 8 ms 344 KB Output is correct
27 Correct 33 ms 344 KB Output is correct
28 Correct 24 ms 344 KB Output is correct
29 Correct 28 ms 344 KB Output is correct
30 Correct 212 ms 344 KB Output is correct
31 Correct 212 ms 344 KB Output is correct
32 Correct 209 ms 344 KB Output is correct
33 Correct 338 ms 344 KB Output is correct
34 Correct 309 ms 444 KB Output is correct
35 Correct 348 ms 444 KB Output is correct
36 Correct 904 ms 480 KB Output is correct
37 Correct 881 ms 484 KB Output is correct
38 Correct 860 ms 480 KB Output is correct
39 Correct 856 ms 484 KB Output is correct
40 Correct 901 ms 480 KB Output is correct
41 Correct 893 ms 480 KB Output is correct
42 Correct 904 ms 480 KB Output is correct
43 Correct 906 ms 480 KB Output is correct
44 Correct 907 ms 476 KB Output is correct
45 Correct 8 ms 344 KB Output is correct
46 Correct 8 ms 344 KB Output is correct
47 Correct 27 ms 344 KB Output is correct
48 Correct 22 ms 344 KB Output is correct
49 Correct 31 ms 344 KB Output is correct
50 Correct 189 ms 464 KB Output is correct
51 Correct 217 ms 464 KB Output is correct
52 Correct 184 ms 436 KB Output is correct
53 Correct 299 ms 344 KB Output is correct
54 Correct 321 ms 344 KB Output is correct
55 Correct 315 ms 708 KB Output is correct
56 Correct 915 ms 480 KB Output is correct
57 Correct 848 ms 484 KB Output is correct
58 Correct 873 ms 552 KB Output is correct
59 Correct 877 ms 480 KB Output is correct
60 Correct 958 ms 552 KB Output is correct
61 Execution timed out 1016 ms 524 KB Time limit exceeded
62 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 22 ms 344 KB Output is correct
3 Partially correct 123 ms 344 KB Output is partially correct
4 Partially correct 417 ms 448 KB Output is partially correct
5 Partially correct 921 ms 484 KB Output is partially correct
6 Correct 10 ms 344 KB Output is correct
7 Correct 21 ms 344 KB Output is correct
8 Partially correct 141 ms 344 KB Output is partially correct
9 Partially correct 319 ms 344 KB Output is partially correct
10 Partially correct 975 ms 476 KB Output is partially correct
11 Partially correct 933 ms 476 KB Output is partially correct
12 Partially correct 849 ms 476 KB Output is partially correct
13 Partially correct 893 ms 480 KB Output is partially correct
14 Correct 6 ms 340 KB Output is correct
15 Correct 9 ms 344 KB Output is correct
16 Incorrect 6 ms 344 KB Incorrect
17 Halted 0 ms 0 KB -