codeforce 776 D The Door Problem（DFS遍历）

D. The Door Problem

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Moriarty has trapped n people in n distinct rooms in a hotel. Some rooms are locked, others are unlocked. But, there is a condition that the people in the hotel can only escape when all the doors are unlocked at the same time. There are m switches. Each switch control doors of some rooms, but each door is controlled by exactly two switches.

You are given the initial configuration of the doors. Toggling any switch, that is, turning it ON when it is OFF, or turning it OFF when it is ON, toggles the condition of the doors that this switch controls. Say, we toggled switch 1, which was connected to room 1, 2 and 3 which were respectively locked, unlocked and unlocked. Then, after toggling the switch, they become unlocked, locked and locked.

You need to tell Sherlock, if there exists a way to unlock all doors at the same time.

Input

First line of input contains two integers n and m (2 ≤ n ≤ 105, 2 ≤ m ≤ 105) — the number of rooms and the number of switches.

Next line contains n space-separated integers r1, r2, ..., rn (0 ≤ ri ≤ 1) which tell the status of room doors. The i-th room is locked if ri = 0, otherwise it is unlocked.

The i-th of next m lines contains an integer xi (0 ≤ xi ≤ n) followed by xi distinct integers separated by space, denoting the number of rooms controlled by the i-th switch followed by the room numbers that this switch controls. It is guaranteed that the room numbers are in the range from 1 to n. It is guaranteed that each door is controlled by exactly two switches.

Output

Output "YES" without quotes, if it is possible to open all doors at the same time, otherwise output "NO" without quotes.

这一题先构个图，节点为开关，边为门，然后进行着色。当门为1时，这两端的开关颜色形同，门为0时，这两端的颜色不同。然后dfs遍历一遍，然后边跑边判断。这种方法比较巧妙。这一题用并查集和2-SAT什么的也可以。

AC代码：

 

#include<stdio.h>
#include<iostream>
#include<vector>
#include<stack>
#include<string>
#include<stdlib.h>
#include<math.h>
#include<queue>
#include<map>
#include<string.h>
#include<algorithm>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
int used[100010];
struct edge {
	int to;
	int attribute;
};
int n, m, a[100010], wrong;
vector<edge> v[100010];//图
vector<int> s[100010];//门的编号对应的边
void ConstructGraph(){//构图
	for (int i = 1; i <= n; i++) {
		int t1 = s[i][0], t2=s[i][1];
		edge e;
		e.to = t2;
		e.attribute = a[i];
		v[t1].push_back(e);
		e.to = t1;
		e.attribute = a[i];
		v[t2].push_back(e);
	}
}
void dfs(int root, int f) {//遍历
	int Size = v[root].size();
	for (int i = 0; i < Size; i++) {
		edge e = v[root][i];
		if(e.to==f){
			continue;
		}
		if (used[e.to] == 0) {
			if (e.attribute == 1) {
				used[e.to] = used[root];
				dfs(e.to, root);
			}
			else {
				used[e.to] = -used[root];
				dfs(e.to, root);
			}
		}
		else {
			if (e.attribute == 1) {
				if (used[root] != used[e.to]) {
					wrong = 1;
					return;
				}
			}
			else {
				if (used[root] == used[e.to]) {
					wrong = 1;
					continue;
				}
			}
		}
	}
}
int main() {
	int i, j, k, t;
	scanf("%d%d", &n, &m);
	for (i = 1; i <= n; i++) {
		scanf("%d", &a[i]);
	}
	for (i = 1; i <= m; i++) {
		scanf("%d", &k);
		for (j = 1; j <= k; j++) {
			scanf("%d", &t);
			s[t].push_back(i);
		}
	}
	ConstructGraph();
	memset(used, 0, sizeof(used));

	for (i = 1; i <= m; i++) {
		if (wrong == 1) {
			printf("NO");
			return 0;
		}
		if (used[i] == 0) {
			used[i] = 1;
			dfs(i, 0);
		}
		else {
			continue;
		}
	}
	printf("YES");
	return 0;
}