제출 #995827

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

longesttrip

#include <bits/stdc++.h>
using namespace std;
bool are_connected(vector<int>A,vector<int>B);
vector<vector<int>>graph;
vector<bool>v;
vector<int>path;
void dfs(int vecino){
    v[vecino]=true;
    path.push_back(vecino);
    for(int padre:graph[vecino]){
        if(!v[padre]){
            dfs(padre);
            return;
        }
    }
}
vector<int> longest_trip(int N, int D){
    graph.clear();
    v.clear();
    graph.resize(N,vector<int>());
    v.resize(N,false);
    for(int i=0; i<N; i++){
        for(int j=i+1; j<N; j++){
            if(are_connected({i}, {j})){
                graph[i].push_back(j);
                graph[j].push_back(i);
            }
        }
    }
    vector<int>ans;
    for(int i=0;i<N;i++){
        path.clear();
        for(int j=0;j<N;j++){
            v[j]=false;
        }
        dfs(i);
        if(path.size()>ans.size()){
            ans=path;
        }
    }
    return ans;
}

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