oj.uz

Submission #39447

# Submission time Handle Problem Language Result Execution time Memory
39447 2018-01-15T08:25:55 Z ykmyou Treasure (different grader from official contest) (CEOI13_treasure2) C++14
0 / 100
 0 ms 1220 KB 
#include "treasure.h"

int tCnt[102][102];// (i, j) ~ (N, N) 합
void findTreasure (int N) {
	int mid = N / 2;
	for (int i = 1; i <= N; i++) {
		for (int j = 1; j <= N; j++) {
			if (i <= mid) {
				if (j <= mid)	// 1 사분면
					tCnt[i][j] = countTreasure(i, j, N, N);
				else 			// 2 사분면
					tCnt[i][j] = tCnt[i][1] - countTreasure(i, 1, N, j - 1);
			}
			else {
				if (j <= mid)	// 3 사분면
					tCnt[i][j] = tCnt[1][j] - countTreasure(1, j, i - 1, N);
				else 		// 4 사분면
					tCnt[i][j] = (tCnt[1][j] + tCnt[i][1]) - (tCnt[1][1] + countTreasure(1, 1, i - 1, j - 1));
			}
		}
	}
	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
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 1220 KB Invalid Access
2 Incorrect 0 ms 1220 KB Invalid Access
3 Incorrect 0 ms 1220 KB Invalid Access
4 Incorrect 0 ms 1220 KB Invalid Access
5 Incorrect 0 ms 1220 KB Invalid Access
6 Incorrect 0 ms 1220 KB Invalid Access
7 Incorrect 0 ms 1220 KB Invalid Access
8 Incorrect 0 ms 1220 KB Invalid Access
9 Incorrect 0 ms 1220 KB Invalid Access
10 Incorrect 0 ms 1220 KB Invalid Access