# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
887104 | 2023-12-13T19:15:52 Z | Username_taken12 | Longest Trip (IOI23_longesttrip) | C++17 | 0 ms | 0 KB |
#include "longesttrip.h" #include <bits/stdc++.h> using namespace std; vector<int> longest_trip(int N, int D){ vector<int> out; for(int i=0; i<N; i++) out.push_back(0); if(D==3){ for(int i=0; i<N; i++) out[i]=i+1; return out; } if(D==2){ int pnt=1; out[0]=1; while(pnt<N){ int a [1] = {pnt}; int b [1] = {pnt+1}; bool connect = are_connected(a,b); if(connect){ out[pnt]=pnt+1; pnt++; } else{ out[pnt]=pnt+2; out[pnt+1]=pnt+1; pnt++; pnt++; } } return out; } if(D==1){ return out; } return out; }