Submission #1238443

#TimeUsernameProblemLanguageResultExecution timeMemory
1238443t_hollIsland Hopping (JOI24_island)C++20
0 / 100
1 ms408 KiB
#include "island.h" #include <bits/stdc++.h> using namespace std; void solve(int N, int L) { vector<bool> found(N + 1); found[1] = true; for (int k = 1; k < N; k ++) { int i = query(i, k); if (found[i]) continue ; found[i] = true; int off = 1; int nxt = -1; do { if (nxt != -1) found[nxt] = true; nxt = query(i, off ++); answer(i, nxt); } while (found[nxt]); } }
#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...