# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
90642 | 314rate | Treasure (different grader from official contest) (CEOI13_treasure2) | C++14 | 2 ms | 804 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>
using namespace std;
const int N=100+5;
int n;
int s[N][N];
int ask(int i,int j)
{
return s[i][j]-s[i-1][j]-s[i][j-1]+s[i-1][j-1];
}
/**
*
**/
void findTreasure(int N)
{
int n=N;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
s[i][j]=countTreasure(1,1,i,j);
}
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
if(ask(i,j))
{
Report(i,j);
}
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |