poj 2443 Set Operation 位运算

这个题目  是有一定价值的   以后学会这么搞了；哈哈    

#include<iostream>
#include<stdio.h>
#include<cstring>
#include<algorithm>
using namespace std;

int arr[10001][34];

int main( )
{
    int i,j,N,M,C,u,v,val;
    while( scanf("%d",&N) != EOF )
    {
        memset( arr,0,sizeof(arr) );
        for( j = 0; j < N; j++ )
        {
             scanf("%d",&C);
             for( i = 1; i <= C; i++ )
             {
                 scanf("%d",&val);
                 int bit = (1<<(j%32));
                 if( (arr[val][j/32]  & bit)  == 0 )
                     arr[val][j/32] += bit;
             }
        }
        scanf("%d",&M);
        for( i = 1; i <= M; i++ )
        {
            scanf("%d%d",&u,&v);
            for( j = 0; j <= 32; j++ )
            if( arr[u][j]&arr[v][j] )
            {
                printf("Yes\n");
                break;
            }
            if( j > 32 )printf("No\n");
        }
    }
    return 0;
}