C++(clang++11) 解法, 执行用时: 9ms, 内存消耗: 504K, 提交时间: 2020-12-31 13:00:00

#include<bits/stdc++.h>
using namespace std;
int main(){
    int i,j=0,k=0,s=0,t,a[15];
    char ans[105];
    for(i=0;i<=9;i++){
    	scanf("%d",&a[i]),s+=a[i];
    	if(a[i]>=2&&!j&&i)j=i;
    	if(a[i]&1)k++,t=i;
	}
	if(k>1||(a[0]>1)&&!j){printf("-1\n");return 0;}
	ans[0]=ans[s-1]=j+'0',a[j]-=2;
	for(j=1,i=0;i<=9;i++)
		while(a[i]>=2)ans[j]=ans[s-j-1]=i+'0',j++,a[i]-=2;
    if(k)ans[s/2]=t+'0';
	ans[s]='\0',printf("%s\n",ans);
return 0;
}

Python3 解法, 执行用时: 38ms, 内存消耗: 4656K, 提交时间: 2022-01-24 16:01:22

l=list(map(int,input().split()))
num=''
#print(l)
for x in range(10):
    if l[x]&1:
        if num=='':
            num=str(x)
        else:
            num='-5'
            break

he=sum(l[1:])

if num=='-5':
    print(-1)
elif he<2 and l[0]>=2:
    print(-1)
else:
    s=""
    for x in range(1,10):
        s+=str(x)*(l[x]//2)
    if len(s)>0:
        s=s[0]+'0'*(l[0]//2)+s[1:]
    s+=num+s[::-1]
    print(s)
    #print(num)