题解：P13911 [CSPro 26] 寻宝！大冒险！

#include <iostream>
#include <vector>
#include <unordered_set>
#include <string>
using namespace std;

struct PairHash {
    size_t operator()(const pair<int, int>& p) const {
        return static_cast<size_t>(p.first) * 1000000007 + p.second;
    }
};

int main() {
    int n, L, S;
    cin >> n >> L >> S;
    vector<pair<int, int>> points(n);
    unordered_set<pair<int, int>, PairHash> trees;
    for (int i = 0; i < n; i++) {
        cin >> points[i].first >> points[i].second;
        trees.insert(points[i]);
    }
    
    vector<vector<int>> B(S+1, vector<int>(S+1));
    for (int i = S; i >= 0; i--) {
        for (int j = 0; j <= S; j++) {
            cin >> B[i][j];
        }
    }
    
    int count = 0;
    for (const auto& p : points) {
        int x = p.first, y = p.second;
        if (x + S > L || y + S > L) {
            continue;
        }
        bool valid = true;
        for (int i = 0; i <= S; i++) {
            for (int j = 0; j <= S; j++) {
                int nx = x + i, ny = y + j;
                bool hasTree = trees.find({nx, ny}) != trees.end();
                if (B[i][j] == 1) {
                    if (!hasTree) {
                        valid = false;
                        break;
                    }
                } else {
                    if (hasTree) {
                        valid = false;
                        break;
                    }
                }
            }
            if (!valid) break;
        }
        if (valid) {
            count++;
        }
    }
    cout << count << endl;
    return 0;
}