Submission #1171742

#TimeUsernameProblemLanguageResultExecution timeMemory
1171742peterandvoiIsland Hopping (JOI24_island)C++20
100 / 100
2 ms416 KiB
#include <bits/stdc++.h> using namespace std; #ifdef LOCAL #include "C:\debug.h" #else #define debug(...) 42 #endif #include "island.h" void solve(int n, int l) { vector<int> pos, ord(n + 1); for (int i = 1; i < n; ++i) { pos.push_back(query(1, i)); ord[pos.back()] = i; } vector<bool> has_parent(n + 1); for (int u : pos) { if (has_parent[u]) continue; for (int i = 1; i < n; ++i) { int v = query(u, i); answer(u, v); if (ord[v] < ord[u]) break; has_parent[v] = 1; } } }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...