{"trustable":false,"prependHtml":"\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\" type\u003d\"text/javascript\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"在桌子上有n个饼干。第i个饼干上刻了一个正整数k[i],表明它的重量是2^(-k[i])克。现在要求你判断是否可以将n个饼干分成两组,使得每组的重量和\u003e\u003d2^(-1)克?如果有解,输出分组方案,如果存在多种不同的解,你可以任意输出一种。"}},{"title":"Input","value":{"format":"HTML","content":"\n第一行T,表示有T组数据,\n每组数据的第一行给定一个整数n,表示有n个饼干,接下来给n个k(i),表示每个饼干上的数字。\n数据范围:n\u003c\u003d1e5,1\u003c\u003dk[i]\u003c\u003d1e9"}},{"title":"Output","value":{"format":"HTML","content":"如果无解,输出NO。否则输出YES,其后一行跟着一个01字符串s,s[i]\u003d0表示第i个物品在第0组,s[i]\u003d1表示第i个物品在第1组。"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre\u003e3\n3\n2 2 2\n3\n2 2 1\n2\n1 1\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre\u003eCase 1: NO\nCase 2: YES\n001\nCase 3: YES\n10\u003c/pre\u003e"}}]}