# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
698679 | Cyanmond | L-triominoes (CEOI21_ltriominoes) | C++17 | 8053 ms | 524288 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>
using i64 = long long;
struct Point {
i64 x;
i64 y;
};
constexpr int N = 1 << 13;
int main() {
i64 W, H;
int K;
std::cin >> W >> H >> K;
std::vector<Point> points(K);
std::map<i64, int> mEx;
for (auto &[x, y] : points) {
std::cin >> x >> y;
--x;
--y;
mEx[y] |= 1 << x;
}
auto searchNext = [&](int s) {
static std::array<std::vector<int>, N> g;
static std::vector<int> seen(N);
if (seen[s]) {
return g[s];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |