202009-2 风险人群筛查
直接模拟即可
#include <stdio.h>
#include <iostream>
#include <queue>
#include <map>
#include <vector>
#include <algorithm>
#include <cstring>
using namespace std;
typedef long long ll;
void pt(){ cout<<'\n';}
template<class H, class ... T> void pt(H h,T... t){ cout<<" "<<h; pt(t...);}
ll n,k,t,xl,xr,yd,yu;
struct node{
ll x,y;
};
int main(){
cin>>n>>k>>t>>xl>>yd>>xr>>yu;
ll ans1 = 0,ans2 = 0;
for(int i = 1;i<=n;i++){
int ok1 = 0,ok2 = 0,cnt = 0;
for(int j = 1;j<=t;j++){
ll x,y;scanf("%lld %lld",&x,&y);
if(xl <= x&&x<= xr && yd <= y && y <= yu) {
ok1 = 1;
if(++cnt >= k) ok2 = 1;
}else cnt = 0;
}
ans1 += ok1;
ans2 += ok2;
}
printf("%lld\n%lld\n",ans1,ans2);
return 0;
}