HDU 1997 汉诺塔VII

题解参考博客：

http://blog.csdn.net/hjd_love_zzt/article/details/9897281

#include <cstdio>
int n,ns,n2,a[],yes;
int main(){
    int cas;
    scanf("%d",&cas);
    while(cas--){
        scanf("%d",&n);
        for(int i=;i<=;i++){
            scanf("%d",&ns);
            for(int j=;j<=ns;j++){
                scanf("%d",&n2);
                a[n2]=i;
            }
        }
        yes=;
        int sor=,cant=,des=,t;
        for(int i=n;i>=;i--){
            if(a[i]==cant){yes=;break;}
            else if(a[i]==des)t=sor,sor=cant,cant=t;
            else if(a[i]==sor)t=des,des=cant,cant=t;
        }  

        if(yes)printf("true\n");
        else printf("false\n");
    }
    return ;
}