# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
72016 | ㅋ (#118) | 마법 다우징 (FXCUP3_magic) | C11 | 3 ms | 380 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"
void FindTreasure(int N)
{
int i,arr[210],sw=0,sum=0,sw2,p1=0,p2=0,p3=0;
for(i=1;i<N;i++)
{
arr[i]=Detect(i,i);
sum+=arr[i];
}
if(sum==0)
{
for(i=1;i<=N;i++)
{
if(N%2==1 && i>=N/2+1){Report(N/2+1,N/2+1); return;}
sw=Detect(i,N-i+1);
if(sw==1) break;
}
p1=i; p2=N-i+1;
for(i=1;i<=N;i++)
{
if(p1!=i && p2!=i) p3=i;
}
sw=Detect(p1,p3);
if(sw==1) Report(p1,p1);
else Report(p2,p2);
}
else
{
arr[N]=Detect(N,N);
for(i=1;i<=N;i++)
{
if(arr[i]==1) p1=i;
}
for(i=1;i<=N;i++)
{
if(arr[i]==1 && i!=p1) p2=i;
}
for(i=1;i<=N;i++)
{
if(p1!=i && p2!=i) p3=i;
}
if(Detect(p1,p3)==0) Report(p2,p1);
else Report(p1,p2);
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |