JZOJ 4672.【提高A组模拟赛 T2】 Graph Coloring

题目大意：

现在你有一张无向图包含n个节点m条边。最初，每一条边都是蓝色或者红色。每一次你可以将一个节点连接的所有边变色（从红变蓝，蓝变红）。
找到一种步数最小的方案，使得所有边的颜色相同。如果没有方案输出-1

解题思路：

可以设目的为蓝色然后搜索，如果当前点选过一次就说明没有方案
接着将所有边权取反(将目的换成红色)进行同样操作

$Accepted/code:$

#include<cstdio>
#include<cstring>
#include<algorithm>

using namespace std;

const int N = 110000;
const int inf = 2147483647 / 3;

struct Line {
	int to, w, next;
}e[N<<1];

int n, m, cnt, sum, ans;
int last[N];
bool flag;
bool v[N], f[N], a[N];

inline void add(int x, int y, int w) {
	e[++cnt] = (Line){y, w, last[x]}; last[x] = cnt;
}

void dfs(int x) {
	v[x] = a[x] = 1;
	for (int i = last[x]; i && !flag; i = e[i].next) {
		int y = e[i].to;
		if (!v[y]) {
			f[y] = f[x] ^ e[i].w;
			if (f[y]) sum++;
			dfs(y);
		}
		else if(f[y] != f[x] ^ e[i].w)
			     flag = 1;
	}
}

void count() {
	memset(a, 0, sizeof(a));
	int answer = 0, k;
	for (int i = 1; i <= n; i++)
		if (!a[i]) {
		  	f[i] = sum = flag = 0;
		  	memset(v, 0, sizeof(v));
		  	dfs(i);
		  	if (flag) k = inf;
		  	else k = sum;
		  	k = flag ? inf : sum;
		  	f[i] = sum = 1; flag = 0;
		  	memset(v, 0, sizeof(v));
		  	dfs(i);
		  	if (flag) sum = inf;
		  	if (k == inf && sum == inf) {
		  		answer = inf;
		  		break;
		  	}
			answer += min(k, sum);
		}
	ans = min(answer, ans);
}

int main() {
	scanf("%d %d", &n, &m);
	for (int i = 1, x, y; i <= m; ++i) {
		char c;
		scanf("%d %d %c", &x, &y, &c);
		add(x, y, c == 'B');
		add(y, x, c == 'B');
	}
	ans = inf;
	count();
	for (int i = 1; i <= cnt; ++i)
		e[i].w ^= 1;
	count();
	printf("%d", ans == inf ? -1 : ans);
}