#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;
std::vector<int> longest_trip(int n, int D)
{
vector<vector<bool>> adj(n, vector<bool>(n));
for(int i = 0; i<n; i++){
for(int j = i+1; j<n; j++){
if(are_connected({i}, {j})){
adj[i][j] = 1;
adj[j][i] = 1;
}
}
}
// longest path ???
// D=2
vector<int> sol(n-1);
iota(sol.begin(), sol.end(), 0);
if(adj[n-1][n-2]) sol.push_back(n-1);
else sol.insert(sol.begin(), n-1);
return sol;
}
# | 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... |