Submission #41970751

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
    int W, H, N;
    cin >> W >> H >> N;

    vector<pair<int, int>> strawberries(N);
    for (int i = 0; i < N; i++) {
        int p, q;
        cin >> p >> q;
        strawberries[i] = make_pair(p, q);
    }

    int A;
    cin >> A;
    vector<int> a(A);
    for (int i = 0; i < A; i++) {
        cin >> a[i];
    }

    int B;
    cin >> B;
    vector<int> b(B);
    for (int i = 0; i < B; i++) {
        cin >> b[i];
    }

    vector<int> counts;
    for (int i = 0; i <= A; i++) {
        for (int j = 0; j <= B; j++) {
            int count = 0;
            for (int k = 0; k < N; k++) {
                int x = strawberries[k].first;
                int y = strawberries[k].second;
                if (0 < x && x < a[i] && 0 < y && y < b[j]) {
                    count++;
                }
            }
            counts.push_back(count);
        }
    }

    int m = *min_element(counts.begin(), counts.end());
    int M = *max_element(counts.begin(), counts.end());

    cout << m << " " << M << endl;

    return 0;
}

Submission Info

Judge Result