| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1073250 | Unforgettablepl | 가장 긴 여행 (IOI23_longesttrip) | C++17 | 1004 ms | 1324 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;
vector<int> longest_trip(int N,int D){
vector<vector<int>> adj(N);
for(int i=0;i<N;i++) {
for(int j=i+1;j<N;j++) {
if(are_connected({i},{j})) {
adj[i].emplace_back(j);
adj[j].emplace_back(i);
}
}
}
int ans = 0;
for(int i=0;i<N;i++) {
vector<bool> visited(N);
function<void(int,int)> dfs = [&](int x,int depth) {
visited[x]=true;
ans=max(ans,depth);
for(int&v:adj[x])if(!visited[v])dfs(v,depth+1);
};
dfs(i,0);
}
vector<int> full;
for(int i=0;i<N;i++) {
stack<int> path;
vector<bool> visited(N);
function<void(int,int)> dfs = [&](int x,int depth) {
visited[x]=true;
path.emplace(x);
if(ans==depth) {
while(!path.empty()) {
full.emplace_back(path.top());
path.pop();
}
}
for(int&v:adj[x])if(!visited[v]) {
dfs(v,depth+1);
if(!full.empty())return;
}
path.pop();
};
dfs(i,0);
if(!full.empty())return full;
}
}
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... | ||||
