제출 #72269

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
72269		um.. (#118)	마법 다우징 (FXCUP3_magic)	C++17	100 / 100	3 ms	380 KiB

dowsing

#include "dowsing.h"


void FindTreasure(int N) {
	int t_ans1 = 0, t_ans2 = 0;
	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;
		int ish = 0;
		if (N % 2 == 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) t_ans1 = ans, t_ans2 = ans;
			else t_ans1 = ans + 1, t_ans2 = ans + 1;
		}
		else {
			ish = 1;
			for (int i = 1; i <= N - 2; i += 2) {
				map[i][i + 1] = Detect(i, i + 1);
				if (map[i][i + 1] == 1) {
					ans = i;
					break;
				}
			}
			if (ans == 0) {
				ans = N;
				t_ans1 = ans, t_ans2 = ans;
			}
			else {

				chk = ans - 1;
				if (chk == 0) chk = N;
				if (Detect(chk, ans) == 1) t_ans1 = ans, t_ans2 = ans;
				else t_ans1 = ans + 1, t_ans2 = 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) {
					t_ans1 = ot, t_ans2 = oa;
					break;
				}
				else {
					t_ans1 = oa, t_ans2 = ot;
					break;
				}
			}
		}
	}

	Report(t_ans1, t_ans2);
}

컴파일 시 표준 에러 (stderr) 메시지

dowsing.cpp: In function 'void FindTreasure(int)':
dowsing.cpp:30:7: warning: variable 'ish' set but not used [-Wunused-but-set-variable]
   int ish = 0;
       ^~~

• Subtask 1: 100 / 100