#include <bits/stdc++.h>
#define ll long long
#include "island.h"
using namespace std;
void solve(int n, int l) {
vector<ll> vis(n + 1);
vis[1] = 1;
for(int i = 1; i < n; i++){
ll u = query(1, i);
if(vis[u]){
continue;
}
vis[u] = 1;
for(int j = 1;j < n; j++){
ll v = query(u, j);
answer(u, v);
if(vis[v]){
break;
}
vis[v] = 1;
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |