# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
71976 | (#118) | Magic Dowsing (FXCUP3_magic) | C++17 | 0 ms | 0 KiB |
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"dowsing.h"
#include<vector>
using namespace std;
void FindTreasure(int N){
vector<int> v(N+1);
for(int i=1;i<N;i++) v[i] = Detect(i,i);
int dc = 0;
for(int i=1;i<N;i++) if(v[i]) dc++;
if(dc==1) v[N] = 1, dc++;
if(dc==2){
int x,y;
for(int i=1;i<=N;i++) if(v[i]){
x=i; break;
}
for(int i=x+1;i<=N;i++) if(v[i]){
y=i; break;
}
if(Detect(x,y)) Report(y,x);
else Report(x,y);
return;
}
else{
for(int i=1;i<N;i+=2){
if(Detect(i,i+1)){
int other = -1;
for(int j=1;j<=N;j++) if(j!=i&&j!=i+1) other=j;
if(Detect(i,j)) Report(i,i);
else Report(i+1,i+1);
return;
}
}
Report(N,N);
}
}