#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <random>
#include <utility>
#include <vector>
#include "island.h"
int const MAX=305;
int aproape[MAX];
int notif[MAX];
void solve(int N, int L) {
int i;
for(i=1;i<=N;++i){
aproape[i]=query(i,1);
notif[i]=0;
}
for(i=N;i>1;--i){
int vec=aproape[i];
int nrvec=1;
while(1){
if(vec>i)
break;
if(notif[vec]==i)
break;
answer(i,vec);
notif[aproape[vec]]=i;
++nrvec;
vec=query(i,nrvec);
}
}
}
# | 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... |