2025寒假专场5

#include<bits/stdc++.h>
using namespace std;
const int mxv = 2e5 + 9;
#define int long long
int w, h, n;
pair<int, int> p[mxv];
int a[mxv],b[mxv],cnta,cntb;
map<pair<int,int>, int> mp;
void solve(){
	cin >> w >> h >> n;
	for(int i = 1;i <= n; i++) cin >> p[i].first >> p[i].second;// 草莓位置 
	cin >> cnta;
	for(int i = 1; i <= cnta; i++) cin >> a[i];  
	cin >> cntb;
	for(int i = 1; i <= cntb; i++) cin >> b[i];
	
	a[++cnta] = w; b[++cntb] = h;
	
	sort(a + 1, a + 1 + cnta);
	sort(b + 1, b + 1 + cntb);
	
	for(int i = 1; i <= n; i++){
		int x = p[i].first, y = p[i].second;
		int xx = lower_bound(a + 1, a + 1 + cnta, x) - a;
		int yy = lower_bound(b + 1, b + 1 + cntb, y) - b;
		mp[{xx, yy}]++;
	}
	
	int min1 = 1e18, max1 = -1e18, cnt = 0;
	for(auto t: mp){
		int y = t.second;
		min1 = min(min1, y);
		max1 = max(max1, y);
		cnt++;
	}
	if(cnt < cnta * cntb) min1 = 0;
	cout << min1 << " " << max1 << "\n";
	return;
}
signed main(){
	int t=1;
	while(t--) solve();
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int n, m, k, q;
int fa[N];
map< pair<int, int>, int > mp;

int find(int x){
	if(x != fa[x]) return fa[x] = find(fa[x]);
	return x;
}

void merge(int u, int v){
	u = find(u), v = find(v);
	if(u != v) fa[u] = v;
}

void solve(){
	scanf("%d%d", &n, &m);
	for(int i = 1; i <= n; i++) fa[i] = i;
	for(int u, v, i = 1; i <= m; i++){
		scanf("%d%d", &u, &v);
		if(u == v) continue;
		merge(u, v);
	}
	
	scanf("%d", &k);
	
	for(int x, y, i = 1; i <= k; i++){
		scanf("%d%d", &x, &y);
		int xx = find(x), yy = find(y);
		mp[{xx, yy}] = -1;
	}
	
	scanf("%d", &q);
	while(q--){
		int x, y;
		scanf("%d%d", &x, &y);
		int xx = find(x), yy = find(y);
		if(mp[{xx, yy}] != -1 && mp[{yy, xx}] != -1)	
			puts("Yes");
		else
			puts("No"); 
	}
}
int main(){
	solve();
	return 0;
}