题目链接:点击查看
题目大意:中文题意
题目分析:
代码:
#include<iostream>
#include<cstdio>
#include<string>
#include<ctime>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<stack>
#include<climits>
#include<queue>
#include<map>
#include<set>
#include<sstream>
using namespace std;
typedef long long LL;
typedef unsigned long long ull;
const int inf=0x3f3f3f3f;
const int N=1e5+100;
struct Node
{
int val,id;
bool operator<(const Node& a)const
{
return val>a.val;
}
}a[N];
int b[N];
int main()
{
#ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
#endif
// ios::sync_with_stdio(false);
int w;
cin>>w;
while(w--)
{
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
int num;
scanf("%d",&num);
a[i].val=(1<<num);
a[i].id=i;
b[i]=0;
}
sort(a+1,a+1+n);
int sum=(1<<30);
for(int i=1;i<=n;i++)
{
if(sum>=a[i].val)
{
sum-=a[i].val;
b[a[i].id]=1;
}
}
if(sum)
puts("impossible");
else
{
for(int i=1;i<=n;i++)
printf("%d",b[i]);
putchar('\n');
}
}
return 0;
}