Submission #1031578

#	Time	Username	Problem	Language	Result	Execution time	Memory
1031578		aaaaaarroz	Longest Trip (IOI23_longesttrip)	C++17	60 / 100	232 ms	600 KiB

longesttrip

#include"longesttrip.h"
#include<iostream>
using namespace std;
int n;
vector<int>longest_trip(int N,int D){
	n=N;
	vector<int>res={0};
	vector<bool>vis(n);
	vis[0]=true;
	while(true){
		int node=res.back();
		for(int ne=0;ne<n;ne++){
			if(!vis[ne]&&are_connected({node},{ne})){
				res.push_back(ne);
				break;
			}
		}
		vis[res.back()]=true;
		if(node==res.back())
			break;
	}
	vector<int>res2;
	for(int j=0;j<n;j++)
		if(!vis[j])
			res2.push_back(j);
	if(res2.size()){
		for(int i=0;i<(int)res.size();i++){
			if(are_connected(res2,{res[i]})){
				for(int ne=0;ne<n;ne++){
					if(!vis[ne]&&are_connected({ne},{res[i]})){
						vector<int>res2;
						for(int j=0;j<n;j++)
							if(!vis[j]&&j!=ne)
								res2.push_back(j);
						res2.push_back(ne);
						for(int j=i;j<(int)res.size();j++)
							res2.push_back(res[j]);
						for(int j=0;j<i;j++)
							res2.push_back(res[j]);
						return res2;
					}
				}
			}
		}
	}
	if(res.size()>res2.size()){
		return res;
	}
	else{
		return res2;
	}
}

• Subtask 0: 0 / 0
• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 25 / 25
• Subtask 4: 19.999999998 / 60