#include<bits/stdc++.h>
#include "island.h"
using namespace std;
void solve(int N, int L) {
int vis[310];
int prev=query(1,N-1);
int now=query(prev,1);
answer(now,prev);
memset(vis,127,sizeof vis);
for(int i=1;i<=N-2;i++)
{
int v=query(now,1);
if(v!=prev)
{
answer(v,now);
prev=now;
now=v;
continue;
}
v=query(now,2);
answer(v,now);
prev=now;
now=v;
continue;
}
}
# | 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... |