# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
72216 | um.. (#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"
void FindTreasure(int N) {
int map[105][105];
for (int i = 1; i <= N; i++)
for (int j = 1; j <= N; j++)
map[i][j] = -1;
int on = 0, oa = 0, ot = 0, zn = 0;
for (int i = 1; i < N; i++) {
map[i][i] = Detech(i, i);
if (map[i][i] == 0) {
zn++;
}
else {
on++;
if (on == 1) oa = i;
else {
ot = i;
break;
}
}
}
int chk = 0;
if (on == 0) {
int ans = 0;
for (int i = 1; i <= N - 3; i += 2) {
map[i][i + 1] = Detech(i, i + 1);
if (map[i][i + 1] == 1) {
ans = i;
break;
}
}
if (ans == 0) ans = N - 1;
chk = ans - 1;
if (chk == 0) chk = N;
if (Detech(chk, ans) == 1) Report(ans, ans);
else Report(ans + 1, ans + 1);
}
else {
if (on == 1) ot = N;
for (int i = 1; i <= N; i++) {
if (i != oa && i != ot) {
if (Detech(i, oa) == 1) Report(ot, oa);
else Report(oa, ot);
}
}
}
}