题目链接:
http://acm.hdu.edu.cn/showproblem.php?pid=4185
题意:
求给的矩阵中 最多有几个 横着或竖着的 两个相连的“##”
裸的最大匹配
数据较水。
代码:
#include <stdio.h>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <ctype.h>
#include <algorithm>
#include <vector>
#include <string.h>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <sstream>
#include <time.h>
using namespace std;
char s[1010][1010];
int n;
int p[1010][1010];
int book[1010];
int match[1010];
bool vis[1010];
int map[1010][1010];
int tot;
bool dfs(int u)
{
int i;
for (i = 0; i < tot; i++)
{
if (book[i] == 0 && map[u][i] == 1)
{
book[i] = 1;
if (match[i] == 0 || dfs(match[i]))
{
match[i] = u;
return true;
}
}
}
return false;
}
int dir[4][2] = { {1,0},{-1,0},{0,1},{0,-1} };
bool is_ok(int x,int y)
{
if (x < 0 || x >= n || y < 0 || y >= n) return false;
else return true;
}
int main()
{
int t, cases = 1;
scanf("%d", &t);
while (t--)
{
memset(p, 0, sizeof(p));
memset(match, 0, sizeof(match));
memset(vis, 0, sizeof(vis));
memset(map,0,sizeof(map));
scanf("%d", &n);
for (int i = 0;i < n;i++)
scanf("%s", s[i]);
tot = 0;
for (int i = 0;i < n;i++)
for (int j = 0;j < n;j++)
if (s[i][j] == '#') p[i][j] = tot++;
for (int i = 0;i < n;i++)
for (int j = 0;j < n;j++)
{
if (s[i][j] == '#')
{
for (int k = 0;k < 4;k++)
{
int x = i + dir[k][0];
int y = j + dir[k][1];
if (!is_ok(x, y)) continue;
if (s[x][y] == '#')
{
map[p[i][j]][p[x][y]] = 1;
map[p[x][y]][p[i][j]] = 1;
}
}
}
}
int ans = 0;
for (int i = 0; i < tot; i++)
{
memset(book, 0, sizeof(book));
if (dfs(i))
ans++;
}
printf("Case %d: %d\n", cases++, ans / 2);
}
return 0;
}