#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 |
1 |
Runtime error |
2 ms |
376 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |