思路:
写一个判断是否在矩形内的函数,只需要判断再矩形外取反即可
对每一组数据进行判断,
设置标志位has_in,判断某个人是否已经被统计过,
如果存在在矩形内的点,且还未被统计(标志位为0),则pass++,且标志位置为1
设置标志位has_stay,判断某个人是否已经逗留,在矩形内时将s值自增1,如果s值大于阈值k且has_stay=0,则stay++,且将标志位置为0
时间复杂度
O
(
n
t
)
O(nt)
O(nt),空间复杂度
O
(
1
)
O(1)
O(1)
#include <bits/stdc++.h>
using namespace std;
int n, k, t, xl, yd, xr, yu, pass, stay;
bool out(int x, int y) {
return x < xl || x > xr || y < yd || y > yu;
}
int main() {
scanf("%d %d %d %d %d %d %d", &n, &k, &t, &xl, &yd, &xr, &yu);
for(int i = 1; i <= n; i++) {
for(int j = 1, s = 0, has_in = 0, has_stay = 0, x, y; j <= t; j++) {
scanf("%d %d", &x, &y);
if(!out(x, y)) {
if(0 == has_in) pass++, has_in = 1;
s = s + 1;
if(0 == has_stay && s >= k) stay++, has_stay = 1;
} else s = 0;
}
}
printf("%d\n%d\n", pass, stay);
return 0;
}