#include "treasure.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MAXN 105
#define FOR(i, a, b) for(ll i = a; i <= b; i++)
ll pfx[MAXN][MAXN];
void findTreasure (int N) {
ll m = N / 2;
for(ll i = N; i >= 1; i--){
for(ll j = N; j >= 1; j--){
if(i >= m & j >= m) {
pfx[i][j] = countTreasure(1, 1, N, N);
} else if(i >= m && j < m){
pfx[i][j] = pfx[i][N] - countTreasure(1, j + 1, i, N);
} else if(i < m && j >= m){
pfx[i][j] = pfx[N][j] = countTreasure(i + 1, 1, N, j);
} else if(i < m && j < m){
pfx[i][j] = pfx[N][j] + pfx[i][N] - (pfx[N][N] - countTreasure(i + 1, j + 1, N, N));
}
}
}
FOR(i, 1, N){
FOR(j, 1, N){
if(pfx[i][j] - pfx[i - 1][j] - pfx[i][j - 1] + pfx[i - 1][j - 1]){
Report(i, j);
}
}
}
}
Compilation message
treasure.cpp: In function 'void findTreasure(int)':
treasure.cpp:14:18: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
14 | if(i >= m & j >= m) {
| ~~^~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Error - no treasure at (r, c) : r = 1, c = 5 |
2 |
Incorrect |
1 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 = 29 |
6 |
Incorrect |
0 ms |
440 KB |
Error - no treasure at (r, c) : r = 1, c = 1 |
7 |
Incorrect |
0 ms |
604 KB |
Error - no treasure at (r, c) : r = 1, c = 1 |
8 |
Incorrect |
0 ms |
348 KB |
Error - no treasure at (r, c) : r = 1, c = 72 |
9 |
Incorrect |
0 ms |
348 KB |
Error - no treasure at (r, c) : r = 1, c = 49 |
10 |
Incorrect |
0 ms |
452 KB |
Error - no treasure at (r, c) : r = 1, c = 50 |