oj.uz

답안 #39450

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
39450 2018-01-15T09:05:12 Z ykmyou 보물 찾기 (CEOI13_treasure2) C++14
100 / 100
 0 ms 1220 KB 
#include "treasure.h"

int tCnt[102][102];

void findTreasure (int N) {	
	int mid = N / 2;
	for (int i = N; i >= 1; i--) {
		for (int j = N; j >= 1; j--) {
			if (i <= mid) {
				if (j <= mid)	// 1 사분면
					tCnt[i][j] = tCnt[i][N] + tCnt[N][j] + countTreasure(i + 1, j + 1, N, N) - tCnt[N][N];
				else 			// 2 사분면
					tCnt[i][j] = tCnt[N][j] - countTreasure(i + 1, 1, N, j);
			}
			else {
				if (j <= mid)	// 3 사분면
					tCnt[i][j] = tCnt[i][N] - countTreasure(1, j + 1, i, N);
				else 		// 4 사분면
					tCnt[i][j] = countTreasure(1, 1, i, j);
			}
		}
	}
	for (int i = 1; i <= N; i++) {
		for (int j = 1; j <= N; j++) {
			if (tCnt[i][j] + tCnt[i - 1][j - 1] - (tCnt[i][j - 1] + tCnt[i - 1][j]))
				Report(i, j);
		}
	}
}

Compilation message

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.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1220 KB Output is correct - N = 5, K = 289, score = 10
2 Correct 0 ms 1220 KB Output is correct - N = 10, K = 4475, score = 10
3 Correct 0 ms 1220 KB Output is correct - N = 15, K = 22289, score = 10
4 Correct 0 ms 1220 KB Output is correct - N = 16, K = 28928, score = 10
5 Correct 0 ms 1220 KB Output is correct - N = 55, K = 4005289, score = 10
6 Correct 0 ms 1220 KB Output is correct - N = 66, K = 8305803, score = 10
7 Correct 0 ms 1220 KB Output is correct - N = 77, K = 15383161, score = 10
8 Correct 0 ms 1220 KB Output is correct - N = 88, K = 26244416, score = 10
9 Correct 0 ms 1220 KB Output is correct - N = 99, K = 42032201, score = 10
10 Correct 0 ms 1220 KB Output is correct - N = 100, K = 43760000, score = 10