#701254 (Rust) No.674 n連勤

• 問題: No.674 n連勤
• ユーザー: koba-e964
• 提出日時: 2021-09-20 14:34:48
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 24 ms / 2,000 ms
• コード長: 3,408 bytes
• コンパイル時間: 14,037 ms
• コンパイル使用メモリ: 378,408 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-07-02 14:05:20
• 合計ジャッジ時間: 15,674 ms
• ジャッジサーバーID （参考情報）: judge1 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	1 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	1 ms; 5,376 KB
testcase_04	AC	1 ms; 5,376 KB
testcase_05	AC	1 ms; 5,376 KB
testcase_06	AC	1 ms; 5,376 KB
testcase_07	AC	1 ms; 5,376 KB
testcase_08	AC	1 ms; 5,376 KB
testcase_09	AC	1 ms; 5,376 KB
testcase_10	AC	1 ms; 5,376 KB
testcase_11	AC	2 ms; 5,376 KB
testcase_12	AC	3 ms; 5,376 KB
testcase_13	AC	14 ms; 5,376 KB
testcase_14	AC	14 ms; 5,376 KB
testcase_15	AC	12 ms; 5,376 KB
testcase_16	AC	23 ms; 5,376 KB
testcase_17	AC	24 ms; 5,376 KB
testcase_18	AC	22 ms; 5,376 KB
testcase_19	AC	14 ms; 5,376 KB

コンパイルメッセージ

warning: unused variable: `d`
   --> src/main.rs:103:9
    |
103 |         d: i64, q: usize,
    |         ^
    |
help: `d` is captured in macro and introduced a unused variable
   --> src/main.rs:25:13
    |
25  |           let $var = read_value!($next, $t);
    |               ^^^^
...
102 | /     input! {
103 | |         d: i64, q: usize,
104 | |         ab: [(i64, i64); q],
105 | |     }
    | |_____- in this macro invocation
    = note: `#[warn(unused_variables)]` on by default
    = note: this warning originates in the macro `input_inner` which comes from the expansion of the macro `input` (in Nightly builds, run with -Z macro-backtrace for more info)

ソースコード

#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
use std::io::{Write, BufWriter};
// 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),* )) => { ($(read_value!($next, $t)),*) };
    ($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"));
}

// Port from https://satanic0258.github.io/snippets/data-structure/SegmentMap.html
#[derive(Clone, Debug, Default)]
struct Segs {
    s: std::collections::BTreeMap<i64, i64>,
}

impl Segs {
    fn new() -> Self { Default::default() }
    fn get(&self, x: i64) -> Option<(i64, i64)> {
        if let Some((&l, &r)) = self.s.range(..=x).rev().next() {
            if x < r {
                Some((l, r))
            } else {
                None
            }
        } else {
            None
        }
    }
    // adds [l, r).
    fn add(&mut self, mut l: i64, mut r: i64)  {
        assert!(l <= r);
        if l == r { return; }
        fn deref((&x, &y): (&i64, &i64)) -> (i64, i64) { (x, y) }
        let mut p = self.s.range(..=l).rev().next().map(deref);
        if p.is_none() {
            p = self.s.iter().next().map(deref);
        }
        while let Some((a, b)) = p {
            if a > r { break; }
            if b >= l {
                l = std::cmp::min(l, a);
                r = std::cmp::max(r, b);
                self.s.remove(&a);
            }
            p = self.s.range(a + 1..).next().map(deref);
        }
        self.s.insert(l, r);
    }
    #[allow(unused)]
    fn each<F: Fn(i64, i64)>(&self, f: F) {
        for (&x, &y) in &self.s {
            f(x, y);
        }
    }
}

trait Change { fn chmax(&mut self, x: Self); fn chmin(&mut self, x: Self); }
impl<T: PartialOrd> Change for T {
    fn chmax(&mut self, x: T) { if *self < x { *self = x; } }
    fn chmin(&mut self, x: T) { if *self > x { *self = x; } }
}

fn main() {
    // In order to avoid potential stack overflow, spawn a new thread.
    let stack_size = 104_857_600; // 100 MB
    let thd = std::thread::Builder::new().stack_size(stack_size);
    thd.spawn(|| solve()).unwrap().join().unwrap();
}

fn solve() {
    let out = std::io::stdout();
    let mut out = BufWriter::new(out.lock());
    macro_rules! puts {($($format:tt)*) => (let _ = write!(out,$($format)*););}
    input! {
        d: i64, q: usize,
        ab: [(i64, i64); q],
    }
    let mut segs = Segs::new();
    let mut ma = 0;
    for &(a, b) in &ab {
        segs.add(a, b + 1);
        if let Some((l, r)) = segs.get(a) {
            ma = max(ma, r - l);
        }
        puts!("{}\n", ma);
    }
}