Submission #1069397

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

const int maxn = 200010;
vector<vector<int> > G1(maxn),G2(maxn),G3(maxn);
int N,K,L,ans,ANS[maxn];
int road[maxn];
bool vis1[maxn],vis2[maxn];

void dfs1(int k,int id){
    road[k] = id;
    vis1[k] = true;
    for(int i = 0;i < G1[k].size();++i)
        if(!vis1[G1[k][i]]) dfs1(G1[k][i],id);
}

void dfs2(int k){
    vis2[k] = true;
    ans++;
    for(int i = 0;i < G3[k].size();++i)
        if(!vis2[G3[k][i]]) dfs2(G3[k][i]);
    ANS[k] = ans;
}

int main(){
    scanf("%d%d%d",&N,&K,&L);
    for(int i = 1;i <= K;++i){
        int p,q;
        scanf("%d%d",&p,&q);
        G1[p].push_back(q);
        G1[q].push_back(p);
    }
    for(int i = 1;i <= L;++i){
        int p,q;
        scanf("%d%d",&p,&q);
        G2[p].push_back(q);
        G2[q].push_back(p);
    }

    int id = 1;
    for(int i = 1;i <= N;++i){
        if(!vis1[i]){
            dfs1(i,id);
            id++;
        }
    }
    for(int i = 1;i <= N;++i){
        for(int j = 0;j < G2[i].size();++j){
            if(road[i] == road[G2[i][j]]){
                G3[i].push_back(G2[i][j]);
                G3[G2[i][j]].push_back(i);
            }
        }
    }
    for(int i = 1;i <= N;++i){
        ans = 0;
        if(!vis2[i]) dfs2(i);
    }
    for(int i = 1;i <= N;++i)
        printf("%d ",ANS[i]);

    return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:26:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d",&N,&K,&L);
                             ^
./Main.cpp:29:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&p,&q);
                            ^
./Main.cpp:35:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&p,&q);
                            ^

Judge Result