# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
90640 | 314rate | Treasure (different grader from official contest) (CEOI13_treasure2) | C++14 | 0 ms | 0 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 r1,int c1,int r2,int c2)
{
return s[r2][c2]-s[r1-1][c2]-s[r2][c1]-1+s[r1-1][c1-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(v[i][j])
{
Report(i,j);
}
}
}
}