Submission #1069684

#	Time	Username	Problem	Language	Result	Execution time	Memory
1069684		Muhammad_Aneeq	Longest Trip (IOI23_longesttrip)	C++17	15 / 100	1070 ms	592 KiB

longesttrip

#include <vector>
#include <set>
#include "longesttrip.h"
using namespace std;
int const MAXN=256;
bool nei[MAXN][MAXN]={};
vector<int>ans;
vector<int>cur;
bool vis[MAXN]={};
int n;
void dfs(int u)
{
	vis[u]=1;
	cur.push_back(u);
	bool w=0;
	for (int i=0;i<n;i++)
	{
		if (nei[i][u]&&!vis[i])
			dfs(i);
	}
	if (w==0)
	{
		if (cur.size()>ans.size())
			ans=cur;
	}
	cur.pop_back();
}
vector<int> longest_trip(int N, int D)
{
	n=N;
	ans={};
	cur={};
	for (int i=0;i<N;i++)
		for (int j=0;j<N;j++)
			nei[i][j]=0;
	for (int i=0;i<N;i++)
		for (int j=i+1;j<N;j++)
			if (are_connected({i},{j}))
				nei[i][j]=nei[j][i]=1;
	for (int i=0;i<N;i++)
	{
		for (int j=0;j<N;j++)
			vis[j]=0;
		dfs(i);
	}
	return ans;
}

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