POJ 2443 位压缩加速

#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <stack>
#include <string>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;

typedef  long long LL;
const double PI = acos(-1.0);

template <class T> inline  T MAX(T a, T b){if (a > b) return a;return b;}
template <class T> inline  T MIN(T a, T b){if (a < b) return a;return b;}

const int N = 111;
const int M = 11111;
const LL MOD = 1000000007LL;
const int dir[4][2] = {1, 0, -1, 0, 0, -1, 0, 1};
const int INF = 0x3f3f3f3f;

int g[40][10100];

int main()
{
int n;
while (scanf("%d", &n) != EOF)
{
memset(g, 0, sizeof(g));
int p, cnt = 0, a, b, i, q, j, k;
p = 1;
for (i = 1; i <= n; ++i)
{
if (i % 30 == 0) {p = 1;cnt++;}
scanf("%d", &k);
for (j = 1; j <= k; ++j)
{
scanf("%d", &a);
g[cnt][a] |= p;
}
p <<= 1;
}
scanf("%d", &q);
for (i = 0; i < q; ++i)
{
scanf("%d%d", &a, &b);
int f = 0;
for (j = 0; j <= cnt; ++j)
{
if (g[j][a] & g[j][b]) break;
}
if (j != cnt + 1)
{
printf("Yes\n");
}
else
{
printf("No\n");
}
}
}
return 0;
}