oj.uz

Submission #129919

# Submission time Handle Problem Language Result Execution time Memory
129919 2019-07-13T14:33:24 Z ygh0410 Treasure (different grader from official contest) (CEOI13_treasure2) C++11
100 / 100
 2 ms 376 KB 
#include "treasure.h"
#include <cstdio>	

int map[105][105];

void check(int r, int c, int N)
{
	int m = N / 2;
	if (r > m && c > m) map[r][c] = countTreasure(1, 1, r, c);
	if (r > m && c <= m)map[r][c] = map[r][N] - countTreasure(1, c + 1, r, N);
	if (r <= m && c > m) map[r][c] = map[N][c] - countTreasure(r + 1, 1, N, c);
	if (r <= m && c <= m) map[r][c] = map[r][N] + map[N][c] + countTreasure(r + 1, c + 1, N, N) - map[N][N];
}



void findTreasure(int N) {
	for (int i = 0; i <= N; i++) {
		map[0][i] = map[i][0] = 0;
	}


	for (int i = N; i >=1; i--) {
		for (int j = N; j >=1; j--) {
			check(i, j, N);
		}
	}
	

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


}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct - N = 5, K = 289, score = 10
2 Correct 2 ms 256 KB Output is correct - N = 10, K = 4475, score = 10
3 Correct 2 ms 376 KB Output is correct - N = 15, K = 22289, score = 10
4 Correct 2 ms 376 KB Output is correct - N = 16, K = 28928, score = 10
5 Correct 2 ms 376 KB Output is correct - N = 55, K = 4005289, score = 10
6 Correct 2 ms 376 KB Output is correct - N = 66, K = 8305803, score = 10
7 Correct 2 ms 376 KB Output is correct - N = 77, K = 15383161, score = 10
8 Correct 2 ms 376 KB Output is correct - N = 88, K = 26244416, score = 10
9 Correct 2 ms 376 KB Output is correct - N = 99, K = 42032201, score = 10
10 Correct 2 ms 376 KB Output is correct - N = 100, K = 43760000, score = 10