#include "treasure.h"
int M[105][105]; //누적합
void findTreasure(int N) {
int mid = N / 2;
for (int i = N; i >= 1; i--) {
for (int j = N; j >= 1; j--) {
if (i <= mid){
if (j <= mid){ //왼쪽 위
M[i][j] = M[i][N] + M[N][j] + countTreasure(i + 1, j + 1, N, N) - M[N][N];
}
else{ //오른쪽 위
M[i][j] = M[N][j] - countTreasure(i + 1, 1, N, j);
}
}
else{
if (j <= mid){ //왼쪽 아래
M[i][j] = M[i][N] - countTreasure(1, j + 1, i, N);
}
else{ //오른쪽 아래
M[i][j] = countTreasure(1, 1, i, j);
}
}
}
}
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
if (M[i][j] - M[i][j - 1] - M[i - 1][j] + M[i - 1][j - 1] == 1){
Report(i, j);
}
}
}
}
Compilation message
grader.c: In function 'int main()':
grader.c:63:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
my_assert(strlen(A[i]+1) == N, "each line of the map must contain N zeroes or ones (before loop)");
^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
248 KB |
Output is correct - N = 5, K = 289, score = 10 |
2 |
Correct |
1 ms |
352 KB |
Output is correct - N = 10, K = 4475, score = 10 |
3 |
Correct |
2 ms |
404 KB |
Output is correct - N = 15, K = 22289, score = 10 |
4 |
Correct |
1 ms |
404 KB |
Output is correct - N = 16, K = 28928, score = 10 |
5 |
Correct |
2 ms |
584 KB |
Output is correct - N = 55, K = 4005289, score = 10 |
6 |
Correct |
1 ms |
612 KB |
Output is correct - N = 66, K = 8305803, score = 10 |
7 |
Correct |
2 ms |
612 KB |
Output is correct - N = 77, K = 15383161, score = 10 |
8 |
Correct |
1 ms |
696 KB |
Output is correct - N = 88, K = 26244416, score = 10 |
9 |
Correct |
1 ms |
696 KB |
Output is correct - N = 99, K = 42032201, score = 10 |
10 |
Correct |
2 ms |
696 KB |
Output is correct - N = 100, K = 43760000, score = 10 |