bzoj4554 [Tjoi2016&Heoi2016]游戏

 1 //It is made by wfj_2048~
 2 #include <algorithm>
 3 #include <iostream>
 4 #include <cstring>
 5 #include <cstdlib>
 6 #include <cstdio>
 7 #include <vector>
 8 #include <cmath>
 9 #include <queue>
10 #include <stack>
11 #include <map>
12 #include <set>
13 #define inf (1<<30)
14 #define N (100010)
15 #define il inline
16 #define RG register
17 #define ll long long
18 #define File(s) freopen(s".in","r",stdin),freopen(s".out","w",stdout)
19 
20 using namespace std;
21 
22 struct edge{ int nt,to; }g[10*N];
23 
24 int h[60][60],l[60][60],head[N],vis[N],lk[N],n,m,sz1,sz2,num,cnt,ans;
25 char c[60][60];
26 
27 il int gi(){
28     RG int x=0,q=1; RG char ch=getchar();
29     while ((ch<‘0‘ || ch>‘9‘) && ch!=‘-‘) ch=getchar();
30     if (ch==‘-‘) q=-1,ch=getchar();
31     while (ch>=‘0‘ && ch<=‘9‘) x=x*10+ch-48,ch=getchar();
32     return q*x;
33 }
34 
35 il char gc(){
36     RG char ch=getchar();
37     while (ch!=‘*‘ && ch!=‘x‘ && ch!=‘#‘) ch=getchar();
38     return ch;
39 }
40 
41 il void insert(RG int from,RG int to){
42     g[++num]=(edge){head[from],to},head[from]=num; return;
43 }
44 
45 il int dfs(RG int x){
46     for (RG int i=head[x],v;i;i=g[i].nt){
47     v=g[i].to; if (vis[v]==cnt) continue; vis[v]=cnt;
48     if (!lk[v] || dfs(lk[v])){ lk[v]=x; return 1; }
49     }
50     return 0;
51 }
52 
53 il void work(){
54     n=gi(),m=gi();
55     for (RG int i=1;i<=n;++i)
56     for (RG int j=1;j<=m;++j) c[i][j]=gc();
57     for (RG int i=1;i<=n;++i)
58     for (RG int j=1;j<=m;++j){
59         if (j==1 || c[i][j-1]==‘#‘) ++sz1; h[i][j]=sz1;
60     }
61     for (RG int j=1;j<=m;++j)
62     for (RG int i=1;i<=n;++i){
63         if (i==1 || c[i-1][j]==‘#‘) ++sz2; l[i][j]=sz2;
64     }
65     for (RG int i=1;i<=n;++i)
66     for (RG int j=1;j<=m;++j)
67         if (c[i][j]==‘*‘) insert(h[i][j],l[i][j]);
68     for (RG int i=1;i<=sz1;++i){ ++cnt; if (dfs(i)) ++ans; }
69     printf("%d\n",ans); return;
70 }
71 
72 int main(){
73     File("game");
74     work();
75     return 0;
76 }