#include <bits/stdc++.h>
#include "longesttrip.h"
using namespace std;
#define ll long long
#define pb push_back
vector<int> longest_trip(int n, int D)
{
vector<int>path;
path.pb(1);
for (int i=2;i<=n;i++){
vector<int>ask;
ask.pb(i);
if (are_connected(path,ask)){
path.pb(ask[0]);
}
}
return path;
}
| # | 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... |