#include <bits/stdc++.h> #include "island.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); } } }