Submission #1080608

#TimeUsernameProblemLanguageResultExecution timeMemory
1080608shmaxLongest Trip (IOI23_longesttrip)C++17
15 / 100
8 ms596 KiB
#include "longesttrip.h" #include "bits/stdc++.h" using namespace std; #define len(x) (int)(x.size()) #define all(x) x.begin(), x.end() #define inf 1000'000'000'000'000'000LL #define bit(x, i) (((x) >> i) & 1) template<typename T> using vec = vector<T>; std::vector<int> longest_trip(int n, int d) { mt19937 rnd(14345); if (d == 3) { vec<int> ans(n); iota(all(ans), 0); return ans; } if (d == 2) { deque<int> ans; int cur = 0; ans.push_back(cur); set<int> not_used; for (int i = 1; i < n; i++) { not_used.insert(i); } while (true) { if(not_used.empty()) break; vec<int> next(all(not_used)); int nxt = next[0]; if (are_connected({cur}, {nxt})) { ans.push_back(nxt); not_used.erase(nxt); cur = nxt; } else { if (next.size() == 1) { ans.push_front(next[0]); break; } else { int net = next[1]; ans.push_back(net); not_used.erase(net); cur = net; } } } return vec<int>(all(ans)); } }

Compilation message (stderr)

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:51:1: warning: control reaches end of non-void function [-Wreturn-type]
   51 | }
      | ^
#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...