题目链接
解题思路:
- 先从行开始,从上往下,从左往右,碰到不能放的格子,就将之前的格子(可以放棋子)缩为一点,然后重新计数
- 同理,也将列进行如上方法缩点
- 之后,将图遍历一遍,如果当前位置能放格子,则将该位置重新标号的行id_row和列id_column,连一条双向边,建立二分图
- 最后进行二分图匹配求出答案即可
- ps:因为是双向二分图,所以最后答案要除2
AC代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
const int maxn = 100;
int n, cnt;
int match[maxn], vis[maxn];
int id_row[maxn][maxn], id_column[maxn][maxn], graph[maxn][maxn];
char a[maxn][maxn];
bool dfs(int x) {
for(int i = 1; i <= cnt; i++) {
if(graph[x][i] && !vis[i]) {
vis[i] = 1;
if(match[i] == -1 || dfs(match[i])) {
match[i] = x;
return true;
}
}
}
return false;
}
int Maxmatch() {
int sum = 0;
memset(match, -1, sizeof(match));
for(int i = 1; i <= cnt; i++) {
memset(vis, 0, sizeof(vis));
if(dfs(i)) sum++;
}
return sum;
}
int main() {
while(scanf("%d", &n) && n) {
memset(vis, 0, sizeof(vis));
memset(id_row, 0, sizeof(id_row));
memset(id_column, 0, sizeof(id_column));
memset(graph, 0, sizeof(graph));
cnt = 1;
for(int i = 1; i <= n; i++) scanf("%s", a[i] + 1);
for(int i = 1; i <= n; i++) {//将一行内可以缩的点缩成一点, X为分界
for(int j = 1; j <= n; j++) {
if(a[i][j] == '.') id_row[i][j] = cnt, vis[cnt] = 1;
else if(a[i][j] == 'X' && vis[cnt]) cnt++;
}
if(vis[cnt]) cnt++;//每换一行都要cnt++
}
for(int j = 1; j <= n; j++) {
for(int i = 1; i <= n; i++) {//将一列内可以缩的点缩成一点, X为分界
if(a[i][j] == '.') id_column[i][j] = cnt, vis[cnt] = 1;
else if(a[i][j] == 'X' && vis[cnt]) cnt++;
}
if(vis[cnt]) cnt++;//每换一列都要cnt++
}
if(!vis[cnt]) cnt--;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
if(a[i][j] != 'X')
graph[id_column[i][j]][id_row[i][j]]=graph[id_row[i][j]][id_column[i][j]] = 1;//建图
int ans = Maxmatch();//寻找最大匹配数量
printf("%d\n", ans / 2);//寻找最大匹配数量
}
}