# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1153199 | omtheprogrammer1 | Island Hopping (JOI24_island) | C++20 | 0 ms | 0 KiB |
#include<island.h>
void solve(int n, int l) {
int vis[n];
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;
}
}
}