#include "treasure.h"
using namespace std;
/*
int countTreasure(int r1, int c1, int r2, int c2);
void Report(int r, int c);
*/
int nums[110][110] = {};
void findTreasure(int N){
int half = N / 2;
for(int i = N;i > 0;i--){
for(int j = N;j > 0;j--){
if(i > half && j > half){
nums[i][j] = countTreasure(1, 1, i, j);
}
else if(i > half && j <= half){
nums[i][j] = nums[i][N] - countTreasure(1, j + 1, i, N);
}
else if(i <= half && j > half){
nums[i][j] = nums[N][j] - countTreasure(i + 1, 1, N, j);
}
else{
nums[i][j] = nums[i][N] + nums[N][j] + countTreasure(i + 1, j + 1, N, N) - nums[N][N];
}
}
}
for(int i = 1;i < N + 1;i++){
for(int j = 1;j < N + 1;j++){
if(nums[i][j] - nums[i - 1][j] - nums[i][j - 1] + nums[i - 1][j - 1]){
Report(i, j);
}
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct - N = 5, K = 289, score = 10 |
2 |
Correct |
1 ms |
284 KB |
Output is correct - N = 10, K = 4475, score = 10 |
3 |
Correct |
1 ms |
212 KB |
Output is correct - N = 15, K = 22289, score = 10 |
4 |
Correct |
0 ms |
212 KB |
Output is correct - N = 16, K = 28928, score = 10 |
5 |
Correct |
0 ms |
340 KB |
Output is correct - N = 55, K = 4005289, score = 10 |
6 |
Correct |
1 ms |
292 KB |
Output is correct - N = 66, K = 8305803, score = 10 |
7 |
Correct |
0 ms |
340 KB |
Output is correct - N = 77, K = 15383161, score = 10 |
8 |
Correct |
1 ms |
340 KB |
Output is correct - N = 88, K = 26244416, score = 10 |
9 |
Correct |
1 ms |
340 KB |
Output is correct - N = 99, K = 42032201, score = 10 |
10 |
Correct |
1 ms |
292 KB |
Output is correct - N = 100, K = 43760000, score = 10 |