Submission #40822

#	Time	Username	Problem	Language	Result	Execution time	Memory
40822		meylady	보물 찾기 (CEOI13_treasure2)	C++14	100 / 100	2 ms	720 KiB

treasure

#include "treasure.h"
#include <stdio.h>



int sum[104][104];


void findTreasure (int N) {
	
	//4사분면
	int mid = (N / 2) + 1;
	for (int i = mid; i <= N; i++) {
		for (int j = mid; j <= N; j++) {
			sum[i][j] = countTreasure(1, 1, i, j);
		}
	}
	//3사분면
	for (int i = mid; i <= N; i++) {
		for (int j = 1; j < mid; j++) {
			sum[i][j] = sum[i][N] - countTreasure(1, j + 1, i, N);
		}
	}
	//2사분면
	for (int i = 1; i < mid; i++) {
		for (int j = mid; j <= N; j++) {
			sum[i][j] = sum[N][j] - countTreasure(i + 1,1, N, j);
		}
	}
	//1사분면
	for (int i = 1; i < mid; i++) {
		for (int j = 1; j < mid; j++) {
			int num = sum[N][N] - sum[i][N] - sum[N][j] - countTreasure(i + 1, j + 1, N, N);
			sum[i][j] = -num;
		}
	}
	//맵구하기
	for (int i = 1; i <= N; i++) {
		for (int j = 1; j <= N; j++) {
			int num = sum[i][j] - sum[i-1][j] - sum[i][j-1] + sum[i - 1][j - 1];
			if (num == 1)Report(i, j);
		}
	}

}

Compilation message (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