poj 2443

最新推荐文章于 2020-02-25 12:56:04 发布

::Dash::

最新推荐文章于 2020-02-25 12:56:04 发布

阅读量590

点赞数

分类专栏： poj

本文链接：https://blog.csdn.net/cyxhahaha/article/details/45030775

版权

poj 专栏收录该内容

39 篇文章 0 订阅

订阅专栏

判断两个元素是否在同一集合。

solution: 每个元素开hash记录该元素在那些集合内，压位+位运算优化即可~

#include<cstdio>
#include<cstdlib>
#include<algorithm>

const int MAXN = 1005, MAXM = 1e4+5;

int n, s, Q;
int ins[MAXM][40] = {0};

int main()
{
#ifndef ONLINE_JUDGE
    freopen("poj2443.in","r",stdin);
    freopen("poj2443.out","w",stdout);
#endif

    scanf("%d",&n); s = n/30 + (int)(n%30!=0);

    for(int i = 1, ci; i <= n; i++)
    {
       scanf("%d",&ci);
       int s1 = i/30, s2 = i%30;
       for(int j = 1, p; j <= ci; j++)
         {scanf("%d",&p); ins[p][s1] |= 1 << s2;}
    }
    scanf("%d",&Q);
    while(Q--)
    {
       int x,y;
       bool flag = false;

       scanf("%d%d",&x,&y);
       for(int i = 0; i <= s; i++)
         if(ins[x][i]&ins[y][i])
         {flag = true; break;}

       puts(flag?"Yes":"No");
    }

#ifndef ONLINE_JUDGE
    fclose(stdin);
    fclose(stdout);
#endif
    return 0;
}