#include<bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define PII pair<int,int >
#define int long long
#define IOS std::ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
using namespace std;
const int N = 1e6+10;
int acc[N];
int n,m,p,q;
int a,b;
int sum1,sum2;
int find(int x)
{
if(acc[x]==x) return x;
else return acc[x]=find(acc[x]);
}
signed main()
{
IOS;
cin>>n>>m>>p>>q;
for(int i=1;i<=n+m;i++) acc[i]=i;
for(int i=1;i<=p;i++)
{
cin>>a>>b;
int t1=find(a),t2=find(b);
acc[t1]=t2;
}
for(int i=1;i<=q;i++)
{
cin>>a>>b;
a*=-1;b*=-1;
int t3=find(a+n),t4=find(b+n);
acc[t3]=t4;
}
for(int i=1;i<=n;i++)
{
if(find(i)==find(1))
sum1++;
}
for(int i=1+n;i<=n+m;i++)
{
if(find(i)==find(n+1))
sum2++;
}
cout<<min(sum1,sum2);
return 0;
}
朋友C++
于 2024-07-30 16:12:45 首次发布