# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
71984 | BBBSNG (#118) | 마법 다우징 (FXCUP3_magic) | C++17 | 5 ms | 504 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 <bits/stdc++.h>
using namespace std;
int A[111], B[111], P[111];
void FindTreasure(int N)
{
int i, x, y, a, b, k;
if(N < 75){
for(i=1; i<=N; i++){
A[i] = Detect(i, 1);
if(A[i] != A[1]) x = i;
}
for(i=1; i<=N; i++){
B[i] = Detect(1, i);
if(B[i] != A[1]) y = i;
}
if(A[1] != A[2] && A[1] != A[3]) x = 1;
if(B[1] != B[2] && B[1] != B[3]) y = 1;
Report(x, y);
return;
}
srand(time(0));
for(i=0; i<N; i++){
P[i] = i + 1;
}
for(i=1; i<=10000; i++){
a = rand() % N;
b = rand() % N;
swap(P[a], P[b]);
}
k = rand() % N + 1;
for(i=0; i<N; i++){
if(Detect(P[i], k)) break;
}
x = P[i];
for(i=0; i<N; i++){
P[i] = i + 1;
}
for(i=1; i<=10000; i++){
a = rand() % N;
b = rand() % N;
swap(P[a], P[b]);
}
for(i=0; i<N; i++){
if(!Detect(x, P[i])) break;
}
y = P[i];
Report(x, y);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |