제출 #1069797

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1069797		Muhammad_Aneeq	Longest Trip (IOI23_longesttrip)	C++17	40 / 100	957 ms	1472 KiB

longesttrip

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

컴파일 시 표준 에러 (stderr) 메시지

longesttrip.cpp: In function 'void dfs(int, int)':
longesttrip.cpp:15:7: warning: variable 'w' set but not used [-Wunused-but-set-variable]
   15 |  bool w=0;
      |       ^

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