sgu190：Dominoes(二分图匹配)

裸的二分图匹配，但我能写成这么丑我也是醉了...

#include <cstdio>
#include <iostream>
#include <vector>
#include <cstring>
#include <utility>
#include <cmath>
#include <algorithm>
using namespace std;
const int MAXN = 49;
int n, p;
bool cap[MAXN*MAXN];
int map[MAXN][MAXN];
pair<int, int> adv_map[MAXN*MAXN];
int drt[4][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
int link[MAXN*MAXN];
bool used[MAXN*MAXN];
bool col[MAXN*MAXN];
int ans1[MAXN*MAXN], ans2[MAXN*MAXN];
vector<int> edge[MAXN*MAXN];

bool in(int x, int y) {return x>=1&&x<=n&&y>=1&&y<=n;}

bool dfs(int u)
{
	for(int i = 0, lim = edge[u].size(); i < lim; ++i)
	{
		int v = edge[u][i];
		if(!used[v] && !col[v])
		{
			used[v] = true;
			if(link[v] == -1 || dfs(link[v]))
			{
				link[v] = u;
				return true;
			}
		}
	}
	return false;
}

void color(int cur)
{
	used[cur] = true;
	for(int i = 0, lim = edge[cur].size(); i < lim; ++i)
	{
		int to = edge[cur][i];
		if(!used[to])
		{
			col[to] = col[cur]^1;
			color(to);	
		}
	}
}

void output1(int p, int s)
{
	if(p == 0)
	{
		cout << s << endl;
		sort(ans1+1, ans1+s+1);
		for(int i = 1; i <= s; ++i)
			cout << adv_map[ans1[i]].first << " " << adv_map[ans1[i]].second << endl;
		return ;	
	}
	if(link[p] == -1) output1(p-1, s);
	else 
	{
		int q = link[p];
		if(abs(p-q) == 1)
		{	 
			if(p > q) ans1[s+1] = q;
			else ans1[s+1] = p;
			output1(p-1, s+1);
		}
		else output1(p-1, s);
	}
}

void output2(int p, int s)
{
	if(p == 0)
	{
		cout << s << endl;
		sort(ans2+1, ans2+s+1);
		for(int i = 1; i <= s; ++i)
			cout << adv_map[ans2[i]].first << " " << adv_map[ans2[i]].second << endl;
		return ;	
	}
	if(link[p] == -1) output2(p-1, s);
	else 
	{
		int q = link[p];
		if(abs(p-q) == n)
		{	 
			if(p > q) ans2[s+1] = q;
			else ans2[s+1] = p;
			output2(p-1, s+1);
		}
		else output2(p-1, s);
	}
}

int main()
{
	cin >> n >> p;
	for(int i = 1; i <= n; ++i)
		for(int j = 1; j <= n; ++j)
		{
			map[i][j] = (j-1)*n+i;
			adv_map[(j-1)*n+i] = make_pair(i, j);
		}
	memset(cap, true, sizeof(cap));
	for(int i = 1; i <= p; ++i)
	{
		int x, y;
		cin >> x >> y;
		cap[map[x][y]] = false;	
	}
	for(int i = 1; i <= n; ++i)
		for(int j = 1; j <= n; ++j)
			for(int k = 0; k < 4; ++k)
				if(in(i+drt[k][0], j+drt[k][1]) && cap[map[i+drt[k][0]][j+drt[k][1]]])
					edge[map[i][j]].push_back(map[i+drt[k][0]][j+drt[k][1]]);	
	memset(link, 0xfffff, sizeof(link));
	for(int i = 1; i <= n*n; ++i)
		if(!used[i] && cap[i])
			color(i);
	int sum = 0;
	for(int i = 1; i <= n*n; ++i)
		if(cap[i] && col[i])
		{
			memset(used, false, sizeof(used));
			if(dfs(i)) sum++;
		}
	if((sum<<1) == n*n-p)
	{
		cout << "Yes" << endl;
		output1(n*n, 0);
		output2(n*n, 0);
	}
	else cout << "No" << endl;
	return 0;
}