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
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
| #include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define maxn 1005
#define put() putchar('\n')
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
using namespace std;
Tp void read(T &x){
int f=1;x=0;char c=getchar();
while (c<'0'||c>'9') {if (c=='-') f=-1;c=getchar();}
while (c>='0'&&c<='9') {x=x*10+c-'0';c=getchar();}
x*=f;
}
namespace Debug{
Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
}using namespace Debug;
#define fi first
#define se second
#define mk make_pair
const int mod=1e9+7;
int power(int x,int y=mod-2) {
int sum=1;
while (y) {
if (y&1) sum=sum*x%mod;
x=x*x%mod;y>>=1;
}
return sum;
}
----------------template------------------
#define lowbit(x) ((x)&(-(x)))
int n,a[maxn],suf[maxn],b[maxn];
int f[1005][(1<<14)+5],nex[1005][(1<<14)+5],h[(1<<14)+5];
bool dfs(int now,int stat) {
int i,tmp1=-1,tmp2=-1,s=suf[now-1]-stat;
tmp1=h[stat],tmp2=h[s];
if (tmp1==tmp2&&tmp1>=0) stat+=(1<<tmp1);
else if (tmp1<tmp2) stat+=(1<<tmp2);
if (now==n+1) {
if ((stat==0)||(stat==suf[n])||stat==suf[n]-stat) return 1;
else return 0;
}
if (f[now][stat]!=-1) return f[now][stat];
int res=0;f[now][stat]=0;
if (a[now]<=lowbit(stat)||stat==0) {
res=dfs(now+1,stat+a[now]);
if (res) f[now][stat]=1,nex[now][stat]=0;
}
s=suf[now-1]-stat;
if (a[now]<=lowbit(s)||s==0) {
res=dfs(now+1,stat);
if (res&&!f[now][stat]) f[now][stat]=1,nex[now][stat]=1;
}
return f[now][stat];
}
void print(int now,int stat) {
int i,tmp1=-1,tmp2=-1,s=suf[now-1]-stat;
tmp1=h[stat],tmp2=h[s];
if (tmp1==tmp2&&tmp1>=0) stat+=(1<<tmp1);
else if (tmp1<tmp2) stat+=(1<<tmp2);
if (now==n+1) return ;
putchar(nex[now][stat]?'r':'l');
print(now+1,nex[now][stat]?stat:stat+a[now]);
}
void solve(void) {
int i,j;
read(n);
for (i=1;i<=n;i++) read(a[i]),suf[i]=suf[i-1]+a[i],b[i]=__builtin_popcount(a[i]);
if (suf[n]!=lowbit(suf[n])) return puts("no"),void();
for (i=0;i<=n;i++) for (j=0;j<=suf[n];j++) f[i][j]=-1;
if (!dfs(1,0)) return puts("no"),void();
else {
print(1,0);put();
}
}
signed main(void){
int T,i,j;
h[0]=-1;
for (i=1;i<=(1<<14);i++) {
for (j=0;j<=14;j++) if ((i>>j)&1) h[i]=j;
}
read(T);
while (T--) solve();
return 0;
}
|