# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
7030 | gs13068 | 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 a[101][101];
void findTreasure(int N)
{
int i,j,T;
for(i=N/2+1;i<=N;i++)for(j=N/2+1;j<=N;j++)a[i][j]=countTreasure(1,1,i,j);
for(i=1;i<=N/2;i++)for(j=N/2+1;j<=N;j++)a[i][j]=a[N][j]-countTreasure(i+1,1,N,j);
for(i=N/2+1;i<=N;i++)for(j=1;j<=N/2;j++)a[i][j]=a[i][N]-countTreasure(1,j+1,i,N);
for(i=1;i<=N/2;i++)for(j=1;j<=N/2;j++)a[i][j]=a[i][N]+a[N][j]+countTreasure(i+1,j+1,N,N)-a[N][N];
for(i=1;i<=N;i++)for(j=1;j<=N;j++)if(a[i][j]-a[i-1][j]-a[i][j-1]+a[i-1][j-1])Report(i,j);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |