#include <bits/stdc++.h>
#include "treasure.h"
#define DIM 110
#define mp make_pair
using namespace std;
int a[DIM][DIM],sp[DIM][DIM];
map <pair<pair<int,int>,pair<int,int> >, int > f;
int n,i,j;
int query (int x, int y, int x2, int y2){
if (f[mp(mp(x,y),mp(x2,y2))])
return f[mp(mp(x,y),mp(x2,y2))];
int val = countTreasure(x,y,x2,y2);
f[mp(mp(x,y),mp(x2,y2))] = val;
return val;
}
int get_sum (int x, int y, int x2, int y2, int tip, int n){
if (tip == 1)
return query (x,y,n,n) - query (x,y+1,n,n);
return query (x,y,n,n) - query (x2+1,y,n,n);
}
void findTreasure (int n) {
for (int i=n/2+1;i<=n;i++)
for (int j=n/2+1;j<=n;j++)
sp[i][j] = query(1,1,i,j);
for (int i=n/2+1;i<=n;i++)
for (int j=1;j<=n/2;j++)
sp[i][j] = query (1,1,i,n) - query (1,j+1,i,n);
for (int i=1;i<=n/2;i++)
for (int j=n/2+1;j<=n;j++)
sp[i][j] = query (1,1,n,j) - query (i+1,1,n,j);
for (int i=1;i<=n/2;i++)
for (int j=1;j<=n/2;j++)
query (i+1,j+1,n,n);
for (int i=1;i<=n/2;i++)
for (int j=1;j<=n/2;j++)
sp[i][j] = query (1,1,n,n) - query (i+1,j+1,n,n) - get_sum(i,1,n,j,1,n) - get_sum(1,j+1,i,n,2,n);
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
a[i][j] = sp[i][j] - sp[i-1][j] - sp[i][j-1] + sp[i-1][j-1];
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
if (a[i][j])
Report (i,j);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
Error - no treasure at (r, c) : r = 2, c = 1 |
2 |
Incorrect |
1 ms |
332 KB |
Error - no treasure at (r, c) : r = 1, c = 6 |
3 |
Incorrect |
1 ms |
332 KB |
Error - no treasure at (r, c) : r = 1, c = 2 |
4 |
Incorrect |
1 ms |
332 KB |
Error - no treasure at (r, c) : r = 2, c = 9 |
5 |
Incorrect |
2 ms |
460 KB |
Error - no treasure at (r, c) : r = 1, c = 3 |
6 |
Incorrect |
3 ms |
588 KB |
Error - no treasure at (r, c) : r = 1, c = 2 |
7 |
Incorrect |
4 ms |
716 KB |
Error - no treasure at (r, c) : r = 1, c = 2 |
8 |
Incorrect |
6 ms |
844 KB |
Error - no treasure at (r, c) : r = 8, c = 45 |
9 |
Incorrect |
7 ms |
1008 KB |
Error - no treasure at (r, c) : r = 1, c = 2 |
10 |
Incorrect |
7 ms |
972 KB |
Error - no treasure at (r, c) : r = 1, c = 3 |