oj.uz

Submission #72095

# Submission time Handle Problem Language Result Execution time Memory
72095 2018-08-26T05:15:23 Z 유애나(#2199, kdh9949) Magic Dowsing (FXCUP3_magic) C++17
60 / 100
 3 ms 376 KB 
#include "dowsing.h"
#include <vector>
using namespace std;

void FindTreasure(int N) {
	vector<int> v;
	for(int i = 1; i <= N; i++){
		if(Detect(i, i)) v.push_back(i);
	}
	if(v.empty()){
		for(int i = 2; i <= N; i += 2){
			if(Detect(i - 1, i)){
				if(Detect(i - 1, (i == 2 ? N : 1))) Report(i - 1, i - 1);
				else Report(i, i);
				return;
			}
		}
		Report(N, N);
	}
	else{
		if(Detect(v[0], (v[0] == 1 ? (v[1] == N ? 2 : N) : 1))) Report(v[0], v[1]);
		else Report(v[1], v[0]);
	}
}

Subtask #1
60.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Correct : C = 5
2 Correct 2 ms 376 KB Correct : C = 4
3 Correct 3 ms 376 KB Correct : C = 149
4 Correct 3 ms 348 KB Correct : C = 100
5 Partially correct 3 ms 376 KB Partially correct : C = 151
6 Correct 3 ms 376 KB Correct : C = 101
7 Correct 3 ms 376 KB Correct : C = 149
8 Partially correct 3 ms 376 KB Partially correct : C = 151
9 Partially correct 3 ms 376 KB Partially correct : C = 151
10 Partially correct 3 ms 376 KB Partially correct : C = 151
11 Correct 3 ms 376 KB Correct : C = 150
12 Correct 3 ms 376 KB Correct : C = 149