Two Arrays

最新推荐文章于 2022-10-27 23:58:51 发布

Amiraitowa

最新推荐文章于 2022-10-27 23:58:51 发布

阅读量108

点赞数

分类专栏： codeforces

本文链接：https://blog.csdn.net/Amiraitowa/article/details/108863621

版权

codeforces 专栏收录该内容

13 篇文章 0 订阅

订阅专栏

cf 1417 B

#include<bits/stdc++.h>
#include<algorithm>
#include<iostream>
#include<cstdio>
#include<map>
#include<set>
#include<string>
#include<utility>
#include<stack>
#include<queue>
#include<vector>
#pragma GCC optimize(3)
#pragma GCC optimize(2)
#define inf 0x3f3f3f3f
using namespace std;
typedef long long ll;
const int maxn = 1000010;
const int mod = 1e9+7;
ll i,j,t;
ll ans,sum,cnt,num;
ll a[maxn],b[maxn],vis[maxn];
ll flag=0,n,m,q,k,l,r,T;
template <typename T>
void read(T &x) /*快读*/
{
    x = 0;
    int f = 1;
    char ch = getchar();
    while (!isdigit(ch))
    {
        if (ch == '-')
            f = -1;
        ch = getchar();
    }
    while (isdigit(ch))
    {
        x = x * 10 + (ch ^ 48);
        ch = getchar();
    }
    x *= f;
    return;
}
template <typename T>
void write(T x)  /*快写*/
{
    if(x < 0)
    {
        putchar('-');
        x = -x;
    }
    if(x > 9)
        write(x/10);
    putchar(x % 10 + '0');
    return;
}
int main()
{
    read(t);
    while(t--)
    {
        read(n),read(T);
        for(i=0; i<n; i++)
            read(a[i]);
        num=0;
        for(i=0;i<n;i++)
        {
            if(a[i]==T-a[i])
            {
                if(num%2==0) cout<<"0 ";
                else cout<<"1 ";
                num++;
            }
            else
            {
                if(a[i]<T-a[i]) cout<<"0 ";
                else cout<<"1 ";
            }
        }
        cout<<endl;
    }
    return 0;
}