結果

問題 No.2157 崖
ユーザー koba-e964
提出日時 2023-06-13 11:50:03
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 4,463 ms / 6,000 ms
コード長 2,790 bytes
コンパイル時間 11,836 ms
コンパイル使用メモリ 398,868 KB
実行使用メモリ 18,048 KB
最終ジャッジ日時 2024-06-13 00:13:57
合計ジャッジ時間 47,774 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 22
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

// https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes.by_ref().map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}
macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr,) => {};
    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}
macro_rules! read_value {
    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };
    ($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error"));
}
trait Bisect<T> {
    fn lower_bound(&self, val: &T) -> usize;
    fn upper_bound(&self, val: &T) -> usize;
}
impl<T: Ord> Bisect<T> for [T] {
    fn lower_bound(&self, val: &T) -> usize {
        let mut pass = self.len() + 1;
        let mut fail = 0;
        while pass - fail > 1 {
            let mid = (pass + fail) / 2;
            if &self[mid - 1] >= val {
                pass = mid;
            } else {
                fail = mid;
            }
        }
        pass - 1
    }
    fn upper_bound(&self, val: &T) -> usize {
        let mut pass = self.len() + 1;
        let mut fail = 0;
        while pass - fail > 1 {
            let mid = (pass + fail) / 2;
            if &self[mid - 1] > val {
                pass = mid;
            } else {
                fail = mid;
            }
        }
        pass - 1
    }
}
// https://yukicoder.me/problems/no/2157 (3.5)
// 二分探索で O(N^2 log N log (max d))。
fn main() {
    input! {
        n: usize, m: usize,
        d: [[i64; m]; n],
    }
    let mut d = d;
    for i in 0..n {
        d[i].sort_unstable();
    }
    const INF: i64 = 1 << 30;
    let mut pass = INF;
    let mut fail = -1;
    while pass - fail > 1 {
        let mid = (pass + fail) / 2;
        let mut acc = vec![0; m + 1];
        for i in 0..m {
            acc[i + 1] = acc[i] + 1;
        }
        for i in 1..n {
            let mut bcc = vec![0; m + 1];
            for j in 0..m {
                let lo = d[i - 1].lower_bound(&(d[i][j] - mid));
                let hi = d[i - 1].upper_bound(&d[i][j]);
                bcc[j + 1] = bcc[j] + if acc[lo] < acc[hi] { 1 } else { 0 };
            }
            acc = bcc;
        }
        if acc[m] > 0 {
            pass = mid;
        } else {
            fail = mid;
        }
    }
    println!("{}", if pass >= INF { -1 } else { pass });
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0