B. Two Arrays

传送门

题目
RedDreamer has an array a consisting of n non-negative integers, and an unlucky integer T.

Let’s denote the misfortune of array b having length m as f(b) — the number of pairs of integers (i,j) such that 1≤i<j≤m and bi+bj=T. RedDreamer has to paint each element of a into one of two colors, white and black (for each element, the color is chosen independently), and then create two arrays c and d so that all white elements belong to c, and all black elements belong to d (it is possible that one of these two arrays becomes empty). RedDreamer wants to paint the elements in such a way that f（c)+f(d) is minimum possible.

For example:

if n=6, T=7 and a=[1,2,3,4,5,6], it is possible to paint the 1-st, the 4-th and the 5-th elements white, and all other elements black. So c=[1,4,5], d=[2,3,6], and f（c)+f(d)=0+0=0;
if n=3, T=6 and a=[3,3,3], it is possible to paint the 1-st element white, and all other elements black. So c=[3], d=[3,3], and f（c)+f(d)=0+1=1.
Help RedDreamer to paint the array optimally!

翻译
乌普尔萨尔瓦卢乌普尔红梦想家有一个数组a，包含n个非负整数，和一个不幸运的整数T。数组b的长度为f(b)——满足1 <i<j<m和b的整数对(i,j)的个数;+ b;= T。RedDreamer画的每个元素为两种颜色,白色和黑色(为每个元素,颜色选择独立),然后创建两个数组c和d,使所有白色元素属于c,和所有黑色元素属于d(有可能是这两个数组变成空的)。“红梦想家”想要以f© + f(d)最小可能的方式来绘制元素…例如:。如果n=6, T=7, a =[1, 2,3, 4, 5]，可以把第1个，第4个和第5个元素涂成白色，其他元素都涂成黑色。所以c =(1、4、5),d =(2, 3, 6)和f © + f (d) = 0 + 0 = 0。如果n=3, T=6, a =[3,3,3]，可以将1-st元素涂成白色，而所有其他元素都涂成黑色。因此c=[3] d -[3,3] f© +f(d) =0+1=1。帮助“红梦想者”以最佳方式绘制阵列!

Input
The first line contains one integer t (1≤t≤1000) — the number of test cases. Then t test cases follow.

The first line of each test case contains two integers n and T (1≤n≤105, 0≤T≤109) — the number of elements in the array and the unlucky integer, respectively.

The second line contains n integers a1, a2, …, an (0≤ai≤109) — the elements of the array.

The sum of n over all test cases does not exceed 105.

Output
For each test case print n integers: p1, p2, …, pn (each pi is either 0 or 1) denoting the colors. If pi is 0, then ai is white and belongs to the array c, otherwise it is black and belongs to the array d.

If there are multiple answers that minimize the value of f©+f(d), print any of them.

Example
input

2
6 7
1 2 3 4 5 6
3 6
3 3 3

output

1 0 0 1 1 0 
1 0 0

思路
假定 0 表示白色 1 表示黑色 把小于m / 2 的 全部放到 白色数组 大于 m / 2 的放到黑色数组 （这里要考虑奇偶问题 3 / 2 = 1， 2 / 2 = 1 ）

题解

#include<iostream>
#include<algorithm>

using namespace std;

const int N = 1e5 + 10;

int t, n, k;
int a[N], c[N], d[N];

int main () {
	cin >> t;
	while(t -- ) {
		cin >> n >> k;
		for(int i = 1; i <= n; i ++ ) {
			cin >> a[i];	
		}
		int f = 0;
		for(int i = 1; i <= n; i ++ ) {
			
			if(a[i] == k / 2) {
				if(k % 2 == 1) cout << "0 ";
				else {
					if(f == 0) {
						cout << "0 ";
						f = 1;
					}
					else {
						cout << "1 ";
						f = 0;
					}
				}
			}
			else if(a[i] > k / 2) cout << "1 ";
			else cout << "0 ";
		}
		cout << endl;
	}
	return 0;
}