oj.uz

답안 #42882

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
42882 2018-03-06T05:15:20 Z kinssang 보물 찾기 (CEOI13_treasure2) C++14
100 / 100
 2 ms 688 KB 
#include "treasure.h"

int temp[105][105];

void findTreasure(int N)
{
	for (int i = 1; i <= N; i++)
	{
		for (int j = 1; j <= N; j++) temp[i][j] = -1;
	}

	temp[N][N] = countTreasure(1, 1, N, N);

	for (int i = 1; i <= N / 2; i++)
	{
		if(temp[i][N] == -1) temp[i][N] = temp[N][N] - countTreasure(i + 1, 1, N, N);
		if(temp[N][i] == -1) temp[N][i] = temp[N][N] - countTreasure(1, i + 1, N, N);
	}
	for (int i = N / 2 + 1; i <= N; i++)
	{
		if(temp[i][N] == -1) temp[i][N] = countTreasure(1, 1, i, N);
		if(temp[N][i] == -1) temp[N][i] = countTreasure(1, 1, N, i);
	}
	for (int i = 1; i <= N; i++)
	{
		for (int j = 1; j <= N; j++)
		{
			if (temp[i][j] != -1) continue;
			
			int horizontal, vertical, rectangle;

			//2사분면
			if (i <= N / 2 && j <= N / 2)
			{
				horizontal = temp[N][N] - temp[i][N];
				vertical = temp[N][N] - temp[N][j];
				rectangle = countTreasure(i + 1, j + 1, N, N);
				temp[i][j] = temp[N][N] - horizontal - vertical + rectangle;
			}
			//1사분면
			else if (i <= N / 2 && j > N / 2) temp[i][j] = temp[N][j] - countTreasure(i + 1, 1, N, j);
			//3사분면
			else if (i > N / 2 && j <= N / 2) temp[i][j] = temp[i][N] - countTreasure(1, j + 1, i, N);
			//4사분면
			else temp[i][j] = countTreasure(1, 1, i, j);
		}
	}

	for (int i = 1; i <= N; i++)
	{
		for (int j = 1; j <= N; j++)
		{
			if (temp[i][j] - temp[i - 1][j] - temp[i][j - 1] + temp[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 352 KB Output is correct - N = 10, K = 4475, score = 10
3 Correct 1 ms 552 KB Output is correct - N = 15, K = 22289, score = 10
4 Correct 1 ms 552 KB Output is correct - N = 16, K = 28928, score = 10
5 Correct 1 ms 552 KB Output is correct - N = 55, K = 4005289, score = 10
6 Correct 2 ms 552 KB Output is correct - N = 66, K = 8305803, score = 10
7 Correct 1 ms 552 KB Output is correct - N = 77, K = 15383161, score = 10
8 Correct 2 ms 556 KB Output is correct - N = 88, K = 26244416, score = 10
9 Correct 2 ms 688 KB Output is correct - N = 99, K = 42032201, score = 10
10 Correct 2 ms 688 KB Output is correct - N = 100, K = 43760000, score = 10