# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
11378 | dohyun0324 | Treasure (different grader from official contest) (CEOI13_treasure2) | C++98 | 0 ms | 1232 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[110][110];
void findTreasure (int N) {
int i,j;
for(i=N;i>=1;i--)
{
for(j=N;j>=1;j--)
{
if(i>N/2 && j>N/2) a[i][j]=countTreasure(1,1,i,j);
if(i<=N/2 && j>N/2) a[i][j]=a[N][j]-countTreasure(i+1,1,N,j);
if(i>N/2 && j<=N/2) a[i][j]=a[i][N]-countTreasure(1,j+1,i,N);
if(i<=N/2 && j<=N/2) a[i][j]=countTreasure(i+1,j+1,N,N)+a[i][N]+a[N][j]-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... |