題目鏈接
乍一看,經典搜索or狀壓dp啊。但是200的數據量打消了我這個念頭。標籤裏有圖論,就往圖論上想。發現應該是個二分圖,而且是一個經典的模型,曾在藍皮書上看見過類似的。
我們先得出無牆壁連續行塊,連續列塊。並給之編號。
例如樣例(每個位置所屬的連續行塊及連續列塊):
列:
0 1 2 3
0 0 0 3
4 5 6 0
行:
0 8 8 8
0 0 0 9
7 7 7 0
我們針對每個空位置,將他所屬行塊、列塊連邊,求跑一邊最大匹配就行了。
下面是ac代碼:
#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <queue>
#include <map>
#include <cstdio>
#include <cstdlib>
#define ll long long
using namespace std;
const int N = 2e5+5;
int tot;
int he[N], ne[N], ver[N];
int match[N];
bool vis[N];
int ans;
void init()
{
memset(match, 0, sizeof(match));
}
void add(int x, int y)
{
ver[++tot] = y;
ne[tot] = he[x];
he[x] = tot;
}
int mx;
bool dfs(int x)
{
for (int i = he[x]; i; i = ne[i])
{
int y = ver[i];
if (!vis[y])
{
vis[y] = 1;
if (!match[y] || dfs(match[y]))
{
match[y] = x;
return 1;
}
}
}
return 0;
}
int m, n;
void getans()
{
for (int i = 1; i <= mx; i++)
{
memset(vis, 0, sizeof(vis));
if (dfs(i)) ans++;
}
}
int mp[256][256];
int idn[256][256];
int idm[256][256];
int gg[N];
int cnt = 0;
int main()
{
scanf("%d%d", &n, &m);
for (int i = 1; i <= m; i++) mp[0][i] = 2;
for (int i = 1; i <= n; i++) mp[i][0] = 2;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
scanf("%d", &mp[i][j]);
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= m; j++)
{
if (mp[i][j] == 2) continue;
if (mp[i-1][j] == 2) idn[i][j] = ++cnt, gg[cnt] = j;
else idn[i][j] = idn[i-1][j];
}
}
mx = cnt;
for (int i = 1; i <= m; i++)
{
for (int j = 1; j <= n; j++)
{
if (mp[j][i] == 2) continue;
if (mp[j][i-1] == 2) idm[j][i] = ++cnt, gg[cnt] = j;
else idm[j][i] = idm[j][i-1];
}
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
if (!mp[i][j])
{add(idn[i][j], idm[i][j]);}
getans();
printf("%d\n", ans);
for (int i = mx+1; i <= cnt; i++)
if (match[i])
printf("%d %d\n", gg[i], gg[match[i]]);
}