oj.uz

답안 #41092

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
41092 2018-02-12T15:36:43 Z tkqlzz 보물 찾기 (CEOI13_treasure2) C++14
100 / 100
 2 ms 600 KB 
#include "treasure.h"
#define MAX(A, B) ((A) > (B) ? (A) : (B))

int sum[101][101];

void findTreasure (int N) {
	int i, j;
	i = j = N / 2;

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

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

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

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


	if (sum[1][1] == 1)
		Report(1, 1);

	for (int i = 2; i <= N; i++) {
		if (sum[i][1] - sum[i - 1][1] == 1)
			Report(i, 1);
		if (sum[1][i] - sum[1][i - 1] == 1)
			Report(1, i);
	}

	for (int i = 2; i <= N; i++)
		for (int j = 2; j <= N; j++)
			if (sum[i][j] - sum[i - 1][j] - sum[i][j - 1] + sum[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)");
                                  ^
treasure.cpp: In function 'void findTreasure(int)':
treasure.cpp:7:6: warning: variable 'i' set but not used [-Wunused-but-set-variable]
  int i, j;
      ^

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 352 KB Output is correct - N = 10, K = 4475, score = 10
3 Correct 2 ms 404 KB Output is correct - N = 15, K = 22289, score = 10
4 Correct 1 ms 476 KB Output is correct - N = 16, K = 28928, score = 10
5 Correct 1 ms 476 KB Output is correct - N = 55, K = 4005289, score = 10
6 Correct 1 ms 524 KB Output is correct - N = 66, K = 8305803, score = 10
7 Correct 2 ms 528 KB Output is correct - N = 77, K = 15383161, score = 10
8 Correct 1 ms 584 KB Output is correct - N = 88, K = 26244416, score = 10
9 Correct 1 ms 584 KB Output is correct - N = 99, K = 42032201, score = 10
10 Correct 2 ms 600 KB Output is correct - N = 100, K = 43760000, score = 10