# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
71963 | End Time (#118) | 마법 다우징 (FXCUP3_magic) | C++17 | 2 ms | 376 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;
typedef pair<int, int> pii;
void FindTreasure(int N) {
vector <int> Vu;
for (int i = 1; i <= N; i++) {
if (Detect(i, i)) Vu.push_back(i);
}
if (Vu.size() == 1) {
Report(Vu[0], Vu[0]);
return;
}
if (Detect(Vu[0], Vu[1])) Report(Vu[0], Vu[1]);
else Report(Vu[1], Vu[0]);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |