# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
841735 | 2023-09-02T01:40:16 Z | anhduc2701 | Longest Trip (IOI23_longesttrip) | C++17 | 0 ms | 0 KB |
#include<bits/stdc++.h> #include "longesttrip.h" #define pb push_back #define fi first #define se second using namespace std; typedef long long ll; int n; vector<int> longest_trip(int N,int D){ n=N; if(D==3){ vector<int>K; for(int i=0;i<N;i++){ K.pb(i); } return K; } else if(D==2){ vector<int>K; if(are_connected(vector<int>(1,0),vector<int>(1,1))){ K.pb(0); K.pb(1); } else{ K.pb(0); K.pb(2); K.pb(1); } while((int)(K.size())<N){ if(are_connected(vector<int>(1,K[0]),vector<int>(1,i))){ K.insert(K.begin(),i); } else{ K.pb(i); } } return K; } }