# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
5757 | baneling100 | Treasure (different grader from official contest) (CEOI13_treasure2) | C++98 | 0 ms | 1224 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 D[101][101];
void findTreasure(int N)
{
int i, j, mid=N/2;
for(i=N ; i>=1 ; i--)
for(j=N ; j>=1 ; j--)
{
if(i<=mid)
{
if(j<=mid)
D[i][j]=D[i][N]+D[N][j]+countTreasure(i+1,j+1,N,N)-D[N][N];
else
D[i][j]=D[N][j]-countTreasure(i+1,1,N,j);
}
else
{
if(j<=mid)
D[i][j]=D[i][N]-countTreasure(1,j+1,i,N);
else
D[i][j]=countTreasure(1,1,i,j);
}
}
for(i=1 ; i<=N ; i++)
for(j=1 ; j<=N ; j++)
if(D[i][j]-D[i-1][j]-D[i][j-1]+D[i-1][j-1])
Report(i,j);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |