题目链接:cf 468B
Little X has n distinct integers: p1, p2, ..., pn. He wants to divide all of them into two sets A and B. The following two conditions must be satisfied:
- If number x belongs to set A, then number a - x must also belong to set A.
- If number x belongs to set B, then number b - x must also belong to set B.
Help Little X divide the numbers into two sets or determine that it's impossible.
The first line contains three space-separated integers n, a, b (1 ≤ n ≤ 105; 1 ≤ a, b ≤ 109). The next line contains n space-separated distinct integers p1, p2, ..., pn (1 ≤ pi ≤ 109).
If there is a way to divide the numbers into two sets, then print "YES" in the first line. Then print n integers: b1, b2, ..., bn (bi equals either 0, or 1), describing the division. If bi equals to 0, then pi belongs to set A, otherwise it belongs to set B.
If it's impossible, print "NO" (without the quotes).
4 5 9 2 3 4 5
YES 0 0 1 1
3 3 4 1 2 4
NO
It's OK if all the numbers are in the same set, and the other one is empty.
把n个数分为两个集合,使得若x属于A集合,则a-x必须属于A集合,若x属于B集合,则b-x必须属于B集合。问能否做到,若能做到输出属于集合的状态。
并查集。
不难想到,x与a-x必须属于同一个集合,x与b-x必须属于同一个集合。于是利用并查集操作将不同的点放到同一个集合中去。然后根据每个能否放入AB集合来判断该点所在集合能否属于A集合或者B集合,若最终判断结果不属于任何一个集合,则无法满足条件
/******************************************************
* File Name: 468B.cpp
* Author: kojimai
* Creater Time:2014年09月23日 星期二 13时02分20秒
******************************************************/
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<iostream>
#include<map>
using namespace std;
#define FFF 100005
int c[FFF],n,a,b,set[FFF],sta[FFF],can[FFF];
map<int,int> p;
int find(int x)
{
if(x==set[x])
return x;
else
return set[x]=find(set[x]);
}
void uion(int x,int y)
{
int t1=find(x),t2=find(y);
if(t1==t2)
return;
else
set[t2]=t1;
return;
}
int main()
{
scanf("%d%d%d",&n,&a,&b);
for(int i = 1;i <= n;i++)
{
scanf("%d",&c[i]);
p[c[i]]=i;
set[i]=i;
}
memset(sta,0,sizeof(sta));
for(int i = 1;i <= n;i++)
{
can[i]=3;
if(p[a-c[i]]){
uion(i,p[a-c[i]]);
sta[i]+=1;//该点可以属于a集合,二进制状态下的第一位1表示可行
}
if(p[b-c[i]]){
uion(i,p[b-c[i]]);
sta[i]+=2;//该点可以属于b集合,二进制状态下的第二位1表示可行
}
}
bool flag=true;
for(int i = 1;i <= n && flag;i++)
{
//cout<<"i="<<i<<" sta[i]="<<sta[i]<<endl;
int t=find(i);
can[t]=(can[t]&sta[i]);//依据该点的可能情况求所属集合的可能情况
if(can[t]==0)//为0表示不能属于任意一个集合,因此无解
flag=false;
}
if(!flag)
printf("NO\n");
else
{
printf("YES\n");
for(int i = 1;i <= n;i++)
{
int t = find(i);
if((can[t]&1))
cout<<'0';
else
cout<<'1';
if(i<n)
cout<<' ';
}
cout<<endl;
}
return 0;
}