# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
4574 | cki86201 | Treasure (different grader from official contest) (CEOI13_treasure2) | C++98 | 0 ms | 1228 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "treasure.h"
int T[105][105];
void solve(int x,int y,int N)
{
int m=N>>1;
if(x>m&&y>m)T[x][y]=countTreasure(1,1,x,y);
if(x>m&&y<=m)T[x][y]=T[x][N]-countTreasure(1,y+1,x,N);
if(x<=m&&y>m)T[x][y]=T[N][y]-countTreasure(x+1,1,N,y);
if(x<=m&&y<=m)T[x][y]=T[x][N]+T[N][y]+countTreasure(x+1,y+1,N,N)-T[N][N];
}
void findTreasure (int N) {
int i,j;
for(i=N;i;i--)for(j=N;j;j--)solve(i,j,N);
for(i=1;i<=N;i++)for(j=1;j<=N;j++)if(T[i][j]-T[i-1][j]-T[i][j-1]+T[i-1][j-1])Report(i,j);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |