#include "treasure.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 100 + 7;
int s[4][N][N], s2[N][N];
bool deja = 0;
bool ok;
int n;
int get(int type, int r, int c)
{
if (type == 0)
{
if (r <= 0 || c <= 0)
{
return 0;
}
ok &= (s[type][r][c] != -1);
return s[type][r][c];
}
assert(0);
}
int what(int r, int c)
{
ok = 1;
int sm;
sm = get(0, r, c) - get(0, r - 1, c) - get(0, r, c - 1) + get(0, r - 1, c - 1);
if (ok)
{
return sm;
}
assert(0);
}
void findTreasure(int nn)
{
n = nn;
for (int k = 0; k < 4; k++)
{
for (int i = 0; i < N; i++)
{
for (int j = 0; j < N; j++)
{
s[k][i][j] = -1;
}
}
}
assert(deja == 0);
deja = 1;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
s[0][i][j] = countTreasure(1, 1, i, j);
}
}
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
if (what(i, j))
{
Report(i, j);
}
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Partially correct |
1 ms |
512 KB |
Output is partially correct - N = 5, K = 425, score = 8 |
2 |
Partially correct |
1 ms |
468 KB |
Output is partially correct - N = 10, K = 7075, score = 4 |
3 |
Partially correct |
1 ms |
468 KB |
Output is partially correct - N = 15, K = 36450, score = 4 |
4 |
Partially correct |
1 ms |
468 KB |
Output is partially correct - N = 16, K = 47296, score = 4 |
5 |
Partially correct |
1 ms |
468 KB |
Output is partially correct - N = 55, K = 6782050, score = 4 |
6 |
Partially correct |
1 ms |
468 KB |
Output is partially correct - N = 66, K = 14090571, score = 4 |
7 |
Partially correct |
1 ms |
468 KB |
Output is partially correct - N = 77, K = 26140961, score = 4 |
8 |
Partially correct |
1 ms |
468 KB |
Output is partially correct - N = 88, K = 44642224, score = 4 |
9 |
Partially correct |
1 ms |
468 KB |
Output is partially correct - N = 99, K = 71566902, score = 4 |
10 |
Partially correct |
1 ms |
468 KB |
Output is partially correct - N = 100, K = 74507500, score = 4 |