#689685 (Rust) No.1677 mæx

• 問題: No.1677 mæx
• ユーザー: akakimidori
• 提出日時: 2021-08-14 01:32:46
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 5 ms / 2,000 ms
• コード長: 6,738 bytes
• コンパイル時間: 11,275 ms
• コンパイル使用メモリ: 397,324 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-06-11 21:40:30
• 合計ジャッジ時間: 12,405 ms
• ジャッジサーバーID （参考情報）: judge4 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	0 ms; 6,812 KB
testcase_01	AC	1 ms; 6,812 KB
testcase_02	AC	0 ms; 6,816 KB
testcase_03	AC	1 ms; 6,816 KB
testcase_04	AC	4 ms; 6,940 KB
testcase_05	AC	5 ms; 6,940 KB
testcase_06	AC	4 ms; 6,944 KB
testcase_07	AC	4 ms; 6,940 KB
testcase_08	AC	5 ms; 6,944 KB
testcase_09	AC	4 ms; 6,944 KB
testcase_10	AC	4 ms; 6,944 KB
testcase_11	AC	4 ms; 6,940 KB
testcase_12	AC	4 ms; 6,940 KB
testcase_13	AC	4 ms; 6,944 KB
testcase_14	AC	4 ms; 6,940 KB
testcase_15	AC	4 ms; 6,944 KB
testcase_16	AC	4 ms; 6,944 KB
testcase_17	AC	4 ms; 6,940 KB
testcase_18	AC	5 ms; 6,940 KB
testcase_19	AC	1 ms; 6,940 KB
testcase_20	AC	0 ms; 6,944 KB
testcase_21	AC	4 ms; 6,940 KB

ソースコード

// ---------- begin ModInt ----------
mod modint {

    #[allow(dead_code)]
    pub struct Mod;
    impl ConstantModulo for Mod {
        const MOD: u32 = 998_244_353;
    }

    use std::marker::*;
    use std::ops::*;

    pub trait Modulo {
        fn modulo() -> u32;
    }

    pub trait ConstantModulo {
        const MOD: u32;
    }

    impl<T> Modulo for T
    where
        T: ConstantModulo,
    {
        fn modulo() -> u32 {
            T::MOD
        }
    }

    pub struct ModInt<T>(pub u32, PhantomData<T>);

    impl<T> Clone for ModInt<T> {
        fn clone(&self) -> Self {
            ModInt::new_unchecked(self.0)
        }
    }

    impl<T> Copy for ModInt<T> {}

    impl<T: Modulo> Add for ModInt<T> {
        type Output = ModInt<T>;
        fn add(self, rhs: Self) -> Self::Output {
            let mut d = self.0 + rhs.0;
            if d >= T::modulo() {
                d -= T::modulo();
            }
            ModInt::new_unchecked(d)
        }
    }

    impl<T: Modulo> AddAssign for ModInt<T> {
        fn add_assign(&mut self, rhs: Self) {
            *self = *self + rhs;
        }
    }

    impl<T: Modulo> Sub for ModInt<T> {
        type Output = ModInt<T>;
        fn sub(self, rhs: Self) -> Self::Output {
            let mut d = self.0 - rhs.0;
            if d >= T::modulo() {
                d += T::modulo();
            }
            ModInt::new_unchecked(d)
        }
    }

    impl<T: Modulo> SubAssign for ModInt<T> {
        fn sub_assign(&mut self, rhs: Self) {
            *self = *self - rhs;
        }
    }

    impl<T: Modulo> Mul for ModInt<T> {
        type Output = ModInt<T>;
        fn mul(self, rhs: Self) -> Self::Output {
            let v = self.0 as u64 * rhs.0 as u64 % T::modulo() as u64;
            ModInt::new_unchecked(v as u32)
        }
    }

    impl<T: Modulo> MulAssign for ModInt<T> {
        fn mul_assign(&mut self, rhs: Self) {
            *self = *self * rhs;
        }
    }

    impl<T: Modulo> Neg for ModInt<T> {
        type Output = ModInt<T>;
        fn neg(self) -> Self::Output {
            if self.0 == 0 {
                Self::zero()
            } else {
                Self::new_unchecked(T::modulo() - self.0)
            }
        }
    }

    impl<T> std::fmt::Display for ModInt<T> {
        fn fmt<'a>(&self, f: &mut std::fmt::Formatter<'a>) -> std::fmt::Result {
            write!(f, "{}", self.0)
        }
    }

    impl<T> std::fmt::Debug for ModInt<T> {
        fn fmt<'a>(&self, f: &mut std::fmt::Formatter<'a>) -> std::fmt::Result {
            write!(f, "{}", self.0)
        }
    }

    impl<T: Modulo> std::str::FromStr for ModInt<T> {
        type Err = std::num::ParseIntError;
        fn from_str(s: &str) -> Result<Self, Self::Err> {
            let val = s.parse::<u32>()?;
            Ok(ModInt::new(val))
        }
    }

    impl<T: Modulo> From<usize> for ModInt<T> {
        fn from(val: usize) -> ModInt<T> {
            ModInt::new_unchecked((val % T::modulo() as usize) as u32)
        }
    }

    impl<T: Modulo> From<u64> for ModInt<T> {
        fn from(val: u64) -> ModInt<T> {
            ModInt::new_unchecked((val % T::modulo() as u64) as u32)
        }
    }

    impl<T: Modulo> From<i64> for ModInt<T> {
        fn from(val: i64) -> ModInt<T> {
            let m = T::modulo() as i64;
            ModInt::new((val % m + m) as u32)
        }
    }

    #[allow(dead_code)]
    impl<T> ModInt<T> {
        pub fn new_unchecked(d: u32) -> Self {
            ModInt(d, PhantomData)
        }
        pub fn zero() -> Self {
            ModInt::new_unchecked(0)
        }
        pub fn one() -> Self {
            ModInt::new_unchecked(1)
        }
        pub fn is_zero(&self) -> bool {
            self.0 == 0
        }
    }

    #[allow(dead_code)]
    impl<T: Modulo> ModInt<T> {
        pub fn new(d: u32) -> Self {
            ModInt::new_unchecked(d % T::modulo())
        }
        pub fn pow(&self, mut n: u64) -> Self {
            let mut t = Self::one();
            let mut s = *self;
            while n > 0 {
                if n & 1 == 1 {
                    t *= s;
                }
                s *= s;
                n >>= 1;
            }
            t
        }
    }
}
// ---------- end ModInt ----------

use modint::*;
type M = ModInt<Mod>;

// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------

fn dfs(k: &mut usize, s: &[u8]) -> [M; 3] {
    let c = s[*k];
    *k += 1;
    if c == b'm' {
        let op = s[*k];
        *k += 3;
        let l = dfs(k, s);
        *k += 1;
        let r = dfs(k, s);
        *k += 1;
        let mut res = [M::zero(); 3];
        for (i, l) in l.iter().enumerate() {
            for (j, r) in r.iter().enumerate() {
                if op != b'e' {
                    res[i.max(j)] += *l * *r;
                }
                if op != b'a' {
                    let x = (0..).find(|&k| k != i && k != j).unwrap();
                    res[x] += *l * *r;
                }
            }
        }
        res
    } else {
        let mut res = [M::zero(); 3];
        if c == b'?' {
            res = [M::one(); 3];
        } else {
            res[(c - b'0') as usize] = M::one();
        }
        res
    }
}

fn run() {
    input! {
        s: bytes,
        k: usize,
    }
    let ans = dfs(&mut 0, &s)[k];
    println!("{}", ans);
}

fn main() {
    run();
}