# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
991005 | amirhoseinfar1385 | Selotejp (COCI20_selotejp) | C++17 | 18 ms | 504 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 namespace std;
const int maxn=10,maxm=1000;
int all[maxn][maxm],dp0[(1<<maxn)],dp1[(1<<maxn)],n,m;
void vorod(){
cin>>n>>m;
swap(n,m);
for(int j=0;j<m;j++){
for(int i=0;i<n;i++){
char c;
cin>>c;
if(c=='#'){
all[i][j]=1;
}else{
all[i][j]=0;
}
}
}
}
void solve(){
for(int i=0;i<(1<<n);i++){
for(int j=0;j<n;j++){
if(all[j][0]==0){
continue;
}
if((i>>j)&1){
dp0[i]++;
}else{
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |