Submission #1069287


Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#define MP make_pair
#define PB push_back
typedef long long LL;
typedef pair<int,int> PII;
const double eps=1e-8;
const double pi=acos(-1.0);
const int K=2*1e5+7;
const int mod=1e9+7;

int n,k,l;
int f[K],g[K],vis[K];
vector<int >mp[K],cp[K];
map<PII,int>ans;

int fd(int x,int *p)
{
    return x==p[x]?x:fd(p[x],p);
}
void dfs1(int x,int ss)
{
    for(int i=0;i<mp[x].size();i++)
    if(!vis[mp[x][i]])
        f[mp[x][i]]=ss,vis[mp[x][i]]=1,dfs1(mp[x][i],ss);
}
void dfs2(int x,int ss)
{
    for(int i=0;i<cp[x].size();i++)
    if(!vis[cp[x][i]])
        g[cp[x][i]]=ss,vis[cp[x][i]]=1,dfs2(cp[x][i],ss);
}
int main(void)
{

    cin>>n>>k>>l;
    for(int i=1;i<=n;i++)
        f[i]=g[i]=i;
    for(int i=1,x,y;i<=k;i++)
        scanf("%d%d",&x,&y),mp[x].PB(y),mp[y].PB(x);
    for(int i=1,x,y;i<=l;i++)
        scanf("%d%d",&x,&y),cp[x].PB(y),cp[y].PB(x);

    memset(vis,0,sizeof(vis));
    for(int i=1;i<=n;i++)
    if(!vis[i])
            vis[i]=1,dfs1(i,i);
    memset(vis,0,sizeof(vis));
    for(int i=1;i<=n;i++)
    if(!vis[i])
            vis[i]=1,dfs2(i,i);
    for(int i=1;i<=n;i++)
        ans[MP(fd(i,f),fd(i,g))]++;
    for(int i=1;i<=n;i++)
        printf("%d%c",ans[MP(fd(i,f),fd(i,g))],i==n?'\n':' ');
    return 0;
}

Submission Info

Submission Time
Task D - Connectivity
User vjudge1
Language C++14 (GCC 5.4.1)
Score 400
Code Size 1285 Byte
Status AC
Exec Time 171 ms
Memory 28672 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:43:52: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&x,&y),mp[x].PB(y),mp[y].PB(x);
                                                    ^
./Main.cpp:45:52: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&x,&y),cp[x].PB(y),cp[y].PB(x);
                                                    ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 3
AC × 18
Set Name Test Cases
Sample subtask0_0.txt, subtask0_1.txt, subtask0_2.txt
All subtask0_0.txt, subtask0_1.txt, subtask0_2.txt, subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt
Case Name Status Exec Time Memory
subtask0_0.txt AC 14 ms 10368 KB
subtask0_1.txt AC 14 ms 10368 KB
subtask0_2.txt AC 14 ms 10368 KB
subtask1_0.txt AC 52 ms 13056 KB
subtask1_1.txt AC 171 ms 26368 KB
subtask1_10.txt AC 55 ms 13312 KB
subtask1_11.txt AC 165 ms 24832 KB
subtask1_12.txt AC 145 ms 27136 KB
subtask1_13.txt AC 143 ms 28160 KB
subtask1_14.txt AC 150 ms 25984 KB
subtask1_2.txt AC 123 ms 23936 KB
subtask1_3.txt AC 146 ms 28288 KB
subtask1_4.txt AC 152 ms 27008 KB
subtask1_5.txt AC 56 ms 13184 KB
subtask1_6.txt AC 153 ms 24064 KB
subtask1_7.txt AC 141 ms 28288 KB
subtask1_8.txt AC 149 ms 28672 KB
subtask1_9.txt AC 133 ms 23040 KB