| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 78590 | stefdasca | Treasure (different grader from official contest) (CEOI13_treasure2) | C++14 | 3 ms | 744 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<bits/stdc++.h>
#include "treasure.h"
using namespace std;
int gg[102][102];
void findTreasure(int N)
{
for(int i = 1; i <= N; ++i)
for(int j = 1; j <= N; ++j)
gg[i][j] = countTreasure(i, j, N, N);
for(int i = N; i >= 1; --i)
for(int j = N; j >= 1; --j)
if(gg[i][j] > gg[i+1][j] + gg[i][j+1] - gg[i+1][j+1])
Report(i, j);
return;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||