oj.uz

답안 #107101

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
107101 2019-04-22T01:24:52 Z luciocf 보물 찾기 (CEOI13_treasure2) C++14
100 / 100
 3 ms 512 KB 
#include <bits/stdc++.h>
#include "treasure.h"

const int maxn = 110;

int pref[maxn][maxn];

void findTreasure(int N) 
{
	for (int i = N; i >= 1; i--)
	{
		for (int j = N; j >= 1; j--)
		{
			if (i > N/2 && j > N/2)
				pref[i][j] = countTreasure(1, 1, i, j);
			else if (i > N/2 && j <= N/2)
				pref[i][j] = pref[i][N] - countTreasure(1, j+1, i, N);
			else if (i <= N/2 && j <= N/2)
				pref[i][j] = pref[i][N] + pref[N][j] + countTreasure(i+1, j+1, N, N) - pref[N][N];
			else
				pref[i][j] = pref[N][j] - countTreasure(i+1, 1, N, j);
		}
	}

	for (int i = 1; i <= N; i++)
		for (int j = 1; j <= N; j++)
			if (pref[i][j]-pref[i-1][j]-pref[i][j-1]+pref[i-1][j-1] == 1)
				Report(i, j);
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct - N = 5, K = 289, score = 10
2 Correct 2 ms 384 KB Output is correct - N = 10, K = 4475, score = 10
3 Correct 2 ms 384 KB Output is correct - N = 15, K = 22289, score = 10
4 Correct 2 ms 384 KB Output is correct - N = 16, K = 28928, score = 10
5 Correct 2 ms 384 KB Output is correct - N = 55, K = 4005289, score = 10
6 Correct 2 ms 384 KB Output is correct - N = 66, K = 8305803, score = 10
7 Correct 3 ms 384 KB Output is correct - N = 77, K = 15383161, score = 10
8 Correct 2 ms 384 KB Output is correct - N = 88, K = 26244416, score = 10
9 Correct 2 ms 384 KB Output is correct - N = 99, K = 42032201, score = 10
10 Correct 2 ms 512 KB Output is correct - N = 100, K = 43760000, score = 10