attention:set<pair<int,int>>可以直接比较；
另外，由于这个矩阵实际上是读取逻辑上下颠倒了一下，从S开始即可；
暴力遍历所有的小矩阵块；
代码如下：
#include<iostream>
#include<set>
#include<vector>using namespace std;
int n,L,S;
set<pair<int,int>> trees;int main(){cin >> n >> L >> S;for(int i = 0;i < n;i++){int x,y;cin >> x >> y;pair<int,int> tr = {x,y};trees.insert(tr);}vector<vector<int>> mp(S+2,vector<int>(S+2));for(int i = 0;i <= S;i++){for(int j = 0;j <=S;j++){cin >> mp[i][j];}}int res = 0;bool isHere = true;;for(auto e:trees){isHere = true;int x = e.first;int y = e.second;for(int i = S;i >= 0;i--){for(int j = 0;j <= S;j++){if(x+S-i > L || y+j > L){isHere = false;break;}pair<int,int> temp = {x+S-i,y+j};if(trees.count(temp) == 0 && mp[i][j] == 1){isHere = false;break;}else if(trees.count(temp) == 1&&mp[i][j]==0){isHere = false;break;}}if(!isHere){break;}}if(isHere){res++;}}cout << res<<endl;
}