제출 #40823

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

treasure

#include "treasure.h"
int psum[101][101];
void findTreasure(int N) {
	for (int i = N; i > N / 2; i--)
		for (int j = N; j > N / 2; j--)
			psum[i][j] = countTreasure(1, 1, i, j);

	for (int i = 1; i <= N / 2; i++)
		for (int j = N / 2 + 1; j <= N; j++)
			psum[i][j] = psum[N][j] - countTreasure(i+1, 1, N, j);

	for (int i = N / 2 + 1; i <= N; i++)
		for (int j = 1; j <= N / 2; j++)
			psum[i][j] = psum[i][N] - countTreasure(1, j+1, i, N);

	for (int i = 1; i <= N / 2; i++)
		for (int j = 1; j <= N / 2; j++)
			psum[i][j] = psum[i][N] + psum[N][j] - psum[N][N] + countTreasure(i+1, j+1, N, N);

	for (int i = 1; i <= N; i++)
		for (int j = 1; j <= N; j++)
			if (psum[i][j] - psum[i - 1][j] - psum[i][j - 1] + psum[i - 1][j - 1] == 1)
				Report(i, j);
}

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

grader.c: In function 'int main()':
grader.c:63:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         my_assert(strlen(A[i]+1) == N, "each line of the map must contain N zeroes or ones (before loop)");
                                  ^

• Subtask 1: 100 / 100