题意:一个僵尸一次只能向下或向右走一个,现在在 n ∗ m n*m n∗m的地图上埋有一些土豆地雷,僵尸无法通过土豆地雷,问僵尸能到达的格子有几个·
解法:暴力?
记录上一次询问可达区间
[
l
1
,
r
1
]
[l_1,r_1]
[l1,r1]和当前询问行没有地雷的可行区间
[
l
2
,
r
2
]
[l_2,r_2]
[l2,r2],当前行可行区间如果和上一行的某个可达区间可以连通,则这行可到达的点增加
r
2
−
m
a
x
(
l
1
,
l
2
)
+
1
r_2-max(l_1,l_2)+1
r2−max(l1,l2)+1个,记录可以增加答案的可行区间
[
m
a
x
(
l
1
,
l
2
)
,
r
]
[max(l_1,l_2),r]
[max(l1,l2),r]以用作下一行的可达区间
AcCode:
#include <iostream>
#include <algorithm>
#include <vector>
#define int long long
#define pint std::pair<long long,long long>
#define vec_iter std::vector<pint>::iterator
const int N = 7e5 + 100;
std::vector<pint> vec1, vec2;
std::vector<int> rem[N];
inline int max(int a, int b) { return (a > b) ? a : b; }
inline bool check(pint a, pint b) {
if (a.first >= b.first && a.first <= b.second) return true;
if (a.second >= b.first && a.second <= b.second) return true;
if (a.first >= b.first && a.second <= b.second) return true;
if (a.first <= b.first && a.second >= b.second) return true;
return false;
}
signed main() {
int t; scanf("%lld", &t);
while (t--) {
int n, m, cnt, ans = 0; scanf("%lld %lld %lld", &n, &m, &cnt);
for (int x, y, i = 1; i <= cnt; i++) {
scanf("%lld %lld", &x, &y);
rem[x].push_back(y);
}
vec1.clear();
vec2.clear();
vec1.push_back(std::make_pair(1, 1));
for (int i = 1; i <= n; i++) {
std::vector<pint> temp;
if (rem[i].empty()) vec2.push_back(std::make_pair(1, m));
else {
std::sort(rem[i].begin(), rem[i].end());
if (rem[i][0] != 1) vec2.push_back(std::make_pair(1, rem[i][0] - 1));
int sz = rem[i].size();
int last = rem[i][0];
for (int j = 1; j < sz; j++) {
if (rem[i][j] == last + 1) {
last++;
continue;
}
else {
vec2.push_back(std::make_pair(last + 1, rem[i][j] - 1));
last = rem[i][j];
}
}
if (last != m) vec2.push_back(std::make_pair(last + 1, m));
}
vec_iter iter1 = vec1.begin();
vec_iter iter2 = vec2.begin();
while (iter1 != vec1.end() && iter2 != vec2.end()) {
if (check(*iter1, *iter2)) {
int lef = max(iter1->first, iter2->first);
ans = ans + (long long)(iter2->second - lef + 1ll);
temp.push_back(std::make_pair(lef, iter2->second));
iter2++;
}
else if (iter1->second < iter2->first) iter1++;
else iter2++;
}
vec2.clear();
vec1.clear();
for (auto& v : temp) vec1.push_back(v);
rem[i].clear();
}
printf("%lld\n", ans);
}
}