#include <bits/stdc++.h>
#include "island.h"
using namespace std;
void solve(int n,int l){
map<int,int>d;
queue<int>o;
d[1]=1;
int x=query(1,1);
o.push(x);
d[x]=1;
answer(1,x);
x=query(1,2);
o.push(x);
d[x]=1;
answer(1,x);
x=query(1,3);
o.push(x);
d[x]=1;
answer(1,x);
int c=4;
while (c<n){
int h=o.front();
o.pop();
x=query(h,1);
if (d[x]){
x=query(h,2);
if (d[x]){
continue;
}
}
d[x]=1;
c++;
answer(x,h);
o.push(x);
}
return;
}
# | 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... |