# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
475716 | soba | Treasure (different grader from official contest) (CEOI13_treasure2) | C++14 | 1 ms | 420 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"
#include <bits/stdc++.h>
void findTreasure (int N) {
int grid[N+1][N+1];
int prfx[N+1][N+1]={0};
int cnt , ans;
for(int i = 0 ; i<= N ; i++)
{
for(int j = 0 ; j<=N ;j++)
{
prfx[i][j]=0;
}
}
for(int i = 1 ; i <=N ; i++)
{
for(int j = 1 ; j <= N ; j++)
{
cnt=countTreasure(1,1,i,j);
prfx[i][j]=cnt;
grid[i][j]=prfx[i][j]-prfx[i-1][j]-prfx[i][j-1]+prfx[i-1][j-1];
}
}
for(int i = 1 ; i <= N ; i++ )
{
for(int j =1 ; j <= N ; j++)
{
if(grid[i][j]==1)
Report(i, j);
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |