#include "island.h"
#include "bits/stdc++.h"
using namespace std;
template<typename T>
using vec = vector<T>;
void solve(int N, int L) {
vec<vec<int>> g(N + 1);
for (int i = 1; i <= N; i++) {
int k = 1;
for (auto u: g[i]) {
if (u < i) k++;
}
while (k < N) {
int v = query(i, k);
if(v < i) break;
int cnt = 1;
for (auto u: g[v]) {
if (u < i) cnt++;
}
if (query(v, cnt) != i) break;
g[v].push_back(i);
g[i].push_back(v);
answer(i, v);
k++;
}
}
}
# | 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... |