제출 #94807

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
94807		newyear	보물 찾기 (CEOI13_treasure2)	C++14	100 / 100	2 ms	376 KiB

treasure

#include "treasure.h"

int psum[101][101], n;

void calc(int row, int col) {
	if (row < n - n / 2) {
		if (col < n - n / 2) psum[row][col] = psum[row][n] + psum[n][col] + countTreasure(row + 1, col + 1, n, n) - psum[n][n];
		else psum[row][col] = psum[n][col] - countTreasure(row + 1, 1, n, col);
	}
	else {
		if (col < n - n / 2) psum[row][col] = psum[row][n] - countTreasure(1, col + 1, row, n);
		else psum[row][col] = countTreasure(1, 1, row, col);
	}
}

bool result(int row, int col) {
	return psum[row][col] - psum[row][col - 1] - psum[row - 1][col] + psum[row - 1][col - 1];
}

void findTreasure(int N) {
	n = N;
	psum[n][n] = countTreasure(1, 1, N, N);
	for (int i = 1; i < N; i++) {
		if (i < n - n / 2) {
			psum[n][i] = psum[n][n] - countTreasure(1, i + 1, n, n);
			psum[i][n] = psum[n][n] - countTreasure(i + 1, 1, n, n);
		}
		else {
			psum[n][i] = countTreasure(1, 1, n, i);
			psum[i][n] = countTreasure(1, 1, i, n);
		}
	}

	for (int i = 1; i < n; i++)
		for (int j = 1; j < n; j++)
			calc(i, j);

	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++)
			if (result(i, j)) Report(i, j);
}

• Subtask 1: 100 / 100