[POJ 2443] Set Operation (bitset)

 1 #include <cstdio>
 2 #include <bitset>
 3 #include <algorithm>
 4 #include <cstdlib>
 5 #include <iostream>
 6 
 7 using namespace std;
 8 
 9 const int MAX_N = 222222;
10 int N;
11 bitset<1111> bs[MAX_N];
12 
13 int main(){
14     while(scanf("%d",&N)!=EOF){
15         for(int i=0;i<MAX_N;i++) bs[i].reset();
16         for(int i=0;i<N;i++){
17             int a,an;
18             scanf("%d",&an);
19             while( an-- ){
20                 scanf("%d",&a);
21                 bs[a].set(i);
22             }
23         }
24         int M;
25         scanf("%d",&M);
26         while(M--){
27             int a,b;
28             scanf("%d%d",&a,&b);
29             bitset<1111> t = bs[a]&bs[b];
30             if( t.count() ){
31                 puts("Yes");
32             } else {
33                 puts("No");
34             }
35         }
36     }
37 
38     return 0;
39 }