Submission #1441223
Source Code Expand
#include<iostream>
#include<cstdio>
#include<set>
#include<map>
using namespace std;
map<pair<int ,int> ,int>mp;
int par[400010],rk[400010];
int s[400010];
int n,k,l;
int root(int x)
{
if(par[x]==x)return x;else return par[x]=root(par[x]);
}
void un(int x,int y)
{
x=root(x);y=root(y);
if(x==y)return;
if(rk[x]<rk[y])
{
par[x]=y;
s[y]+=s[x];
}
else
{
if(rk[x]==rk[y])rk[x]++;
par[y]=x;
s[x]+=s[y];
}
}
int main()
{
scanf("%d%d%d",&n,&k,&l);
for(int i=1;i<=n+n;i++)par[i]=i,s[i]=1;
for(int i=1;i<=k;i++)
{
int x,y;
scanf("%d%d",&x,&y);
un(x,y);
}
for(int i=1;i<=l;i++)
{
int x,y;
scanf("%d%d",&x,&y);
un(x+n,y+n);
}
for(int i=1;i<=n;i++)
{
mp[make_pair(root(i),root(i+n))]++;
}
for(int i=1;i<=n;i++)
{
printf("%d ",mp[make_pair(root(i),root(i+n))]);
}
return 0;
}
Submission Info
Submission Time |
|
Task |
D - Connectivity |
User |
ASSWECAN |
Language |
C++14 (GCC 5.4.1) |
Score |
400 |
Code Size |
867 Byte |
Status |
AC |
Exec Time |
156 ms |
Memory |
16256 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:32:26: 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:37:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&x,&y);
^
./Main.cpp:43:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&x,&y);
^
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 |
2 ms |
2304 KB |
subtask0_1.txt |
AC |
2 ms |
2304 KB |
subtask0_2.txt |
AC |
2 ms |
2304 KB |
subtask1_0.txt |
AC |
29 ms |
2304 KB |
subtask1_1.txt |
AC |
156 ms |
16256 KB |
subtask1_10.txt |
AC |
31 ms |
2304 KB |
subtask1_11.txt |
AC |
138 ms |
14592 KB |
subtask1_12.txt |
AC |
84 ms |
13952 KB |
subtask1_13.txt |
AC |
89 ms |
15232 KB |
subtask1_14.txt |
AC |
89 ms |
11520 KB |
subtask1_2.txt |
AC |
72 ms |
11008 KB |
subtask1_3.txt |
AC |
91 ms |
15232 KB |
subtask1_4.txt |
AC |
92 ms |
12544 KB |
subtask1_5.txt |
AC |
31 ms |
2304 KB |
subtask1_6.txt |
AC |
132 ms |
13696 KB |
subtask1_7.txt |
AC |
89 ms |
15232 KB |
subtask1_8.txt |
AC |
94 ms |
15360 KB |
subtask1_9.txt |
AC |
79 ms |
8960 KB |