#706132 (Rust) No.1703 Much Matching

• 問題: No.1703 Much Matching
• ユーザー: koba-e964
• 提出日時: 2021-10-08 23:17:11
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 380 ms / 2,000 ms
• コード長: 4,130 bytes
• コンパイル時間: 13,551 ms
• コンパイル使用メモリ: 403,004 KB
• 実行使用メモリ: 22,912 KB
• 最終ジャッジ日時: 2024-07-23 07:07:50
• 合計ジャッジ時間: 16,831 ms
• ジャッジサーバーID （参考情報）: judge4 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	1 ms; 5,376 KB
testcase_02	AC	1 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	101 ms; 7,820 KB
testcase_07	AC	5 ms; 5,376 KB
testcase_08	AC	104 ms; 8,192 KB
testcase_09	AC	119 ms; 9,552 KB
testcase_10	AC	17 ms; 5,376 KB
testcase_11	AC	24 ms; 5,376 KB
testcase_12	AC	5 ms; 5,376 KB
testcase_13	AC	45 ms; 5,376 KB
testcase_14	AC	2 ms; 5,376 KB
testcase_15	AC	20 ms; 5,376 KB
testcase_16	AC	65 ms; 6,016 KB
testcase_17	AC	72 ms; 6,656 KB
testcase_18	AC	2 ms; 5,376 KB
testcase_19	AC	162 ms; 11,264 KB
testcase_20	AC	19 ms; 5,376 KB
testcase_21	AC	193 ms; 13,184 KB
testcase_22	AC	72 ms; 6,272 KB
testcase_23	AC	53 ms; 5,504 KB
testcase_24	AC	2 ms; 5,376 KB
testcase_25	AC	7 ms; 5,376 KB
testcase_26	AC	35 ms; 5,376 KB
testcase_27	AC	78 ms; 6,656 KB
testcase_28	AC	156 ms; 10,968 KB
testcase_29	AC	27 ms; 5,376 KB
testcase_30	AC	41 ms; 5,376 KB
testcase_31	AC	4 ms; 5,376 KB
testcase_32	AC	83 ms; 6,784 KB
testcase_33	AC	53 ms; 5,376 KB
testcase_34	AC	5 ms; 5,376 KB
testcase_35	AC	13 ms; 5,376 KB
testcase_36	AC	380 ms; 22,912 KB
testcase_37	AC	1 ms; 5,376 KB

コンパイルメッセージ

warning: unused import: `BufWriter`
 --> src/main.rs:5:22
  |
5 | use std::io::{Write, BufWriter};
  |                      ^^^^^^^^^
  |
  = note: `#[warn(unused_imports)]` on by default

warning: unused import: `Write`
 --> src/main.rs:5:15
  |
5 | use std::io::{Write, BufWriter};
  |               ^^^^^

warning: unused variable: `n`
   --> src/main.rs:115:9
    |
115 |         n: usize, m: usize, q: usize,
    |         ^
    |
help: `n` is captured in macro and introduced a unused variable
   --> src/main.rs:25:13
    |
25  |           let $var = read_value!($next, $t);
    |               ^^^^
...
114 | /     input! {
115 | |         n: usize, m: usize, q: usize,
116 | |         ab: [(usize1, usize1); q],
117 | |     }
    | |_____- 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, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };
    ($next:expr, usize1) => (read_value!($next, usize) - 1);
    ($next:expr, [ $t:tt ]) => {{
        let len = read_value!($next, usize);
        read_value!($next, [$t; len])
    }};
    ($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error"));
}

/**
 * Segment Tree. This data structure is useful for fast folding on intervals of an array
 * whose elements are elements of monoid I. Note that constructing this tree requires the identity
 * element of I and the operation of I.
 * Verified by: yukicoder No. 259 (http://yukicoder.me/submissions/100581)
 *              AGC015-E (http://agc015.contest.atcoder.jp/submissions/1461001)
 *              yukicoder No. 833 (https://yukicoder.me/submissions/703521)
 */
struct SegTree<I, BiOp> {
    n: usize,
    dat: Vec<I>,
    op: BiOp,
    e: I,
}

impl<I, BiOp> SegTree<I, BiOp>
    where BiOp: Fn(I, I) -> I,
          I: Copy {
    pub fn new(n_: usize, op: BiOp, e: I) -> Self {
        let mut n = 1;
        while n < n_ { n *= 2; } // n is a power of 2
        SegTree {n: n, dat: vec![e; 2 * n - 1], op: op, e: e}
    }
    /* ary[k] <- v */
    pub fn update(&mut self, idx: usize, v: I) {
        let mut k = idx + self.n - 1;
        self.dat[k] = v;
        while k > 0 {
            k = (k - 1) / 2;
            self.dat[k] = (self.op)(self.dat[2 * k + 1], self.dat[2 * k + 2]);
        }
    }
    /* [a, b) (note: half-inclusive)
     * http://proc-cpuinfo.fixstars.com/2017/07/optimize-segment-tree/ */
    #[allow(unused)]
    pub fn query(&self, mut a: usize, mut b: usize) -> I {
        let mut left = self.e;
        let mut right = self.e;
        a += self.n - 1;
        b += self.n - 1;
        while a < b {
            if (a & 1) == 0 {
                left = (self.op)(left, self.dat[a]);
            }
            if (b & 1) == 0 {
                right = (self.op)(self.dat[b - 1], right);
            }
            a = a / 2;
            b = (b - 1) / 2;
        }
        (self.op)(left, right)
    }
}

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() {
    input! {
        n: usize, m: usize, q: usize,
        ab: [(usize1, usize1); q],
    }
    let mut ab = ab;
    ab.sort_by_key(|&(a, b)| (a, Reverse(b)));
    const INF: i64 = 1 << 50;
    let mut st = SegTree::new(m + 1, max, -INF);
    st.update(m, 0);
    for &(_a, b) in ab.iter().rev() {
        let val = st.query(b + 1, m + 1) + 1;
        let val = max(val, st.query(b, b + 1));
        st.update(b, val);
    }
    println!("{}", st.query(0, m + 1));
}