This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "longesttrip.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
bool vis[500];
vector<int>v[500];
vector<int>ans;
void dfs(int a){
vis[a]=1;
ans.pb(a);
for(auto b:v[a]){
if(vis[b]==0){
dfs(b);
}
}
}
std::vector<int> longest_trip(int N, int D)
{
ans.clear();
for(int i=0;i<N;i++){
vis[i]=0;
v[i].clear();
}
std::deque<int> q={0};
if(are_connected({0},{1})){
q.push_back(1);
if(are_connected({2},{0})){
q.push_front(2);
}
else{
q.push_back(2);
}
}
else{
q.push_back(2);
q.push_back(1);
}
for(int i=3;i<N;i++){
if(are_connected({i},{q.back()})){
q.push_back(i);
}
else{
q.push_front(i);
}
}
while(!q.empty()){
ans.pb(q.back());
q.pop_back();
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |