#include "treasure.h"
//4분할을 하는 건 맞음 -> 1개짜리로 4개 보는것보다, 4개 한번, 2개 2번으로 해결 가능
//d = (a + b + c + d) - (a + b) - (a + c) + a
void findTreasure (int N) {
int arr[101][101];
for(int i = 1 ; i <= N ; i++){
for(int j = 1 ; j <= N ; j++){
arr[i][j] = countTreasure(1, 1, i, j);
}
}
for(int i = 1 ; i <= N ; i++){
for(int j = 1 ; j <= N ; j++){
if (arr[i][j] - arr[i-1][j] - arr[i][j-1] + arr[i-1][j-1]){
Report(i, j);
}
}
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
1 ms |
364 KB |
Output is partially correct - N = 5, K = 425, score = 8 |
2 |
Partially correct |
0 ms |
364 KB |
Output is partially correct - N = 10, K = 7075, score = 4 |
3 |
Partially correct |
0 ms |
364 KB |
Output is partially correct - N = 15, K = 36450, score = 4 |
4 |
Partially correct |
1 ms |
364 KB |
Output is partially correct - N = 16, K = 47296, score = 4 |
5 |
Partially correct |
1 ms |
384 KB |
Output is partially correct - N = 55, K = 6782050, score = 4 |
6 |
Partially correct |
1 ms |
364 KB |
Output is partially correct - N = 66, K = 14090571, score = 4 |
7 |
Partially correct |
1 ms |
364 KB |
Output is partially correct - N = 77, K = 26140961, score = 4 |
8 |
Partially correct |
1 ms |
364 KB |
Output is partially correct - N = 88, K = 44642224, score = 4 |
9 |
Incorrect |
1 ms |
364 KB |
Error - no treasure at (r, c) : r = 97, c = 1 |
10 |
Incorrect |
1 ms |
364 KB |
Error - no treasure at (r, c) : r = 91, c = 1 |