Submission #1069334
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5+10;
int fa1[N],fa2[N];
int findroot1(int u)
{
return fa1[u]==u?u:fa1[u]=findroot1(fa1[u]);
}
int findroot2(int u)
{
return fa2[u]==u?u:fa2[u]=findroot2(fa2[u]);
}
set<int>s2[N];
int ans[N];
int main()
{
int n,k,l;
int u,v;
// freopen("in.txt","r",stdin);
scanf("%d%d%d",&n,&k,&l);
for(int i=1;i<=n;i++) fa1[i]=fa2[i]=i;
for(int i=1;i<=k;i++)
{
scanf("%d%d",&u,&v);
int uu=findroot1(u);
int vv=findroot1(v);
if(uu==vv) continue;
else fa1[vv]=uu;
}
for(int i=1;i<=l;i++)
{
scanf("%d%d",&u,&v);
int uu=findroot2(u);
int vv=findroot2(v);
if(uu==vv) continue;
else fa2[vv]=uu;
}
for(int i=1;i<=n;i++)
{
v=findroot2(i);
s2[v].insert(i);
}
for(int i=1;i<=n;i++)
{
if(!s2[i].empty())
{
map<int,int>mp;
for(auto it:s2[i])
{
int uu=findroot1(it);
mp[uu]++;
}
for(auto it:s2[i])
{
int uu=findroot1(it);
ans[it]=mp[uu];
}
}
}
for(int i=1;i<=n;i++)
{
printf("%d",ans[i]);
if(i!=n) printf(" ");
else printf("\n");
}
return 0;
}
Submission Info
Submission Time |
|
Task |
D - Connectivity |
User |
vjudge1 |
Language |
C++14 (GCC 5.4.1) |
Score |
400 |
Code Size |
1363 Byte |
Status |
AC |
Exec Time |
129 ms |
Memory |
23808 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:21: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:25:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&u,&v);
^
./Main.cpp:33:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&u,&v);
^
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
400 / 400 |
Status |
|
|
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 |
9600 KB |
subtask0_1.txt |
AC |
14 ms |
9600 KB |
subtask0_2.txt |
AC |
14 ms |
9600 KB |
subtask1_0.txt |
AC |
43 ms |
9728 KB |
subtask1_1.txt |
AC |
96 ms |
21376 KB |
subtask1_10.txt |
AC |
45 ms |
9728 KB |
subtask1_11.txt |
AC |
90 ms |
19968 KB |
subtask1_12.txt |
AC |
112 ms |
22528 KB |
subtask1_13.txt |
AC |
124 ms |
23808 KB |
subtask1_14.txt |
AC |
100 ms |
18944 KB |
subtask1_2.txt |
AC |
95 ms |
19840 KB |
subtask1_3.txt |
AC |
124 ms |
23680 KB |
subtask1_4.txt |
AC |
102 ms |
19456 KB |
subtask1_5.txt |
AC |
63 ms |
9856 KB |
subtask1_6.txt |
AC |
86 ms |
19328 KB |
subtask1_7.txt |
AC |
123 ms |
23808 KB |
subtask1_8.txt |
AC |
129 ms |
23808 KB |
subtask1_9.txt |
AC |
93 ms |
17536 KB |