-
首先这个题1e9的数据量肯定不可以直接把图模拟出来,考虑进行位置的匹配,对于每一个可能的树,我都进行图的匹配,用
map
记录对应位置有没有宝藏,要求必须两种同时有或者没有才算一个藏宝点 -
最终复杂度约为,约是2e7的数量级,可以过掉这个题
#include <bits/stdc++.h>
#define endl '\n'
typedef long long ll;
using namespace std;
const int N = 5e1 + 5;
int data[N][N];
map <pair<int, int>, int> point;
map <pair<int, int>, int> value;
void solve() {
int n, L, S; cin >> n >> L >> S;
for (int i = 0; i < n; ++i) {
int x, y; cin >> x >> y;
point[make_pair(x, y)] = 1;
}
for (int i = S; i >= 0; --i) {
for (int j = 0; j <= S; ++j) {
cin >> data[i][j];
if (data[i][j] == 1) {
value[make_pair(i, j)] = 1;
}
}
}
int cnt = 0;
for (auto i : point) {
bool flag = true;
int x = i.first.first;
int y = i.first.second;
if (x + S <= L && y + S <= L) {
for (int j = 0; j <= S; ++j) {
for (int k = 0; k <= S; ++k) {
int xx = x + j; int yy = y + k;
bool exist1 = (point.find(make_pair(xx, yy)) != point.end()
&& value.find(make_pair(j, k)) != value.end());
bool exist2 = (point.find(make_pair(xx, yy)) == point.end()
&& value.find(make_pair(j, k)) == value.end());
if (!exist1 && !exist2) {
flag = false;
goto there;
}
}
}
} else {
flag = false;
}
there:
if (flag) cnt ++;
}
cout << cnt << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
}