ABC304 - D - A Piece of Cake

0x00 Link

• D - A Piece of Cake

• Source - AtCoder

• Tag - 芝士水题

• Time - $\ast$

0x01 Source Code

// 很奇怪的题，A * B = 4e10，3s 根本跑不完 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define IOS ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

const int N = 2e5 + 6;
struct A {
	int x, y;
}in[N];
int a[N], b[N];

map<pair<int, int>, int> mp;

void solve() {
	int w, h, n;
	cin >> w >> h >> n;
	for (int i = 1; i <= n; i++) {
		int x, y;
		cin >> x >> y;
		in[i] = (A){x, y};
	} 
	
	int cnta;
	cin >> cnta;
	for (int i = 1; i <= cnta; i++) cin >> a[i];
	a[++cnta] = w;
	
	int cntb;
	cin >> cntb;
	for (int i = 1; i <= cntb; i++) cin >> b[i];
	b[++cntb] = h;
	
	int minn = N + 1, maxx = 0;
	for (int i = 1; i <= n; i++) {
		int x = *lower_bound(a + 1, a + cnta + 1, in[i].x);
		int y = *lower_bound(b + 1, b + cntb + 1, in[i].y);
		pair<int, int> p = make_pair(x, y);
		mp[p]++;
		maxx = max(maxx, mp[p]);
	}
	
	if (mp.size() < cnta * cntb) {			// <
		minn = 0;
	} else {
		for (auto it : mp) {
			minn = min(minn, it.second);	// it.second
		}
	}
	
	cout << minn << " " << maxx << endl;
}

signed main() {
	IOS
	int t = 1;
//	cin >> t;
	while (t--) solve();
	return 0;
}

0x10 Diagram

• Sample 1

0x11 Reference

• D - A Piece of Cake Editorial by en_translator
• 图解lower_bound&upper_bound

---

作者 | 乐意奥AI