#include<iostream>
#include "treasure.h"
using namespace std;
static int a[105][105];
void findTreasure (int n) {
int i, j, val;
for(i = n / 2 + 1; i <= n; i++){
for(j = n / 2 + 1; j <= n; j++){
a[i][j] = countTreasure(1, 1, i, j);
}
for(j = 1; j <= n / 2; j++){
a[i][j] = a[i][n] - countTreasure(1, j + 1, i, n);
}
}
for(i = n / 2; i >= 1; i--){
for(j = n / 2 + 1; j <= n; j++){
a[i][j] = a[n][j] - countTreasure(i + 1, 1, n, j);
}
for(j = n / 2; j >= 1; j--){
a[i][j] = a[i][n] + a[n][j] + countTreasure(i + 1, j + 1, n, n) - a[n][n];
}
}
for(i = 1; i <= n; i++){
for(j = 1; j <= n; j++){
val = a[i][j] - a[i - 1][j] - a[i][j - 1] + a[i - 1][j - 1];
if(val == 1){
Report(i, j);
}
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
376 KB |
Output is correct - N = 5, K = 289, score = 10 |
2 |
Correct |
5 ms |
376 KB |
Output is correct - N = 10, K = 4475, score = 10 |
3 |
Correct |
5 ms |
376 KB |
Output is correct - N = 15, K = 22289, score = 10 |
4 |
Correct |
5 ms |
376 KB |
Output is correct - N = 16, K = 28928, score = 10 |
5 |
Correct |
6 ms |
376 KB |
Output is correct - N = 55, K = 4005289, score = 10 |
6 |
Correct |
6 ms |
376 KB |
Output is correct - N = 66, K = 8305803, score = 10 |
7 |
Correct |
6 ms |
376 KB |
Output is correct - N = 77, K = 15383161, score = 10 |
8 |
Correct |
5 ms |
552 KB |
Output is correct - N = 88, K = 26244416, score = 10 |
9 |
Correct |
6 ms |
380 KB |
Output is correct - N = 99, K = 42032201, score = 10 |
10 |
Correct |
5 ms |
504 KB |
Output is correct - N = 100, K = 43760000, score = 10 |