# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
887119 | Username_taken12 | Longest Trip (IOI23_longesttrip) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
return out;
}
if(D==2){
int pnt=1;
out[0]=0;
while(pnt<N){
vector<int> a;
a.push_back(pnt-1);
vector<int> b;
b.push_back(pnt);
bool connect = are_connected(a,b);
if(connect){
out[pnt]=pnt;
pnt++;
}
else if(pnt==N-1){
out[pnt]=pnt+1;
out[pnt+1]=pnt;
pnt++; pnt++;
}
else{
//out.pop_back();
for(int i=N-1; i>0; i++)
out[i]=out[i-1];
out[0]=pnt;
pnt++
}
}
return out;
}
if(D==1){
return out;
}
return out;
}
/*int main() {
vector<int> a;
a=longest_trip(5, 3);
for(int i=0; i<5; i++)
cout<<a[i]<<" ";
}*/