# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1033243 | Hectorungo_18 | Island Hopping (JOI24_island) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
string abc = "abcdefghijklmnopqrstuvwxyz";
void solve(int n, int l){
vector<int> b(n+1, 0);
b[1]=1;
for(int i = 1; i < n; i++){
int a = query(1, i);
if(b[a]) continue;
b[a]=1;
for(int j = 1; j < n; j++){
int b = query(a, j);
answer(a, b);
if(vis[b]) break;
vis[b]=1;
}
}
}