Submission #1221201

#TimeUsernameProblemLanguageResultExecution timeMemory
1221201thangdz2k7Island Hopping (JOI24_island)C++20
100 / 100
2 ms408 KiB
#include "island.h" #include <bits/stdc++.h> using namespace std; void solve(int N, int L){ vector <int> vis(N + 1, 0); vis[1] = 1; for (int i = 1; i < N; ++ i){ int u = query(1, i); if (vis[u]) continue; vis[u] = 1; for (int j = 1; j < N; ++ j){ int v = query(u, j); answer(u, v); if (vis[v]) break; vis[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...