oj.uz

Submission #1069767

# Submission time Handle Problem Language Result Execution time Memory
1069767 2024-08-22T08:49:25 Z UmairAhmadMirza Longest Trip (IOI23_longesttrip) C++17
0 / 100
 857 ms 596 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.push_back(i);
		for(int j=i+1;j<n;j++){
			b.push_back(j);
			con[i][j]=are_connected(a,b);
			con[j][i]=are_connected(a,b);
			b.pop_back();
		}
		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:39:8: warning: unused variable 'bl' [-Wunused-variable]
   39 |   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 Incorrect 182 ms 344 KB too many calls
3 Halted 0 ms 0 KB -

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 344 KB Output is correct
2 Correct 61 ms 344 KB Output is correct
3 Correct 286 ms 344 KB Output is correct
4 Correct 857 ms 596 KB Output is correct
5 Incorrect 185 ms 344 KB too many calls
6 Halted 0 ms 0 KB -

Subtask #2
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 344 KB Output is correct
2 Correct 44 ms 344 KB Output is correct
3 Correct 285 ms 344 KB Output is correct
4 Correct 753 ms 344 KB Output is correct
5 Incorrect 170 ms 344 KB too many calls
6 Halted 0 ms 0 KB -

Subtask #3
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 344 KB Output is correct
2 Correct 58 ms 344 KB Output is correct
3 Correct 318 ms 344 KB Output is correct
4 Correct 745 ms 448 KB Output is correct
5 Incorrect 210 ms 344 KB too many calls
6 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 54 ms 344 KB Output is correct
3 Partially correct 295 ms 344 KB Output is partially correct
4 Partially correct 849 ms 452 KB Output is partially correct
5 Incorrect 178 ms 344 KB too many calls
6 Halted 0 ms 0 KB -