Submission #1440641


Source Code Expand

#include<iostream>
using namespace std;
int n,k,l;
int a[200005],b[200005],c[200005],s,i,j,x,y;
int gf1(int p){
	if(a[p]!=p)return a[p]=gf1(a[p]);
}
int gf2(int p){
	if(b[p]!=p)return b[p]=gf2(b[p]);
}
int main(){
	cin>>n>>k>>l;
	for(i=1;i<=n;i++){
		a[i]=i;
		b[i]=i;
	}
	for(i=1;i<=k;i++){
		cin>>x>>y;
		a[y]=x;
	}
	for(i=1;i<=l;i++){
		cin>>x>>y;
		b[y]=x;
	}
	for(i=1;i<=n;i++){
		 gf1(i);
		 gf2(i);
	}
	for(i=1;i<=n-1;i++){
		for(j=i+1;j<=n;j++){
			if(a[i]==a[j]&&b[i]==b[j])c[i]++,c[j]++;
		}
		cout<<c[i]+1<<" ";
	}
	cout<<c[n]+1;
}

Submission Info

Submission Time
Task D - Connectivity
User vjudge1
Language C++14 (GCC 5.4.1)
Score 0
Code Size 542 Byte
Status WA
Exec Time 2103 ms
Memory 1792 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
WA × 3
WA × 6
TLE × 12
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 WA 1 ms 256 KB
subtask0_1.txt WA 1 ms 256 KB
subtask0_2.txt WA 1 ms 256 KB
subtask1_0.txt WA 105 ms 256 KB
subtask1_1.txt TLE 2103 ms 1792 KB
subtask1_10.txt WA 111 ms 256 KB
subtask1_11.txt TLE 2103 ms 1664 KB
subtask1_12.txt TLE 2103 ms 1664 KB
subtask1_13.txt TLE 2103 ms 1792 KB
subtask1_14.txt TLE 2103 ms 1536 KB
subtask1_2.txt TLE 2103 ms 1408 KB
subtask1_3.txt TLE 2103 ms 1792 KB
subtask1_4.txt TLE 2103 ms 1536 KB
subtask1_5.txt WA 112 ms 256 KB
subtask1_6.txt TLE 2103 ms 1536 KB
subtask1_7.txt TLE 2103 ms 1792 KB
subtask1_8.txt TLE 2103 ms 1792 KB
subtask1_9.txt TLE 2103 ms 1280 KB