寻宝！大冒险！

#include<iostream>
#include<map>
using namespace std;
int a[1005][2] = { 0 };
int b[52][52] = { 0 };
map<int, map<int, int>>mp;

int main() {
    int n, l, s;
    cin >> n >> l >> s;
    for (int i = 0; i < n; i++) {
        cin >> a[i][0] >> a[i][1];
        mp[a[i][0]][a[i][1]] = 1;
    }
    for (int i = s; i >= 0; i--) {
        for (int j = 0; j <= s; j++) {
            cin >> b[i][j];
        }
    }
    int cnt = 0;
    for (int k = 0; k < n; k++) {
        bool flag = 1;
        int x = a[k][0];
        int y = a[k][1];
        for (int i = 0; i <= s; i++) {
            for (int j = 0; j <= s; j++) {
                if (x + i > l || y + j > l || b[i][j] != mp[x + i][y + j]) {
                    flag = 0;
                    goto L1;
                }
            }
        }
L1:
        if (flag) { cnt++; }
    }
    cout << cnt << endl;
}

这边要用

而不是

（弄了好久。。。）