oj.uz

답안 #72219

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
72219 2018-08-26T06:06:47 Z um..(#2163, grape, sssyyy, arpiel0610) 마법 다우징 (FXCUP3_magic) C++17
0 / 100
 2 ms 256 KB 
#include "dowsing.h"


void FindTreasure(int N) {

	int map[105][105];
	for (int i = 1; i <= N; i++)
		for (int j = 1; j <= N; j++)
			map[i][j] = -1;

	int on = 0, oa = 0, ot = 0, zn = 0;
	for (int i = 1; i < N; i++) {
		map[i][i] = Detect(i, i);
		if (map[i][i] == 0) {
			zn++;
		}
		else {
			on++;
			if (on == 1) oa = i;
			else {
				ot = i;
				break;
			}
		}
	}

	int chk = 0;
	if (on == 0) {
		int ans = 0;
		for (int i = 1; i <= N - 3; i += 2) {
			map[i][i + 1] = Detect(i, i + 1);
			if (map[i][i + 1] == 1) {
				ans = i;
				break;
			}
		}
		if (ans == 0) ans = N - 1;

		chk = ans - 1;
		if (chk == 0) chk = N;
		if (Detect(chk, ans) == 1) Report(ans, ans);
		else Report(ans + 1, ans + 1);
	}
	else {
		if (on == 1) ot = N;

		for (int i = 1; i <= N; i++) {
			if (i != oa && i != ot) {
				if (Detect(i, oa) == 1) Report(ot, oa);
				else Report(oa, ot);
			}
		}
	}
}

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 256 KB Execution failed because the return code was nonzero
2 Halted 0 ms 0 KB -