Submission #155047

#	Time	Username	Problem	Language	Result	Execution time	Memory
155047		kitoha	보물 찾기 (CEOI13_treasure2)	C++14	44 / 100	2 ms	504 KiB

treasure

#include "treasure.h"

const int MAXN = 150;
int sum[MAXN][MAXN];

void findTreasure(int N) {

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

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

• Subtask 1: 44 / 100