# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
116265 | emilem | Treasure (different grader from official contest) (CEOI13_treasure2) | C++14 | 3 ms | 384 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 <vector>
inline int CountTreasures(size_t minI, size_t maxI, size_t minJ, size_t maxJ)
{
return countTreasure(minI + 1, minJ + 1, maxI + 1, maxJ + 1);
}
void findTreasure(int n)
{
std::vector< std::vector<int> > sumToClosestCorner(n, std::vector<int>(n));
for (size_t i = 0; i < n; ++i)
for (size_t j = 0; j < n; ++j)
{
int minI, maxI, minJ, maxJ;
if (i >= n - i + 1) { minI = 0; maxI = i; }
else { minI = i; maxI = n - 1; }
if (j >= n - j + 1) { minJ = 0; maxJ = j; }
else { minJ = j; maxJ = n - 1; }
sumToClosestCorner[i][j] = CountTreasures(minI, maxI, minJ, maxJ);
}
for (size_t i = 0; i < n; ++i)
for (size_t j = 0; j < n; ++j)
{
int iDir, jDir;
iDir = (i >= n - i + 1) ? -1 : 1;
jDir = (j >= n - j + 1) ? -1 : 1;
int cur = sumToClosestCorner[i][j];
if (i + iDir >= 0 && i + iDir < n)
cur -= sumToClosestCorner[i + iDir][j];
if (j + jDir >= 0 && j + jDir < n)
cur -= sumToClosestCorner[i][j + jDir];
if (i + iDir >= 0 && i + iDir < n && j + jDir >= 0 && j + jDir < n)
cur += sumToClosestCorner[i + iDir][j + jDir];
if (cur)
Report(i + 1, j + 1);
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |