Maximum bipartite matching plus unmatched points
//====================================================================||
// ||
// ||
// Author : GCA ||
// 6AE7EE02212D47DAD26C32C0FE829006 ||
//====================================================================||
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
#ifdef ONLINE\_JUDGE
#define ll "%lld"
#else
#define ll "%I64d"
#endif
typedef unsigned int uint;
typedef long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\\n")
#define I\_de(x,n)for(int i=0;i<n;i++)printf("%d ",x\[i\]);Pln()
#define De(x)printf(#x"%d\\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\\
printf("%d ",dp\[htx\]\[hty\]);}Pln();}
#define M 410
#define PII pair<int,int\>
#define PB push\_back
#define oo INT\_MAX
#define Set\_oo 0x3f
#define Is\_debug true
#define debug(...) if(Is\_debug)printf("DEBUG: "),printf(\_\_VA\_ARGS\_\_)
#define FOR(it,c) for(\_\_typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
int tmp=min(x,y);
return min(tmp,z);
}
int max3(int x,int y,int z){
int tmp=max(x,y);
return max(tmp,z);
}
enum{
START=408,
END=409
};
vector<int\> mz\[M\];
char mzz\[M\]\[M\];
int dx\[4\]={0,0,1,-1};
int dy\[4\]={1,-1,0,0};
int ny,nx;
int all;
int mx\[M\],my\[M\];
int n;
bool visty\[M\];
void init(){
for(int i=0;i<M;i++){
mz\[i\].clear();
}
all=0;
}
bool dfs(int x){
FOR(it,mz\[x\]){
int y=(\*it);
if(!visty\[y\]){
visty\[y\]=true;
if(my\[y\]==-1||dfs(my\[y\])){
mx\[x\]=y;my\[y\]=x;
return true;
}
}
}
return false;
}
void solve(){
Set(mx,-1);
Set(my,-1);
int c=0;
for(int i=0;i<n;i++){
Set(visty,0);
if(dfs(i))c++;
}
// for(int i=0;i<n;i++){
// if(mx\[i\]!=-1)debug("%d %d\\n",i,mx\[i\]);
// }
int tmp=all-c\*2;
c+=tmp;
printf("%d\\n",c);
}
int main() {
ios\_base::sync\_with\_stdio(0);
int test;
scanf("%d",&test);
while(test--){
init();
scanf("%d%d%\*c",&ny,&nx);
for(int i=0;i<ny;i++){
scanf("%s",mzz\[i\]);
}
for(int i=0;i<ny;i++){
for(int j=0;j<nx;j++){
if(mzz\[i\]\[j\]=='\*')all++;
if(((i+j)&1)&&mzz\[i\]\[j\]=='\*'){
for(int k=0;k<4;k++){
int newx=j+dx\[k\];
int newy=i+dy\[k\];
if(newx<0||newx>=nx||newy<0||newy>=ny)continue;
if(mzz\[newy\]\[newx\]!='\*')continue;
mz\[i\*nx+j\].PB(newy\*nx+newx);
// mz\[newy\*nx+newx\].PB(i\*nx+j);
// debug("%d %d\\n",i\*nx+j,newy\*nx+newx);
}
}
}
}
n=ny\*nx;
solve();
}
}