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