#707421 (Rust) No.1709 Indistinguishable by MEX

• 問題: No.1709 Indistinguishable by MEX
• ユーザー: koba-e964
• 提出日時: 2021-10-15 21:59:56
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 19 ms / 2,000 ms
• コード長: 1,796 bytes
• コンパイル時間: 12,894 ms
• コンパイル使用メモリ: 381,376 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-09-17 17:29:33
• 合計ジャッジ時間: 14,504 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	1 ms; 5,248 KB
testcase_02	AC	1 ms; 5,248 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	16 ms; 5,376 KB
testcase_09	AC	12 ms; 5,376 KB
testcase_10	AC	12 ms; 5,376 KB
testcase_11	AC	9 ms; 5,376 KB
testcase_12	AC	9 ms; 5,376 KB
testcase_13	AC	13 ms; 5,376 KB
testcase_14	AC	12 ms; 5,376 KB
testcase_15	AC	12 ms; 5,376 KB
testcase_16	AC	16 ms; 5,376 KB
testcase_17	AC	15 ms; 5,376 KB
testcase_18	AC	19 ms; 5,376 KB
testcase_19	AC	19 ms; 5,376 KB
testcase_20	AC	19 ms; 5,376 KB
testcase_21	AC	17 ms; 5,376 KB
testcase_22	AC	17 ms; 5,376 KB
testcase_23	AC	17 ms; 5,376 KB
testcase_24	AC	16 ms; 5,376 KB
testcase_25	AC	17 ms; 5,376 KB
testcase_26	AC	1 ms; 5,376 KB
testcase_27	AC	9 ms; 5,376 KB
testcase_28	AC	8 ms; 5,376 KB

ソースコード

#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
// 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"));
}

const MOD: i64 = 998_244_353;

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,
        p: [usize; n],
    }
    let mut inv = vec![0; n];
    for i in 0..n {
        inv[p[i]] = i;
    }
    let mut l = inv[0];
    let mut r = inv[0];
    let mut tot = 1;
    for i in 1..n {
        let old = (l, r);
        l = min(l, inv[i]);
        r = max(r, inv[i]);
        if old != (l, r) {
            continue;
        }
        let t = (r + 1 - l) - i;
        tot = tot * t as i64 % MOD;
    }
    println!("{}", tot);
}