Submission #915991

#	Time	Username	Problem	Language	Result	Execution time	Memory
915991		chirathnirodha	가장 긴 여행 (IOI23_longesttrip)	C++17	0 / 100	3056 ms	1732 KiB

longesttrip

#include "longesttrip.h"
#include<bits/stdc++.h>
using namespace std;
#define PB push_back
#define MP make_pair
#define P push
#define I insert 
#define F first
#define S second
typedef long long ll;

vector<int> v[256];
int ans;

vector<int> t,curv;
bool visited[256];
void dfs(int x,int cur){
    curv.PB(x);
    visited[x]=true;

    if(ans<cur){
        t=curv;
        ans=cur;
    }

    for(int i=0;i<v[x].size();i++){
        int y=v[x][i];
        if(visited[y])continue;
        dfs(y,cur+1);
    }

    visited[x]=false;
    curv.pop_back();
}
vector<int> longest_trip(int n, int D){
    memset(visited,false,sizeof(visited));
    for(int i=0;i<n;i++)v[i].clear();
    ans=0;
    
    for(int i=0;i<n;i++){
        for(int j=i+1;j<n;j++){
            if(are_connected({i},{j})){v[i].PB(j);v[j].PB(i);}
        }
    }
    for(int i=0;i<n;i++){
        dfs(i,1);
    }
    return t;
}

Compilation message (stderr)

longesttrip.cpp: In function 'void dfs(int, int)':
longesttrip.cpp:26:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |     for(int i=0;i<v[x].size();i++){
      |                 ~^~~~~~~~~~~~

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