Submission #1069821

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1069821	2024-08-22T09:12:56 Z	UmairAhmadMirza	Longest Trip (IOI23_longesttrip)	C++17	40 / 100	691 ms	1380 KB

longesttrip

#include <bits/stdc++.h>
using namespace std;
 
bool are_connected(vector<int> A, vector<int> B);
 
int const MAXN=260;
int con[MAXN][MAXN];
bool dn[MAXN][MAXN];
vector<int> path,longest;
bool vis[MAXN];
int nn;
bool is_con(int a,int b){
	if(a>b)
		swap(a,b);
	if(dn[a][b]==0){
		con[a][b]=are_connected({a},{b});
		dn[a][b]=1;
	}
	return con[a][b];
}
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 && is_con(node,i)==1)
			dfs(i);
	path.pop_back();
}
vector<int> longest_trip(int n, int D){
	for (int i = 0; i < n; ++i)
		for(int j=0;j<n;j++){
			dn[i][j]=0;
		}
	longest.clear();
	nn=n;
	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(is_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);
		// if(longest.size()*2>=n)
		// 	return longest;
	}
	return longest;
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:42:8: warning: unused variable 'bl' [-Wunused-variable]
   42 |   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	20 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	6 ms	344 KB	Output is correct
3	Correct	5 ms	344 KB	Output is correct
4	Correct	5 ms	600 KB	Output is correct
5	Correct	5 ms	600 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	7 ms	344 KB	Output is correct
4	Correct	5 ms	600 KB	Output is correct
5	Correct	8 ms	600 KB	Output is correct
6	Correct	5 ms	344 KB	Output is correct
7	Correct	7 ms	344 KB	Output is correct
8	Correct	5 ms	344 KB	Output is correct
9	Correct	7 ms	344 KB	Output is correct
10	Correct	7 ms	600 KB	Output is correct
11	Correct	6 ms	600 KB	Output is correct
12	Correct	6 ms	600 KB	Output is correct
13	Correct	8 ms	600 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	18 ms	344 KB	Output is correct
3	Correct	16 ms	344 KB	Output is correct
4	Correct	36 ms	600 KB	Output is correct
5	Correct	121 ms	856 KB	Output is correct
6	Correct	10 ms	608 KB	Output is correct
7	Correct	12 ms	344 KB	Output is correct
8	Correct	22 ms	344 KB	Output is correct
9	Correct	41 ms	344 KB	Output is correct
10	Correct	123 ms	596 KB	Output is correct
11	Correct	123 ms	600 KB	Output is correct
12	Correct	76 ms	856 KB	Output is correct
13	Correct	125 ms	856 KB	Output is correct
14	Correct	6 ms	344 KB	Output is correct
15	Correct	13 ms	340 KB	Output is correct
16	Correct	25 ms	344 KB	Output is correct
17	Correct	31 ms	344 KB	Output is correct
18	Correct	34 ms	344 KB	Output is correct
19	Correct	27 ms	344 KB	Output is correct
20	Correct	24 ms	344 KB	Output is correct
21	Correct	115 ms	856 KB	Output is correct
22	Correct	124 ms	600 KB	Output is correct
23	Correct	116 ms	600 KB	Output is correct
24	Correct	106 ms	600 KB	Output is correct
25	Correct	9 ms	344 KB	Output is correct
26	Correct	9 ms	344 KB	Output is correct
27	Correct	20 ms	344 KB	Output is correct
28	Correct	19 ms	344 KB	Output is correct
29	Correct	13 ms	344 KB	Output is correct
30	Correct	19 ms	344 KB	Output is correct
31	Correct	115 ms	344 KB	Output is correct
32	Correct	127 ms	344 KB	Output is correct
33	Correct	37 ms	344 KB	Output is correct
34	Correct	51 ms	600 KB	Output is correct
35	Correct	91 ms	344 KB	Output is correct
36	Correct	94 ms	600 KB	Output is correct
37	Correct	142 ms	600 KB	Output is correct
38	Correct	355 ms	600 KB	Output is correct
39	Correct	557 ms	1228 KB	Output is correct
40	Correct	539 ms	936 KB	Output is correct
41	Correct	564 ms	848 KB	Output is correct
42	Correct	648 ms	836 KB	Output is correct
43	Correct	675 ms	948 KB	Output is correct
44	Correct	518 ms	1172 KB	Output is correct
45	Correct	11 ms	344 KB	Output is correct
46	Correct	12 ms	344 KB	Output is correct
47	Correct	21 ms	344 KB	Output is correct
48	Correct	22 ms	600 KB	Output is correct
49	Correct	25 ms	344 KB	Output is correct
50	Correct	27 ms	344 KB	Output is correct
51	Correct	100 ms	344 KB	Output is correct
52	Correct	154 ms	344 KB	Output is correct
53	Correct	38 ms	344 KB	Output is correct
54	Correct	66 ms	596 KB	Output is correct
55	Correct	67 ms	344 KB	Output is correct
56	Correct	84 ms	856 KB	Output is correct
57	Correct	158 ms	844 KB	Output is correct
58	Correct	362 ms	848 KB	Output is correct
59	Correct	553 ms	1380 KB	Output is correct
60	Correct	590 ms	824 KB	Output is correct
61	Correct	623 ms	972 KB	Output is correct
62	Correct	691 ms	1252 KB	Output is correct
63	Correct	588 ms	1100 KB	Output is correct
64	Correct	544 ms	1124 KB	Output is correct

Subtask #4
0.0 / 60.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	344 KB	Output is correct
2	Correct	16 ms	344 KB	Output is correct
3	Correct	22 ms	988 KB	Output is correct
4	Correct	40 ms	600 KB	Output is correct
5	Partially correct	79 ms	600 KB	Output is partially correct
6	Correct	8 ms	344 KB	Output is correct
7	Correct	9 ms	344 KB	Output is correct
8	Correct	20 ms	344 KB	Output is correct
9	Correct	37 ms	344 KB	Output is correct
10	Partially correct	106 ms	856 KB	Output is partially correct
11	Partially correct	125 ms	856 KB	Output is partially correct
12	Partially correct	93 ms	856 KB	Output is partially correct
13	Partially correct	101 ms	600 KB	Output is partially correct
14	Correct	10 ms	344 KB	Output is correct
15	Correct	14 ms	344 KB	Output is correct
16	Incorrect	5 ms	344 KB	Incorrect
17	Halted	0 ms	0 KB	-

Submission #1069821

Compilation message

Subtask #0 0.0 / 0.0

Subtask #1 5.0 / 5.0

Subtask #2 10.0 / 10.0

Subtask #3 25.0 / 25.0

Subtask #4 0.0 / 60.0

Subtask #0
0.0 / 0.0

Subtask #1
5.0 / 5.0

Subtask #2
10.0 / 10.0

Subtask #3
25.0 / 25.0

Subtask #4
0.0 / 60.0