# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
116259 | emilem | 보물 찾기 (CEOI13_treasure2) | C++14 | 7 ms | 408 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>
void findTreasure(int n)
{
std::vector<int> rowPref(n + 1);
for (int i = n; i >= 1; --i)
if (i >= n - i)
rowPref[i] = countTreasure(1, 1, i, n);
else
rowPref[i] = rowPref[n] - countTreasure(i + 1, 1, n, n);
std::vector< std::vector<int> > pref(n + 1, std::vector<int>(n + 1, 0));
for (size_t i = 1; i <= n; ++i)
for (size_t j = 1; j <= n; ++j)
if (j >= n - j)
pref[i][j] = countTreasure(1, 1, i, j);
else
pref[i][j] = rowPref[i] - countTreasure(1, j + 1, i, n);
for (size_t i = 1; i <= n; ++i)
for (size_t j = 1; j <= n; ++j)
if (pref[i][j] - pref[i - 1][j] - pref[i][j - 1] + pref[i - 1][j - 1])
Report(i, j);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |