| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1316797 | mikolaj00 | Island Hopping (JOI24_island) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
using namespace std;
void solve(int N, int L)
{
vector<bool> vis(N+1);
vis[1] = true;
for (int i = 1; i < N; i++)
{
int x = query(1, i);
if (vis[x])
continue;
vis[x] = true;
for (int j = 1; j < N; j++)
{
int y = query(x, j);
if (vis[y])
break;
vis[y] = true;
answer(x, y);
}
}
}
