# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
667883 | 600Mihnea | Treasure (different grader from official contest) (CEOI13_treasure2) | C++17 | 1 ms | 340 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 + 7;
int s[N][N];
bool deja = 0;
int get(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)
{
assert(deja == 0);
deja = 1;
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 (get(i, j, i, j))
{
Report(i, j);
}
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |