上海邀请赛D题原型,简单的行列匹配当时不会,好伤心
#include <cstring>
#include <iostream>
#include <cstdlib>
#include <cctype>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <queue>
#define INF (int)(1e9)
#define maxn 1010
using namespace std;
typedef long long ll;
int uN, vN;//u,v数目
int edge[maxn][maxn];
int linker[maxn];
bool used[maxn];
bool dfs(int u) { //从左边开始找增广路径
int v;
for(v = 0; v < vN; ++ v) {
if(edge[u][v] && !used[v]) {
used[v] = true;
if(linker[v] == -1 || dfs(linker[v])) {
//找增广路,反向
linker[v] = u;
return true;
}
}
}
return false;
}
int max_match() {
int res=0;
int u;
memset(linker,-1,sizeof(linker));
for(u = 0; u < uN; u++) {
memset(used, 0, sizeof(used));
if(dfs(u)) res ++;
}
return res;
}
char mat[maxn][maxn];
int row[maxn][maxn], col[maxn][maxn];
int main() {
int n;
while (cin >> n && n) {
memset(row, 0, sizeof(row));
memset(col, 0, sizeof(col));
memset(edge, 0, sizeof(edge));
for (int i = 0; i < n; ++ i) {
for (int j = 0; j < n; ++ j) {
cin >> mat[i][j];
}
}
int p1 = 0, p2 = 0;
int flag = 0;
for (int i = 0; i < n; ++ i) {
for (int j = 0; j <= n; ++ j) {
if (!flag && (mat[i][j] == 'X' || j == n)) {
++ p1;
flag = 1;
}
else if (mat[i][j] == '.') {
row[i][j] = p1;
flag = 0;
}
}
}
flag = 0;
for (int i = 0; i < n; ++ i) {
for (int j = 0; j <= n; ++ j) {
if (!flag && (mat[j][i] == 'X' || j == n)) {
++ p2;
flag = 1;
}
else if (mat[j][i] == '.') {
col[j][i] = p2;
flag = 0;
}
}
}
for (int i = 0; i < n; ++ i) {
for (int j = 0; j < n; ++ j) if (mat[i][j] == '.') {
edge[row[i][j]][col[i][j]] = 1;
}
}
uN = p1, vN = p2;
cout << max_match() << endl;
}
}