# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
590800 | alextodoran | L-triominoes (CEOI21_ltriominoes) | C++17 | 1136 ms | 133120 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.
/**
____ ____ ____ ____ ____
||a |||t |||o |||d |||o ||
||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|
**/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int W_MAX = 13;
const int K_MAX = 250;
const int D_MAX = 15;
int W, H, K;
map <int, vector <int>> rows;
bool adj[1 << W_MAX][1 << W_MAX];
vector <int> out[1 << W_MAX];
bool check (int u, int v) {
int carry = 0;
for (int y = 0; y < W; y++) {
int cnt = ((u >> y) & 1) + !((v >> y) & 1) - carry;
if (cnt < 0) {
return false;
# | 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... |