#include "treasure.h"
#include <iostream>
#define MAP 101
int map[MAP][MAP];
void findTreasure(int N) {
for (int i = N; i > 0; i--) {
for (int j = N; j > 0; j--) {
if (i > N / 2 && j > N / 2) {
map[i][j] = countTreasure(1, 1, i, j);
}
else if (i > N / 2 && j <= N / 2) {
map[i][j] = map[i][N] - countTreasure(1, j + 1, i, N);
}
else if (i <= N / 2 && j > N / 2) {
map[i][j] = map[N][j] - countTreasure(i + 1, 1, N, j);
}
else if (i <= N / 2 && j <= N / 2) {
map[i][j] = map[N][j] + map[i][N] + countTreasure(i + 1, j + 1, N, N) - map[N][N];
}
}
}
for (int i = N; i > 0; i--) {
for (int j = N; j > 0; j--) {
int answer = map[i][j] - map[i - 1][j] - map[i][j - 1] + map[i - 1][j - 1];
if (answer == 1) {
Report(i, j);
}
}
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
384 KB |
Output is correct - N = 5, K = 289, score = 10 |
2 |
Correct |
4 ms |
384 KB |
Output is correct - N = 10, K = 4475, score = 10 |
3 |
Correct |
4 ms |
384 KB |
Output is correct - N = 15, K = 22289, score = 10 |
4 |
Correct |
5 ms |
384 KB |
Output is correct - N = 16, K = 28928, score = 10 |
5 |
Correct |
4 ms |
384 KB |
Output is correct - N = 55, K = 4005289, score = 10 |
6 |
Correct |
5 ms |
384 KB |
Output is correct - N = 66, K = 8305803, score = 10 |
7 |
Correct |
5 ms |
384 KB |
Output is correct - N = 77, K = 15383161, score = 10 |
8 |
Correct |
5 ms |
384 KB |
Output is correct - N = 88, K = 26244416, score = 10 |
9 |
Correct |
5 ms |
384 KB |
Output is correct - N = 99, K = 42032201, score = 10 |
10 |
Correct |
5 ms |
384 KB |
Output is correct - N = 100, K = 43760000, score = 10 |