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