-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathB.cpp
66 lines (52 loc) · 1.06 KB
/
B.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define mod 1000000007
#define endl "\n"
#define len(x) x.size()
#define gcd(a, b) __gcd(a, b)
#define ste(v) v.begin(), v.end()
#define stea(arr, n) arr, arr+n
void solve(){
// Solve here
ll n, k;
cin>>n>>k;
vector<ll> v(n);
map<ll, ll> m1;
map<ll, ll> m2;
for(int i=0;i<n;i++) cin>>v[i];
vector<int> ans(n);
for(int i=0;i<n;i++) {
if(m1[k-v[i]] == m2[k-v[i]]) {
ans[i] = 0;
m1[v[i]]++;
} else if(m1[k-v[i]] < m2[k-v[i]]){
ans[i] = 0;
m1[v[i]]++;
} else {
ans[i] = 1;
m2[v[i]]++;
}
}
for(auto i:ans) {
cout<<i<<" ";
}
cout<<endl;
}
int32_t main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios::sync_with_stdio(0);
cout.tie(0);
cin.tie(0);
int t;
cin>>t;
while(t--){
solve();
}
return 0;
}