Submission #1069593

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
int bcj1[200010],bcj2[200010];
int father1(int k)
{
    return bcj1[k]==k?k:bcj1[k]=father1(bcj1[k]);
}
void join1(int x,int y)
{
    int fa,fb;
    fa=father1(x);fb=father1(y);
    bcj1[fb]=fa;
}
int father2(int k)
{
    return bcj2[k]==k?k:bcj2[k]=father2(bcj2[k]);
}
void join2(int x,int y)
{
    int fa,fb;
    fa=father2(x);fb=father2(y);
    bcj2[fb]=fa;
}
struct haha
{
    int p,q,no,ans;
}pp[200010];
bool cmp1(haha a,haha b)
{
    if (a.p==b.p) return a.q<b.q;
    return a.p<b.p;
}
bool cmp2(haha a,haha b)
{
    return a.no<b.no;
}
int main()
{
    int n,k,l,a,b,i,j,m,cnt;
    cin>>n>>k>>l;
    for(i=1;i<=n;i++)
    {
        bcj1[i]=bcj2[i]=i;
        pp[i].ans=0;pp[i].no=i;
    }
    for(i=1;i<=k;i++)
    {
        scanf("%d%d",&a,&b);
        join1(a,b);
    }
    for(i=1;i<=l;i++)
    {
        scanf("%d%d",&a,&b);
        join2(a,b);
    }
    for(i=1;i<=n;i++)
    {
        bcj1[i]=father1(bcj1[i]);
        pp[i].p=bcj1[i];
        bcj2[i]=father2(bcj2[i]);
        pp[i].q=bcj2[i];
    }
    sort(pp+1,pp+1+n,cmp1);cnt=0;
    pp[0].p=pp[0].q=0;j=1;
    for(i=1;i<=n+1;i++)
    {
        if (i<=n && pp[i].p==pp[i-1].p && pp[i].q==pp[i-1].q) continue;
        for(m=j;m<=i-1;m++)
            pp[m].ans=i-j;
        j=i;
    }
    sort(pp+1,pp+1+n,cmp2);
    for(i=1;i<=n;i++)
        printf("%d ",pp[i].ans);
    cout<<endl;
    return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:48:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&a,&b);
                            ^
./Main.cpp:53:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&a,&b);
                            ^

Judge Result