Exclusive Access 2 UVA - 1439

按照紫书的思路，首先读入相应的信息，然后求出相应的独立集（集合的表示利用的是相应的位运算）。再对各个独立集分别“染”色，判断并且记录最小使用的不同颜色，最后输出结果，具体实现见如下代码;

#include<iostream>
#include<vector>
#include<string>
#include<set>
#include<stack>
#include<queue>
#include<map>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<deque>
using namespace std;

const int max_n = 110;//最大进程数量
const int max_m = 20;//最大资源数量

int n;//进程数量
int record[max_m][max_m],A[max_n],B[max_n];
int sole[1<<max_m];
int total;
int res[1 << max_m];
int match[1 << max_m],color[max_m];

bool independent(int data){
	for (int i = 0; i < max_m; i++){
		if (data&(1 << i)){
			for (int j = 0; j < max_m; j++){
				if (data&(1 << j)){
					if (i != j&&record[i][j]) return false;
				}
			}
		}
	}
	return true;
}

int dp(int data){
	int& ans = res[data];
	if (ans >= 0) return ans;
	if (data == 0) return 0;
	ans = max_n + 1;
	for (int k = data; k > 0; k = (k - 1)&data){
		if (sole[k]){
			int v = dp(k^data) + 1;
			if (v < ans){
				ans = v;
				match[data] = k;
			}
		}
	}
	return ans;
}

void setColor(int data,int c){
	for (int i = 0; i < max_m; i++){
		if (data&(1 << i)) color[i] = c;
	}
}

int main(){
	while (cin >> n){
		total = 0;
		memset(sole,0,sizeof(sole));
		memset(record,0,sizeof(record));
		for (int i = 0; i < n; i++){
			char a, b;
			cin >> a >> b;
			A[i] = a - 'L', B[i] = b - 'L';
			record[A[i]][B[i]] = 1;
			total |= (1 << A[i]);
			total |= (1 << B[i]);
		}
		for (int i = total; i > 0; i = (i - 1)&total){
			if (independent(i)) sole[i] = 1;
		}
		memset(res, -1, sizeof(res));
		int ans = dp(total);
		cout << ans-2 << endl;
		int start = total, c = 0;
		while (start){
			setColor(start, c++);
			start = start^match[start];
		}
		for (int i = 0; i < n; i++){
			if (color[A[i]]<color[B[i]]) swap(A[i], B[i]);
			cout << (char)(A[i] + 'L') << " " <<(char) (B[i] + 'L') << endl;
		}
	}
	return 0;
}