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