while(!q.empty()){
u=q.front();
q.pop();
vis[u]=0;
for(i=head[u];i!=-1;i=edge[i].next){
v=edge[i].v;
if(dp[v]==inf || dp[v]>dp[u]+edge[i].w){
dp[v]=dp[u]+edge[i].w;
pre[v]=u;
if(!vis[v]){
vis[v]=1;
q.push(v);
}
}
}
}
if(dp[n-1]==inf)return 0;
return 1;
}
void print(int now){
if(now==0) return ;
print(pre[now]);
//printf("%d ",pre[now]+1);
v.push_back(pre[now]+1);
}
int main(){
map
map
int i,j,k;
p[0]=1;
for(i=1;i<=10;i++) p[i]=p[i-1]*10;
scanf("%d",&n);
init();
for(i=0;i<10;i++) scanf("%d",&val[i]);
for(i=0;i
for(k=0;k<10;k++){
tem=s[i];
t1=(s[i]%p[10-j])/p[9-j];
if(k==t1) continue;
tem=tem-t1*p[9-j]+p[9-j]*k;
pos=mp.find(tem);
if(pos!=mp.end()) addedge(i,pos->second,val[j]);
}
}
for(j=0;j<10;j++)
for(k=j+1;k<10;k++){
tem=s[i];
t1=(s[i]%p[10-j])/p[9-j];
t2=(s[i]%p[10-k])/p[9-k];
if(t1==t2)continue;
tem=tem-t1*p[9-j]-t2*p[9-k]+t2*p[9-j]+t1*p[9-k];
pos=mp.find(tem);
if(pos!=mp.end()) addedge(i,pos->second,val[j]);
}
}
bool t3=spfa();
if(t3==0){
printf("-1\n");
return 0;
}
else{
printf("%d\n",dp[n-1]);
print(n-1);
v.push_back(n);
printf("%d\n",v.size());
for(i=0;i
else printf(" %d",v[i]);
puts("");
}
return 0;
}