#include "treasure.h"
#include <bits/stdc++.h>
using namespace std;
const int MAX = 105;
int a[MAX][MAX];
void findTreasure(int n) {
int mid = (n / 2);
for (int i = mid + 1; i <= n; ++i) {
for (int j = mid + 1; j <= n; ++j) {
a[i][j] = countTreasure(1, 1, i, j);
}
}
for (int i = mid + 1; i <= n; ++i) {
for (int j = 1; j <= mid; ++j) {
a[i][j] = a[i][n] - countTreasure(1, j + 1, i, n);
}
}
for (int i = 1; i <= mid; ++i) {
for (int j = mid + 1; j <= n; ++j) {
a[i][j] = a[n][j] - countTreasure(i + 1, 1, n, j);
}
}
for (int i = 1; i <= mid; ++i) {
for (int j = 1; j <= mid; ++j) {
a[i][j] = (a[i][n] + a[n][j] + countTreasure(i + 1, j + 1, n, n)) - a[n][n];
}
}
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
if (a[i][j] - a[i - 1][j] - a[i][j - 1] + a[i - 1][j - 1]) {
Report(i, j);
}
}
}
}
Compilation message
grader.c: In function 'int main()':
grader.c:63:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
my_assert(strlen(A[i]+1) == N, "each line of the map must contain N zeroes or ones (before loop)");
^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
2128 KB |
Output is correct - N = 5, K = 289, score = 10 |
2 |
Correct |
0 ms |
2128 KB |
Output is correct - N = 10, K = 4475, score = 10 |
3 |
Correct |
0 ms |
2128 KB |
Output is correct - N = 15, K = 22289, score = 10 |
4 |
Correct |
0 ms |
2128 KB |
Output is correct - N = 16, K = 28928, score = 10 |
5 |
Correct |
0 ms |
2128 KB |
Output is correct - N = 55, K = 4005289, score = 10 |
6 |
Correct |
0 ms |
2128 KB |
Output is correct - N = 66, K = 8305803, score = 10 |
7 |
Correct |
0 ms |
2128 KB |
Output is correct - N = 77, K = 15383161, score = 10 |
8 |
Correct |
0 ms |
2128 KB |
Output is correct - N = 88, K = 26244416, score = 10 |
9 |
Correct |
0 ms |
2128 KB |
Output is correct - N = 99, K = 42032201, score = 10 |
10 |
Correct |
0 ms |
2128 KB |
Output is correct - N = 100, K = 43760000, score = 10 |