3062.Two Sets

Time Limit: 1s Memory Limit: 256MB

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.

Input Format(From the terminal/stdin)

The first line contains three space-separated integers n,a,b (1 \le n \le 105;1 \le a,b \le 109). The next line contains n space-separated distinct integers p1,p2,...,pn(1 \le pi \le 109).

Output Format(To the terminal/stdout)

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).

Sample Input 1

Copy 
4 5 9
2 3 4 5
 · · \n
 · · · \n

Sample Output 1

Copy 
YES
0 0 1 1
   \n
 · · · \n

Sample Input 2

Copy 
3 3 4
1 2 4
 · · \n
 · · \n

Sample Output 2

Copy 
NO
  \n

Hints

It's OK if all the numbers are in the same set, and the other one is empty.

Submit

请先 登录
 Submit
题解(0)
© 2025 FAQs