Submission #41960517

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define int long long
#define pii pair<int, int>
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define trace(x) cout << '>' << #x << ':' << x << "\n"
#define trace2(x,y) cout<< '>' << #x << ':' << x << " | " << #y << ':' << y << "\n"
#define trace3(a,b,c) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<"\n"
#define trace4(a,b,c,d) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<"\n"
template <typename T>
void print(T var){
    cout << var << ' ';
    return;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <bits/stdc++.h>

using namespace std;

#define mp make_pair
#define pb push_back
#define int long long
#define pii pair<int, int>
#define fi first
#define se second
#define all(v) v.begin(), v.end()

#define trace(x) cout << '>' << #x << ':' << x << "\n"
#define trace2(x,y) cout<< '>' << #x << ':' << x << " | " << #y << ':' << y << "\n"
#define trace3(a,b,c) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<"\n"
#define trace4(a,b,c,d) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<"\n"

template <typename T>
void print(T var){
    cout << var << ' ';
    return;
}

template <typename T>
void print(vector <T> var){
    for (auto x: var)
        print(x);
    cout << "\n";
    return;
}

int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
const int mod = 1e9+7;

signed main(){

    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int w, h;
    cin >> w >> h;

    int n;
    cin >> n;

    vector<pair<pii,int>> v(n);
    for (int i = 0; i < n; i++) {
        int a, b;
        cin >> a >> b;
        v[i] = {{a,b},i};
    }

    sort(all(v));

    int A;
    cin >> A;
    int it = -1;
    vector<pii> ans(n,{1e9,1e9});
    for (int i = 0; i < A; i++) {
        int x;
        cin >> x;
        while (it+1<n&&v[it+1].fi.fi<x) {
            it++;
            ans[v[it].se].fi = i;
        }
    }

    for (int i = 0; i < n; i++) {
        swap(v[i].fi.fi, v[i].fi.se);
    }

    sort(all(v));

    int B;
    cin >> B;
    it = -1;
    for (int i = 0; i < B; i++) {
        int y;
        cin >> y;
        while (it+1<n&&v[it+1].fi.fi<y) {
            it++;
            ans[v[it].se].se = i;
        }
    }

    map<pair<int,int>,int> m;
    for (int i = 0; i < n; i++) {
        m[ans[i]]++;
    }

    int mn = INT_MAX, mx = INT_MIN;
    int cnt = 0;
    for (auto it = m.begin(); it != m.end(); it++) {
        cnt++;
        // pii cur = it->first;
        // trace3(cur.fi, cur.se, it->second);
        mn = min(mn, it->second);
        mx = max(mx, it->second);
    }

    if (cnt!=(A+1)*(B+1)) mn = 0;
    cout << mn << ' ' << mx;

}

Submission Info

Judge Result