제출 #1069759

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1069759		UmairAhmadMirza	Longest Trip (IOI23_longesttrip)	C++17	5 / 100	382 ms	700 KiB

longesttrip

#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 && are_connected({node},{i}))
			dfs(i);
	path.pop_back();
}
vector<int> longest_trip(int n, int D){
	longest.clear();
	nn=n;
	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)
			break;
	}
	return longest;
}

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

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:30:22: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   30 |   if(longest.size()*2>=n)
      |      ~~~~~~~~~~~~~~~~^~~

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