# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
90646 | 314rate | Treasure (different grader from official contest) (CEOI13_treasure2) | C++14 | 2 ms | 660 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 ask(int r1,int c1,int r2,int c2)
{
return countTreasure(r1,c1,r2,c2);
}
int s[N][N];
int askk(int r,int c)
{
return s[r][c]-s[r-1][c]-s[r][c-1]+s[r-1][c-1];
}
int nn;
int co(int r1,int c1,int r2,int c2)
{
int a=(r2-r1+1)*(c2-c1+1);
return nn*nn+1-a;
}
void hack(int i,int j)
{
if(i>nn-i)
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |