#902426 (Rust) No.2420 Simple Problem

• 問題: No.2420 Simple Problem
• ユーザー: haihamabossu
• 提出日時: 2023-08-12 14:17:56
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 155 ms / 2,000 ms
• コード長: 2,090 bytes
• コンパイル時間: 14,476 ms
• コンパイル使用メモリ: 395,440 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-11-19 18:27:08
• 合計ジャッジ時間: 22,407 ms
• ジャッジサーバーID （参考情報）: judge4 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	63 ms; 5,248 KB
testcase_02	AC	1 ms; 5,248 KB
testcase_03	AC	25 ms; 5,248 KB
testcase_04	AC	123 ms; 5,248 KB
testcase_05	AC	79 ms; 5,248 KB
testcase_06	AC	154 ms; 5,248 KB
testcase_07	AC	154 ms; 5,248 KB
testcase_08	AC	153 ms; 5,248 KB
testcase_09	AC	152 ms; 5,248 KB
testcase_10	AC	153 ms; 5,248 KB
testcase_11	AC	153 ms; 5,248 KB
testcase_12	AC	153 ms; 5,248 KB
testcase_13	AC	153 ms; 5,248 KB
testcase_14	AC	153 ms; 5,248 KB
testcase_15	AC	153 ms; 5,248 KB
testcase_16	AC	153 ms; 5,248 KB
testcase_17	AC	153 ms; 5,248 KB
testcase_18	AC	153 ms; 5,248 KB
testcase_19	AC	153 ms; 5,248 KB
testcase_20	AC	153 ms; 5,248 KB
testcase_21	AC	154 ms; 5,248 KB
testcase_22	AC	153 ms; 5,248 KB
testcase_23	AC	153 ms; 5,248 KB
testcase_24	AC	153 ms; 5,248 KB
testcase_25	AC	155 ms; 5,248 KB
testcase_26	AC	1 ms; 5,248 KB
testcase_27	AC	120 ms; 5,248 KB
testcase_28	AC	121 ms; 5,248 KB
testcase_29	AC	120 ms; 5,248 KB
testcase_30	AC	120 ms; 5,248 KB
testcase_31	AC	120 ms; 5,248 KB
testcase_32	AC	1 ms; 5,248 KB
testcase_33	AC	62 ms; 5,248 KB

ソースコード

pub mod binary_search {
    type T = usize;

    pub fn binary_search(mut ok: T, mut ng: T, f: impl Fn(T) -> bool) -> T {
        let cont = |ok: T, ng: T| {
            let l = ok.min(ng);
            let r = ok.max(ng);
            l + 1 < r
        };
        while cont(ok, ng) {
            let x = (ok + ng) / 2;
            if f(x) {
                ok = x;
            } else {
                ng = x;
            }
        }
        ok
    }
}

pub mod scanner {

    pub struct Scanner {
        buf: Vec<String>,
    }

    impl Scanner {
        pub fn new() -> Self {
            Self { buf: vec![] }
        }

        pub fn new_from(source: &str) -> Self {
            let source = String::from(source);
            let buf = Self::split(source);
            Self { buf }
        }

        pub fn next<T: std::str::FromStr>(&mut self) -> T {
            loop {
                if let Some(x) = self.buf.pop() {
                    return x.parse().ok().expect("");
                }
                let mut source = String::new();
                std::io::stdin().read_line(&mut source).expect("");
                self.buf = Self::split(source);
            }
        }

        fn split(source: String) -> Vec<String> {
            source
                .split_whitespace()
                .rev()
                .map(String::from)
                .collect::<Vec<_>>()
        }
    }
}

use crate::{binary_search::binary_search, scanner::Scanner};
use std::io::Write;
fn main() {
    let mut scanner = Scanner::new();
    let out = std::io::stdout();
    let mut out = std::io::BufWriter::new(out.lock());
    let t: usize = scanner.next();
    for _ in 0..t {
        solve(&mut scanner, &mut out);
    }
}
fn solve(scanner: &mut Scanner, out: &mut std::io::BufWriter<std::io::StdoutLock>) {
    let a: usize = scanner.next();
    let b: usize = scanner.next();
    let xx = binary_search(4e9 as usize + 10, a + b, |xx| {
        a * b * 4 < (xx - a - b) * (xx - a - b)
    });
    let x = binary_search(xx, 0, |x| xx <= x * x);
    writeln!(out, "{}", x).unwrap();
}