# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
71966 | @younha_holic (#118) | Magic Dowsing (FXCUP3_magic) | C++17 | 3 ms | 440 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> y;
for (int i=1; i<N; i++) if (Detect(i, i)) y.push_back(i);
if (y.size() == 0) {
for (int i=1; i<N; i+=2) if (Detect(i, i+1)) {
if (Detect(i, i+1==N ? (i == 1 ? 2 : 1) : N)) Report(i, i);
else Report(i+1, i+1);
return;
}
Report(N, N);
}
else {
if (y.size() == 1) y.push_back(N);
if (Detect(y[0], y[1] == N ? (y[0] == 1 ? 2 : 1) : N)) Report(y[0], y[1]);
else Report(y[1], y[0]);
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |