oj.uz

Submission #71966

# Submission time Handle Problem Language Result Execution time Memory
71966 2018-08-26T04:17:32 Z @younha_holic(#2227, jun6873, rkm0959) Magic Dowsing (FXCUP3_magic) C++17
100 / 100
 3 ms 440 KB 
#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]);
	}
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Correct : C = 4
2 Correct 2 ms 376 KB Correct : C = 3
3 Correct 3 ms 376 KB Correct : C = 148
4 Correct 3 ms 376 KB Correct : C = 99
5 Correct 3 ms 376 KB Correct : C = 150
6 Correct 3 ms 440 KB Correct : C = 100
7 Correct 3 ms 376 KB Correct : C = 148
8 Correct 3 ms 376 KB Correct : C = 150
9 Correct 3 ms 380 KB Correct : C = 150
10 Correct 3 ms 376 KB Correct : C = 150
11 Correct 3 ms 376 KB Correct : C = 149
12 Correct 3 ms 376 KB Correct : C = 148