Submission #41021

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

treasure

#include "treasure.h"
#include <iostream>
#define MAX 1000000
#define NMAX 102

int sum[NMAX][NMAX];
int n;

void findTreasure (int N) {

	int mid = N / 2 + 1;

	// 4사분면
	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++) {
			sum[i][j] = -(sum[N][N] - sum[i][N] - sum[N][j] - countTreasure(i + 1, j + 1, N, N));
		}
	}

	for (int i = N; i > 1; i--) {
		for (int j = 1; j <= N; j++) {
			sum[i][j] -= sum[i - 1][j];
		}
	}
	for (int i = 1; i <= N; i++) {
		for (int j = N; j > 1; j--) {
			sum[i][j] -= sum[i][j - 1];
		}
	}

	for (int i = 1; i <= N; i++) {
		for (int j = 1; j <= N; j++) {
			if (sum[i][j]) 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