POJ2302

简单题。

 #include<stdio.h>
 #include<string.h>
 #include<stdlib.h>
 #include<algorithm>
 using namespace std;
 const int maxn = ;
 int mat[ maxn ][ maxn ];
 bool vis[ maxn ][ maxn ];
 bool appear[  ];
 struct node{
     int x,y;
 }num[  ];
 
 void init(){
     memset( appear,false,sizeof( appear ) );
     memset( vis,false,sizeof( vis ) );
     vis[][] = true;
 }
 
 bool judge(){
     int cnt;
     for( int i=;i<=;i++ ){
         cnt = ;
         for( int j=;j<=;j++ ){
             if( vis[i][j]==true )
                 cnt++;
             else
                 break;
         }
         if( cnt== ) return true;//row
         cnt = ;
         for( int j=;j<=;j++ ){
             if( vis[j][i]==true )
                 cnt++;
             else
                 break;
         }
         if( cnt== ) return true;//col
     }
     cnt = ;
     for( int i=;i<=;i++ )
         if( vis[i][i]==true )
             cnt++;
         else
             break;
     if( cnt== ) return true;//dia
     if( vis[][]==true&&vis[][]==true&&vis[][]==true&&vis[][]==true )
         return true;
     return false;
 }
 
 int main(){
     int n;
     scanf("%d",&n);
     while( n-- ){
         init();
         for( int i=;i<=;i++ ){
             if( i!= ){
                 for( int j=;j<=;j++ ){
                     scanf("%d",&mat[i][j]);
                     num[ mat[i][j] ].x = i;
                     num[ mat[i][j] ].y = j;
                     appear[ mat[i][j] ] = true;
                 }
             }
             else{
                 for( int j=;j<=;j++ ){
                     scanf("%d",&mat[i][j]);
                     num[ mat[i][j] ].x = i;
                     num[ mat[i][j] ].y = j;
                     appear[ mat[i][j] ] = true;
                 }
                 for( int j=;j<=;j++ ){
                     scanf("%d",&mat[i][j]);
                     num[ mat[i][j] ].x = i;
                     num[ mat[i][j] ].y = j;
                     appear[ mat[i][j] ] = true;
                 }
             }
         }
         int ans = ;
         int in_num;
         bool flag = false;
         //printf("input\n");
         for( int i=;i<=;i++ ){
             scanf("%d",&in_num);
             if( flag==false ) ans++;
             if( appear[ in_num ]==true ){
                 vis[ num[ in_num ].x ][ num[ in_num ].y ] = true;
                 if( judge()==true ){
                     flag=true;
                 }
             }
         }
         printf("BINGO after %d numbers announced\n",ans);
     }
     return ;
 }