Codeforces 776D 并查集

本文介绍了一个有趣的编程问题——解锁门谜题。问题中,n个人被困在n个不同的房间内,通过m个开关控制房门的锁定状态。目标是找到一种方式同时打开所有房门,文章提供了详细的解题思路及实现代码。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

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 12 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 ≤ 1052 ≤ 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 ifri = 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.

Examples
input
3 3
1 0 1
2 1 3
2 1 2
2 2 3
output
NO
input
3 3
1 0 1
3 1 2 3
1 2
2 1 3
output
YES
input
3 3
1 0 1
3 1 2 3
2 1 2
1 3
output
NO
Note

In the second example input, the initial statuses of the doors are [1, 0, 1] (0 means locked, 1 — unlocked).

After toggling switch 3, we get [0, 0, 0] that means all doors are locked.

Then, after toggling switch 1, we get [1, 1, 1] that means all doors are unlocked.

It can be seen that for the first and for the third example inputs it is not possible to make all doors unlocked.


题意:给你n扇门,m种操作,n扇门开始的状态,0代表关,1代表开,m个操作,每个操作会使k扇门翻转,问能不能将所有门打开。

每扇门都严格有两种操作包含它。


题解:假设一个门的操作是a和b。令k代表是使用k操作,k+m表示不用。

那么当第i扇门关着,那就用a和b+m或者a+m和b。

如果是开着,那就用a和b或者a+m和b+m。

用并查集维护,最后判断一下i和i+m是不是在一个并查集,如果是,那就矛盾,NO。


#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;
vector<int>sp[200005];
int pre[400005],yes[200005];
int find(int x){  
    int r=x;  
    while(pre[r]!=r)                                                     
        r=pre[r];  
    int i=x,j;  
    while(i!=r){  
         j=pre[i];  
         pre[i]=r;  
         i=j;  
    }  
    return r;  
}
void link(int a,int b){
	if(find(a)!=find(b))pre[find(a)]=find(b);
}
int main(){
	int x,y,n,m,i,j;
	scanf("%d%d",&n,&m);
	for(i=1;i<=n;i++)scanf("%d",&yes[i]);
	for(i=1;i<=m;i++){
		scanf("%d",&x);
		for(j=1;j<=x;j++){
			scanf("%d",&y);
			sp[y].push_back(i);
		}
	}
	for(i=1;i<=400000;i++)pre[i]=i;
	for(i=1;i<=n;i++){
		int a=sp[i][0],b=sp[i][1];
		if(!yes[i]){
			link(a,b+m);
			link(a+m,b);
		}
		else{
			link(a,b);
			link(a+m,b+m);
		}
	}
	for(i=1;i<=m;i++){
		if(find(i)==find(i+m)){
			printf("NO\n");
			return 0;
		}
	}
	printf("YES\n");
	return 0;
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值