# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
827080 | Alora | Selotejp (COCI20_selotejp) | C++17 | 29 ms | 356 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>
#define name "cownav"
#define fi(i,a,b) for(int i = a; i <= b; i++)
#define fid(i,a,b) for(int i = a; i >= b; i--)
#define ll long long
#define f first
#define se second
#define pii pair<int, int>
#define getbit(i, j) ((i >> j) & 1)
#define pb push_back
#define all(v) v.begin(), v.end()
#define maxn 255
const int M = 1e9 + 7;
using namespace std;
int m, n, full, pre[1 << 10], dp[1 << 10];
char s[1003][11];
void sol(){
full = (1 << m) - 1;
memset(pre, 0x3f, sizeof(pre));
pre[0] = 0;
fi(j, 0, n - 1){
fi(i, 0, m - 1){
fi(tt, 0, full){
// if i-th bit of tt = 0 -> cell(j, i) is shut by a horizontal tape
// if i-th bit of tt = 1 -> cell(j, i) is shut by a vertical tape
if(s[j][i] == '.'){
if(getbit(tt, i)) dp[tt] = 1e9;
else dp[tt] = min(pre[tt], pre[tt^(1 << i)]);
continue;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |