oj.uz

답안 #40823

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
40823 2018-02-08T13:32:21 Z esspks21 보물 찾기 (CEOI13_treasure2) C++14
100 / 100
 2 ms 716 KB 
#include "treasure.h"
int psum[101][101];
void findTreasure(int N) {
	for (int i = N; i > N / 2; i--)
		for (int j = N; j > N / 2; j--)
			psum[i][j] = countTreasure(1, 1, i, j);

	for (int i = 1; i <= N / 2; i++)
		for (int j = N / 2 + 1; j <= N; j++)
			psum[i][j] = psum[N][j] - countTreasure(i+1, 1, N, j);

	for (int i = N / 2 + 1; i <= N; i++)
		for (int j = 1; j <= N / 2; j++)
			psum[i][j] = psum[i][N] - countTreasure(1, j+1, i, N);

	for (int i = 1; i <= N / 2; i++)
		for (int j = 1; j <= N / 2; j++)
			psum[i][j] = psum[i][N] + psum[N][j] - psum[N][N] + countTreasure(i+1, j+1, N, N);

	for (int i = 1; i <= N; i++)
		for (int j = 1; j <= N; j++)
			if (psum[i][j] - psum[i - 1][j] - psum[i][j - 1] + psum[i - 1][j - 1] == 1)
				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 1 ms 248 KB Output is correct - N = 5, K = 289, score = 10
2 Correct 1 ms 356 KB Output is correct - N = 10, K = 4475, score = 10
3 Correct 1 ms 404 KB Output is correct - N = 15, K = 22289, score = 10
4 Correct 1 ms 524 KB Output is correct - N = 16, K = 28928, score = 10
5 Correct 1 ms 576 KB Output is correct - N = 55, K = 4005289, score = 10
6 Correct 1 ms 576 KB Output is correct - N = 66, K = 8305803, score = 10
7 Correct 2 ms 576 KB Output is correct - N = 77, K = 15383161, score = 10
8 Correct 2 ms 660 KB Output is correct - N = 88, K = 26244416, score = 10
9 Correct 2 ms 716 KB Output is correct - N = 99, K = 42032201, score = 10
10 Correct 2 ms 716 KB Output is correct - N = 100, K = 43760000, score = 10