# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
915993 | chirathnirodha | Longest Trip (IOI23_longesttrip) | C++17 | 3068 ms | 1840 KiB |
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
#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){
if(D==3){
vector<int> tt;for(int i=0;i<n;i++)tt.PB(i);
return tt;
}
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)
# | 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... |