oj.uz

답안 #23599

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
23599 2017-05-13T12:24:53 Z 0xrgb 보물 찾기 (CEOI13_treasure2) C++14
44 / 100
 0 ms 1224 KB 
#include "treasure.h"

const int MAXN = 104;
int ans[MAXN][MAXN];

void findTreasure (int N) {
    for (int i = 1; i <= N; ++i) {
    	for (int j = 1; j <= N; ++j) {
    		ans[i][j] = countTreasure(1, 1, i, j);
    	}
    }

    for (int i = 1; i <= N; ++i) {
    	for (int j = 1; j <= N; ++j) {
    		const int p = ans[i][j]\
    			- ans[i - 1][j]\
    			- ans[i][j - 1]\
    			+ ans[i - 1][j - 1];
    		if (p == 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
44.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 1224 KB Output is partially correct - N = 5, K = 425, score = 8
2 Partially correct 0 ms 1224 KB Output is partially correct - N = 10, K = 7075, score = 4
3 Partially correct 0 ms 1224 KB Output is partially correct - N = 15, K = 36450, score = 4
4 Partially correct 0 ms 1224 KB Output is partially correct - N = 16, K = 47296, score = 4
5 Partially correct 0 ms 1224 KB Output is partially correct - N = 55, K = 6782050, score = 4
6 Partially correct 0 ms 1224 KB Output is partially correct - N = 66, K = 14090571, score = 4
7 Partially correct 0 ms 1224 KB Output is partially correct - N = 77, K = 26140961, score = 4
8 Partially correct 0 ms 1224 KB Output is partially correct - N = 88, K = 44642224, score = 4
9 Partially correct 0 ms 1224 KB Output is partially correct - N = 99, K = 71566902, score = 4
10 Partially correct 0 ms 1224 KB Output is partially correct - N = 100, K = 74507500, score = 4