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