Submission #1233246

#TimeUsernameProblemLanguageResultExecution timeMemory
1233246Ghulam_JunaidLongest Trip (IOI23_longesttrip)C++20
15 / 100
3 ms416 KiB
#include <bits/stdc++.h> #include "longesttrip.h" using namespace std; const int N = 256; int n, d; vector<int> longest_trip(int nn, int dd){ n = nn, d = dd; vector<int> res; deque<int> dq; if (are_connected({0}, {1})){ dq.push_back(0), dq.push_back(1); for (int i = 2; i < n; i ++){ if (are_connected({dq.back()}, {i})) dq.push_back(i); else dq.push_front(i); } for (int x : dq) res.push_back(x); return res; } dq.push_back(0); dq.push_back(2); dq.push_back(1); for (int i = 3; i < n; i ++){ if (are_connected({dq.back()}, {i})) dq.push_back(i); else dq.push_front(i); } for (int x : dq) res.push_back(x); return res; }
#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...