← 返回题目

题库练习 Two Sets

← 上一题下一题 →

A9610 | $Two Sets$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

Little X has $n$ distinct integers: $p_{1},p_{2},...,p_{n}$ . 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<=10^{5}; 1<=a,b<=10^{9})$ . The next line contains $n$ space-separated distinct integers $p_{1},p_{2},...,p_{n} (1<=p_{i}<=10^{9})$ .

输出格式

If there is a way to divide the numbers into two sets, then print "YES" in the first line. Then print $n$ integers: $b_{1},b_{2},...,b_{n}$ ( $b_{i}$ equals either $0$ , or $1$ ), describing the division. If $b_{i}$ equals to $0$ , then $p_{i}$ belongs to set $A$ , otherwise it belongs to set $B$ . If it's impossible, print "NO" (without the quotes).

输入输出样例

输入 #1

4 5 9
2 3 4 5

输出 #1

YES
0 0 1 1

输入 #2

3 3 4
1 2 4

输出 #2

NO

C++ 编辑器

输入

输出