# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
753921 | lohacho | L-triominoes (CEOI21_ltriominoes) | C++14 | 562 ms | 97836 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>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#define mi(x, y) (x = min(x, y))
#define ma(x, y) (x = max(x, y))
using namespace std;
const int NS = 13;
int way[(1 << NS) + 4][(1 << NS) + 4];
vector<int> vway[(1 << NS) + 4];
int dist[(1 << NS) + 4];
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int w, h, k;
cin >> w >> h >> k;
vector<pair<int, int>> a(k);
for(int i = 0; i < k; ++i){
cin >> a[i].first >> a[i].second;
swap(a[i].first, a[i].second);
--a[i].first, --a[i].second;
}
sort(a.begin(), a.end());
for(int i = 0; i < (1 << w); ++i){
auto dfs = [&](auto&&self, int x, int bt)->void{
int now = (i >> x & 1);
# | 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... |