BOJ_algorithm/1014.cpp at master · WHO-A-U/BOJ_algorithm · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
#include <bits/stdc++.h>
#define INF 0x3f3f3f3f
#define ft first
#define sd second
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vb = vector<bool>;
using vs = vector<string>;
using vd = vector<double>;
using vll = vector<ll>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vvi = vector<vi>;
using vvb = vector<vb>;
using vvll = vector<vll>;
using vvpii = vector<vpii>;
using vvpll = vector<vpll>;
using vvs = vector<vs>;

int d[1025][11];
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int t,n,m;
    cin>>t;
    while(t--){
        cin>>n>>m;
        memset(d,0,sizeof(d));

        string s;
        for(int i=1;i<=n;i++){
            cin>>s;
            for(int j=0;j<(1<<m);j++){

                bool flag=true;
                for(int k=0;k<m;k++){
                    if(j&(1<<k)){
                        if(s[k]=='x'){
                            flag=false;
                            break;
                        }
                    }
                }
                if(!flag){
                    continue;
                }
                for(int k=1;k<m;k++){
                    if((j&(1<<k))>0&&(j&(1<<(k-1)))>0){
                        flag=false;
                        break;
                    }
                }
                if(!flag){
                    continue;
                }

                int cnt=0;
                for(int k=0;k<m;k++){
                    if((j&(1<<k))&&(s[k]=='.')){
                        cnt++;
                    }
                }

                for(int k=0;k<(1<<m);k++){
                    int flag2=true;
                    for(int z=0;z<m;z++){
                        if(j&(1<<z)){
                            if(z-1>=0 && (k&((1<<(z-1))))){
                                flag2=false;
                                break;
                            }
                            if(z+1<m && (k&(1<<(z+1)))){
                                flag2=false;
                                break;
                            }
                        }
                    }
                    if(flag2)
                        d[j][i]=max(d[j][i],d[k][i-1]);
                }
                d[j][i]+=cnt;
            }
        }
        int ans=0;
        for(int i=0;i<(1<<m);i++){
            ans = max(ans , d[i][n]);
        }
        cout<<ans<<"\n";
    }
}