Submission #40801

#	Time	Username	Problem	Language	Result	Execution time	Memory
40801		bysu	보물 찾기 (CEOI13_treasure2)	C++14	0 / 100	2 ms	612 KiB

treasure

#include "treasure.h"
int dp[101][101];
int dp1[101][101];
int save[10001][2];
int idx;
int cnt;
int lim;
int func(int r, int c) {
	if (dp[r][c] == -1) {
		dp[r][c] = countTreasure(1, 1, r, c);
	}
	return dp[r][c];
}

int func1(int r, int c) {
	if (dp1[r][c] == -1) {
		dp1[r][c] = countTreasure(r, c, lim, lim);
	}
	return dp1[r][c];
}
void findTreasure(int N) {
	lim = N;
	cnt = countTreasure(1, 1, N, N);
	for (int i = 1; i < 101; i++) {
		for (int j = 1; j < 101; j++) {
			dp[i][j] = -1;
		}
	}
	int mid = N / 2;
	for (int i = N; i > mid; i--) {
		for (int j = N; j > 0; j--) {
			if (func(i, j) - func(i - 1, j) - func(i, j - 1) + func(i - 1, j - 1)) {
				save[idx][0] = i;
				save[idx++][1] = j;
			}
		}
	}
	for (int i = mid; i >= 1; i--) {
		for (int j = 1; j >= N; j--) {
			if (func(i, j) - func(i - 1, j) - func(i, j - 1) + func(i - 1, j - 1)) {
				save[idx][0] = i;
				save[idx++][1] = j;
			}
		}
	}
	for (int i = N; i > 0; i--) {
		for (int j = N; j > 0; j--) {
			if (dp[i][j] - dp[i - 1][j] - dp[i][j - 1] + dp[i - 1][j - 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: 0 / 100