Submission #846613

#TimeUsernameProblemLanguageResultExecution timeMemory
846613ttamxLongest Trip (IOI23_longesttrip)C++17
15 / 100
6 ms600 KiB
#include "longesttrip.h" #include<bits/stdc++.h> using namespace std; vector<int> longest_trip(int N, int D) { if(D==3){ vector<int> ans(N); iota(ans.begin(),ans.end(),0); return ans; } if(D==2){ deque<int> path; for(int i=0;i<3;i++)path.emplace_back(i); for(int i=1;i<3;i++){ if(!are_connected({i-1},{i})){ swap(path[0],path[i-1]); swap(path[2],path[i]); break; } } for(int i=3;i<N;i++){ if(are_connected({i},{path[0]})){ path.emplace_front(i); }else{ path.emplace_back(i); } } vector<int> ans; for(auto x:path)ans.emplace_back(x); return ans; } return {}; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...