第二十六次csp认证-寻宝！大冒险！

#include<bits/stdc++.h>

using namespace std;

int main() {
    int n, L, s;
    cin >> n >> L >> s;
    vector<pair<int, int>> v(n);
    set<pair<int, int>> set;
    for (int i = 0; i < n; i++) {
        cin >> v[i].first >> v[i].second;
        set.insert(v[i]);
    }
    vector<vector<int>> f(s + 1, vector<int>(s + 1));
    for (int i = s; i >= 0; i--) {
        for (int j = 0; j <= s; j++) {
            cin >> f[i][j];

        }

    }

    int ret = 0;
    for (int i = 0; i < n; i++) {
        int r = v[i].first;
        int c = v[i].second;
        bool check = true;
//        若当前点开始的矩阵不足以包含整个藏宝图
        if (r + s > L || c + s > L)
            check = false;
        for (int j = r, tr = 0; j <= r + s && check && tr <= s; j++, tr++) {
            for (int k = c, tc = 0; k <= c + s && check && tc <= s; k++, tc++) {
                if (f[tr][tc]) {
                    if (set.find({j, k}) == set.end()) {
                        check = false;

                    }

                } else {
                    if (set.find({j, k}) != set.end()) {
                        check = false;

                    }


                }

            }

        }
        if (check)
            ret++;

    }
    cout << ret;

    return 0;
}