# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
915971 | chirathnirodha | Longest Trip (IOI23_longesttrip) | C++17 | 3100 ms | 744 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];
bool grid[256][256];
int ans=0;
vector<int> t;
vector<int> curv;
bool visited[256];
void dfs(int x,int cur){
curv.PB(x);
if(ans<cur){
t=curv;
ans=cur;
}
visited[x]=true;
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(grid,false,sizeof(grid));
memset(visited,false,sizeof(visited));
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); grid[i][j]=grid[j][i]=true;}
}
}
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... |