#include "treasure.h"
#include <bits/stdc++.h>
using namespace std;
const int MAX = 111;
int val[MAX][MAX];
void findTreasure(int N) {
int total = countTreasure(1, 1, N, N);
int mid = N / 2;
for (int i = N; i >= 1; i--) {
for (int j = N; j >= 1; j--) {
if (i >= mid && j >= mid) {
val[i][j] = countTreasure(1, 1, i, j);
} else if (i >= mid && j < mid) {
val[i][j] = val[i][N] - countTreasure(1, j + 1, i, N);
} else if (i < mid && j >= mid) {
val[i][j] = val[N][j] - countTreasure(i + 1, 1, N, j);
} else {
val[i][j] = -(total - val[i][N] - val[N][j] - countTreasure(i + 1, j + 1, N, N));
}
}
}
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
int c = val[i][j] - val[i - 1][j] - val[i][j - 1] + val[i - 1][j - 1];
if (c == 1) {
Report(i, j);
}
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Partially correct |
0 ms |
348 KB |
Output is partially correct - N = 5, K = 327, score = 8 |
2 |
Partially correct |
0 ms |
348 KB |
Output is partially correct - N = 10, K = 4476, score = 8 |
3 |
Partially correct |
1 ms |
348 KB |
Output is partially correct - N = 15, K = 22627, score = 8 |
4 |
Partially correct |
0 ms |
348 KB |
Output is partially correct - N = 16, K = 28929, score = 8 |
5 |
Partially correct |
1 ms |
348 KB |
Output is partially correct - N = 55, K = 4009827, score = 8 |
6 |
Partially correct |
0 ms |
348 KB |
Output is partially correct - N = 66, K = 8305804, score = 8 |
7 |
Partially correct |
0 ms |
348 KB |
Output is partially correct - N = 77, K = 15392055, score = 8 |
8 |
Partially correct |
0 ms |
348 KB |
Output is partially correct - N = 88, K = 26244417, score = 8 |
9 |
Partially correct |
0 ms |
348 KB |
Output is partially correct - N = 99, K = 42046903, score = 8 |
10 |
Partially correct |
0 ms |
348 KB |
Output is partially correct - N = 100, K = 43760001, score = 8 |