[Java] 202009-2 风险人群筛查

lincs_

已于 2022-06-11 16:20:39 修改

阅读量81

点赞数 1

分类专栏： CSP

于 2021-03-31 16:57:32 首次发布

本文链接：https://blog.csdn.net/weixin_41714373/article/details/115354820

版权

Java 输入输出坐标处理矩形区域计数

关键词由CSDN通过智能技术生成

CSP 专栏收录该内容

32 篇文章 6 订阅

订阅专栏

import java.io.*;
import java.util.*;

public class Main
{
    public Main() throws IOException
    {
        BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));

        StringTokenizer st = new StringTokenizer(f.readLine());

        int n = Integer.parseInt(st.nextToken());
        int k = Integer.parseInt(st.nextToken());
        int t = Integer.parseInt(st.nextToken());
        int xl = Integer.parseInt(st.nextToken());
        int yd = Integer.parseInt(st.nextToken());
        int xr = Integer.parseInt(st.nextToken());
        int yu = Integer.parseInt(st.nextToken());

        int pass = 0, stay = 0;
        for (int i = 0; i < n; i++)
        {
            st = new StringTokenizer(f.readLine());
            int count = 0, max_count =0;
            for (int j = 0; j < t; j++)
            {
                int x = Integer.parseInt(st.nextToken());
                int y = Integer.parseInt(st.nextToken());
                
                if (x >= xl && x <= xr && y >= yd && y <= yu)
                {
                    count++;
                    max_count = Math.max(count, max_count);
                }
                else {
                    count = 0;
                }
            }
            if (max_count > 0) {
                pass++;
            }
            if (max_count >= k) {
                stay++;
            }
        }
        out.println(pass + "\n" + stay);
        out.close();
        f.close();
    }

    public static void main(String[] args) throws IOException {
        new Main();
    }

}