【练习记录】 202009-2 风险人群筛查

202009-2 风险人群筛查

#include<iostream>
using namespace std;
int n, k, t, xl, yl, xr, yr;
bool isIn(int x,int y) {
	if (x >= xl && x <= xr && y >= yl && y <= yr) return true;
	return false;
}	
int main()
{
	int x, y;
	bool isCross = 0, isPirorCross = 0;
	int count = 1, maxCount = 0;
	int cross = 0, stay = 0;
	cin >> n >> k >> t >> xl >> yl >> xr >> yr;
	while (n--) {
		for (int i =0;i<t;i++){
			cin >> x >> y;
			if (isIn(x, y)) {
				if (isPirorCross == 1) count++;
				isCross = 1;
				isPirorCross = 1;
			}
			else {
				isPirorCross = 0;
				maxCount = max(maxCount, count);
				count = 1;
			}
		}
		maxCount = max(maxCount, count);
		if (isCross) {
			cross++;
			//cout << maxCount << endl;
			if (maxCount >= k) stay++;
		}
		count = 1, isCross = 0, isPirorCross = 0, maxCount = 0;

	}
	cout << cross << endl << stay;
	return 0;
}