提出 #41971110

---

ソースコード 拡げる

#include<bits/stdc++.h>
#define ff first
#define ss second
#define all(vs) vs.begin(), vs.end()

using namespace std;
using pii = pair<int, int>;
using ll = long long;
using pll = pair<ll, ll>;
using ld = long double;

const ll oo = 1e18;
const ll maxn = 2e5 + 100;
const ll mod = 998244353LL;
const double PI = acos(-1);

pll solve(){
    ll w, h, n, a, b;
    cin >> w >> h >> n;

    vector<pii> sta(n);

    for (auto &s: sta) cin >> s.ff >> s.ss;

    cin >> a;
    vector<ll> va(a);
    for (auto &x: va) cin >> x;

    cin >> b;
    vector<ll> vb(b);
    for (auto &x: vb) cin >> x;

    va.push_back(w);
    vb.push_back(h);

    map<pii, ll> mp;

    for (auto stram: sta){
        ll x = lower_bound(all(va), stram.ff) - va.begin();
        ll y = lower_bound(all(vb), stram.ss) - vb.begin();

        mp[pii(x, y)] += 1;
    }

    ll mx = 0, mn = maxn;

    for (auto [p, cnt]: mp){
        mx = max(mx, cnt);
        mn = min(mn, cnt);
    }
    mn = ((ll)mp.size() == (a+1) * (b+1)? mn : 0LL);
    return pll(mn, mx);
}

int main(){
    auto res = solve();
    cout << res.ff << " " << res.ss << endl;
}

提出情報

ジャッジ結果