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