Submission #1016989

#TimeUsernameProblemLanguageResultExecution timeMemory
1016989tmarcinkeviciusLongest Trip (IOI23_longesttrip)C++17
15 / 100
8 ms452 KiB
#include<bits/stdc++.h> #include "longesttrip.h" using namespace std; vector<int> longest_trip(int N, int D) { deque<int> res; set<int> left; for (int i = 0; i < N; i++) { left.insert(i); } if (are_connected({0}, {1})) { left.erase(0); left.erase(1); res.push_back(0); res.push_back(1); } else if (are_connected({0}, {2})) { left.erase(0); left.erase(2); res.push_back(0); res.push_back(2); } else { left.erase(1); left.erase(2); res.push_back(1); res.push_back(2); } for (int i : left) { if (are_connected({i}, {res.front()})) { res.push_front(i); } else { res.push_back(i); } } vector<int> ans; while (!res.empty()) { ans.push_back(res.front()); res.pop_front(); } return ans; }
#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...