202206-2 寻宝！大冒险

C++:

#pragma GCC target ("avx")
#pragma GCC optimize (2, 3, "Ofast", "inline", "-ffast-math")
#include<iostream>
#include<set>
#include<algorithm>
// #define first x;
// #define second y;
using namespace std;
typedef pair<int, int> PII;
const int N = 1010;
PII A[N];
int B[55][55];
set<PII> Set;
int n, l, s;
bool check(int x, int y){
    if(x + s > l || y + s > l) return false;
    for(int j = 0; j <= s; j++){
        for(int k = 0; k <= s; k++){
            int xx = x + j, yy = y + k;
            if((Set.count({xx, yy}) ^ B[j][k])){
                return false;
            }
        }
    }
    return true;
}
int main()
{
    
    int x, y;
    scanf("%d%d%d", &n, &l, &s);
    for(int i = 1; i <= n; i++){
        scanf("%d%d", &x, &y);
        A[i] = {x, y};
        Set.insert(A[i]);
    }
    for(int i = s; i >= 0; i--){
        for(int j = 0; j <= s; j++){
            scanf("%d", &B[i][j]);
        }
    }
    int res = 0;
    for(int i = 1; i <= n; i++){
        bool flag = true;
        x = A[i].first, y = A[i].second;
        flag = check(x, y);
        if(flag) {
            res++;
        }
    }
    cout << res << endl;
}