Submission #42882

#	Time	Username	Problem	Language	Result	Execution time	Memory
42882		kinssang	Treasure (different grader from official contest) (CEOI13_treasure2)	C++14	100 / 100	2 ms	688 KiB

treasure

#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 (stderr)

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 / 100