제출 #41264

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

treasure

#include "treasure.h"

int s[101][101], a[101][101];

void findTreasure (int N) {
	for (int i = N / 2 + 1; i <= N; i++) for (int j = N / 2 + 1; j <= N; j++) 
		s[i][j] = countTreasure(1, 1, i, j);
	for (int i = N / 2 + 1; i <= N; i++) for (int j = 1; j <= N / 2; j++) 
		s[i][j] = s[i][N] - countTreasure(1, j + 1, N, N);
	for (int i = 1; i <= N / 2; i++) for (int j = N / 2 + 1; j <= N; j++)
		s[i][j] = s[N][j] - countTreasure(i + 1, 1, N, N);
	for (int i = 1; i <= N / 2; i++) for (int j = 1; j <= N / 2; j++)
		s[i][j] = s[i][N] + s[N][j] + countTreasure(i + 1, j + 1, N, N) - s[N][N];
	for (int i = 1; i <= N; i++) for (int j = 1; j <= N; j++) {
		a[i][j] = s[i][j] - s[i - 1][j] - s[i][j - 1] + s[i - 1][j - 1];
		if (a[i][j]) 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: 0 / 100