4619——Warm up 2

來源:互聯網
上載者:User

 並查集

 

#include<iostream>#include<cstring>#include<cstdio>using namespace  std;int map[110][110];int father[2100];int vis[2100];int getfather(int x){while(father[x]!=-1){x=father[x];}return x;}void Union(int x,int y){int fx=getfather(x);int fy=getfather(y);if(fx!=fy)father[fx]=fy;}int main(){    int n,m;    int x,y;    while (~scanf("%d%d",&n,&m)&&n+m)    {        memset(map,0,sizeof(map));        memset(father,-1,sizeof(father));        memset(vis,0,sizeof(vis));        for (int i = 1; i <= n; i++)        {            scanf("%d%d",&x,&y);            map[x][y]=i;        }        for (int i = n+1; i <= n+m; i++)        {            scanf("%d%d",&x,&y);            if (map[x][y])Union(map[x][y],i);            if (x>0&&map[x-1][y])            Union(map[x-1][y],i);            y++;            if (map[x][y])    Union(map[x][y],i);            if (x>0&&map[x-1][y])    Union(map[x-1][y],i);        }        for(int i=1;i<=n+m;i++)        vis[getfather(i)]++;       int ans=0;       for(int i=1;i<=n+m;i++)ans+=vis[i]/2;ans=n+m-ans;printf("%d\n",ans);    }    return 0;}

 

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.