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 "island.h"
#include<bits/stdc++.h>
using namespace std;
void solve(int N, int L) {
int ar[305];
int vis[305];
for(int i=1;i<=N-1;i++){
ar[i]=query(1,i);
}
vis[1]=1;
for(int i=1;i<=N-1;i++){
if(!vis[ar[i]]){
vis[ar[i]]++;
int cur=1;
int x;
while(!vis[x=query(ar[i],cur)]){
vis[x]++;
answer(x,ar[i]);
cur++;
}
if(x==1)answer(x,ar[i]);
}
}
}
# | 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... |