#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(0);
for (int i=1;i<n;i++){
path.pb(i);
// vector<int>ask;
// ask.pb(i);
// if (are_connected(path,ask)){
// path.pb(ask[0]);
// }
}
// for (auto x:path){
// cout<<x<<" ";
// }cout<<endl;
return path;
}
// signed main(){
// int n,d;
// cin>>n>>d;
// vector<int>ans=longest_trip(n,d);
// for (auto x:ans){
// cout<<x<<" ";
// }cout<<endl;
// }
| # | 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... |