Pagini recente » Cod sursa (job #1597782) | Cod sursa (job #2768053) | Cod sursa (job #1980141) | Cod sursa (job #77830) | Cod sursa (job #210762)
Cod sursa(job #210762)
#include <cstdio>
const int NMAX=5001;
int N,h,A[NMAX],B[NMAX],C[NMAX],x[NMAX];
void read(){
scanf("%d",&N);
for (int i=2;i<=N;++i) scanf("%d %d %d",&A[i],&B[i],&C[i]);
}
void write(){
printf("%d\n",h);
for (int i=1;i<=N;++i) printf("%d ",x[i]);
}
void solve(int n){
int i,med;
++h;
if (n==1) {x[1]=1;return;}
if (A[n]!=B[n] && B[n]!=C[n] && C[n]!=A[n]){
solve(n-2);
if (B[n]==n) x[n-1]=n-1;
else{
for (i=n-1;i>B[n];i--) x[i]=x[i-1];
x[B[n]]=n-1;}
for (i=n;i>C[n];i--) x[i]=x[i-1];
x[C[n]]=n;
}
else{
if (A[n]==B[n] || A[n]==C[n]) med=A[n];
else med=B[n];
solve(n-1);
for (i=n;i>med;i--) x[i]=x[i-1];
x[med]=n;}
}
int main(){
freopen("sortare.in","r",stdin);
freopen("sortare.out","w",stdout);
read();
solve(N);
write();
return 0;
}