# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
72313 | 2018-08-26T07:01:24 Z | https://blog.naver.com/nywoo19(#2158, HawkBreaker, njchung99, yu0524) | Magic Dowsing (FXCUP3_magic) | C++17 | 2 ms | 256 KB |
#include "dowsing.h" #include <bits/stdc++.h> using namespace std; void FindTreasure(int N) { int R, C; vector<int> vt; for(int j = 1; j <= N; j++){ if(Detect(j, j)){ vt.push_back(j); } } if(vt.size() == 0){ for(int j = 1; j < (N + 1) / 2; j++){ if(Detect(j, N - j + 1)){ if(Detect(j, j)) Report(N - j + 1, N - j + 1); else Report(j , j); return; } } Report((N + 1) / 2, (N + 1) / 2); } else{ int R = vt[0], C = vt[1]; bool f = false; for(int i = 1; i <= 5; i++){ if(i == C) continue; if(!Detect(R, i)){ f = true; break; } } if(f) swap(R, C); Report(R, C); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 2 ms | 256 KB | Execution failed because the return code was nonzero |
2 | Halted | 0 ms | 0 KB | - |