#include "treasure.h"
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif
int a[105][105];
void findTreasure(int n) {
int m = n / 2;
for (int i = n; i; --i) {
for (int j = n; j; --j) {
if (i <= m && j <= m) {
a[i][j] = a[n][j] + a[i][n] + a[n][n] - countTreasure(i + 1, j + 1, n, n);
} else if (i <= m && j > m) {
a[i][j] = a[n][j] - countTreasure(i + 1, 1, n, j);
} else if (j > m) {
a[i][j] = countTreasure(1, 1, i, j);
} else {
a[i][j] = a[i][n] - countTreasure(1, j + 1, i, 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);
}
}
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
344 KB |
Error - no treasure at (r, c) : r = 2, c = 1 |
2 |
Incorrect |
0 ms |
348 KB |
Error - no treasure at (r, c) : r = 1, c = 6 |
3 |
Incorrect |
0 ms |
348 KB |
Error - no treasure at (r, c) : r = 1, c = 1 |
4 |
Incorrect |
0 ms |
348 KB |
Error - no treasure at (r, c) : r = 1, c = 1 |
5 |
Incorrect |
0 ms |
348 KB |
Error - no treasure at (r, c) : r = 1, c = 3 |
6 |
Incorrect |
1 ms |
448 KB |
Error - no treasure at (r, c) : r = 1, c = 1 |
7 |
Incorrect |
0 ms |
348 KB |
Error - no treasure at (r, c) : r = 1, c = 1 |
8 |
Incorrect |
1 ms |
344 KB |
Error - no treasure at (r, c) : r = 8, c = 45 |
9 |
Incorrect |
0 ms |
348 KB |
Error - no treasure at (r, c) : r = 1, c = 2 |
10 |
Incorrect |
1 ms |
348 KB |
Error - no treasure at (r, c) : r = 1, c = 3 |