AcWing 1227. 分巧克力 (二分)

Problem

枚举所有可能出现的正方形，利用二分优化。

O（NlogN）

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;

public class Main {
    static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    static PrintWriter pw = new PrintWriter(System.out);
    static int N = 100010;
    static int n, k;
    static int col[] = new int[N], row[] = new int[N];

    public static void main(String[] args) throws Exception {

        String s[] = br.readLine().split(" ");
        n = Integer.parseInt(s[0]);
        k = Integer.parseInt(s[1]);
        for (int i = 0; i < n; i++) {
            s = br.readLine().split(" ");
            row[i] = Integer.parseInt(s[0]);
            col[i] = Integer.parseInt(s[1]);
        }

        int l = 0, r = N;
        while (l < r) {
            int mid = l + r + 1 >> 1;
            if (check(mid)) l = mid;
            else r = mid - 1;
        }
        pw.println(r);

        pw.flush();
        pw.close();
        br.close();
    }

    public static boolean check(int n) {
        int res = 0;
        for (int i = 0; i < n; i++) {
            res += (row[i] / n) * (col[i] / n);
            if (res >= k) return true;
        }
        return false;
    }
}