Submission #1153202

#TimeUsernameProblemLanguageResultExecution timeMemory
1153202omtheprogrammer1Island Hopping (JOI24_island)C++20
0 / 100
2 ms392 KiB
#include "island.h" void solve(int n, int l) { int vis[n + 1]; vis[1] = 1; for (int i = 1; i < n; i++) { int cur = query(1, i); if (vis[cur]) continue; vis[cur] = 1; for (int j = 1; j < n; j++) { int q1 = query(cur, j); answer(cur, q1); if (vis[q1]) break; vis[q1] = 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...