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