# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
840870 | Minindu206 | 가장 긴 여행 (IOI23_longesttrip) | C++17 | 3049 ms | 844 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;
int mxlen = INT_MIN;
vector<int> ans;
void dfs(vector<int> adj[], int node, vector<int> &vis, vector<int> temp)
{
//cout << temp.size() << '\n';
if((int)temp.size() > mxlen)
{
// cout << 'x';
mxlen = temp.size();
ans.clear();
ans = temp;
}
else if(temp.size() == mxlen)
{
ans.clear();
ans = temp;
}
for(auto a:adj[node])
{
if(vis[a])
continue;
temp.push_back(a);
vis[a] = 1;
dfs(adj, a, vis, temp);
temp.pop_back();
vis[a] = 0;
}
}
vector<int> longest_trip(int n, int d)
{
vector<int> adj[n];
for (int i = 0; i < n - 1; i++)
{
for (int j = i + 1; j < n; j++)
{
if (are_connected({i}, {j}))
{
adj[i].push_back(j);
adj[j].push_back(i);
}
}
}
vector<int> vis, temp;
for (int i = 0; i < n; i++)
{
temp.clear();
vis.resize(n, 0);
temp.push_back(i);
vis[i] = 1;
dfs(adj, i, vis, temp);
if(mxlen == n)
{
break;
}
}
// cout << "MAX:-" << mxlen << '\n';
mxlen = -1;
return ans;
}
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... |