結果

問題 No.1646 Avoid Palindrome
ユーザー koba-e964koba-e964
提出日時 2021-08-17 15:19:48
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 333 ms / 3,000 ms
コード長 6,107 bytes
コンパイル時間 15,880 ms
コンパイル使用メモリ 378,412 KB
実行使用メモリ 266,368 KB
最終ジャッジ日時 2024-11-08 16:23:58
合計ジャッジ時間 23,898 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,248 KB
testcase_04 AC 307 ms
251,008 KB
testcase_05 AC 307 ms
251,008 KB
testcase_06 AC 302 ms
242,432 KB
testcase_07 AC 310 ms
251,008 KB
testcase_08 AC 311 ms
253,312 KB
testcase_09 AC 295 ms
240,896 KB
testcase_10 AC 302 ms
246,912 KB
testcase_11 AC 292 ms
240,000 KB
testcase_12 AC 302 ms
250,624 KB
testcase_13 AC 304 ms
253,440 KB
testcase_14 AC 300 ms
246,144 KB
testcase_15 AC 305 ms
251,008 KB
testcase_16 AC 306 ms
244,608 KB
testcase_17 AC 317 ms
255,360 KB
testcase_18 AC 302 ms
248,576 KB
testcase_19 AC 302 ms
247,296 KB
testcase_20 AC 307 ms
249,216 KB
testcase_21 AC 322 ms
255,104 KB
testcase_22 AC 314 ms
246,400 KB
testcase_23 AC 323 ms
256,512 KB
testcase_24 AC 333 ms
266,368 KB
testcase_25 AC 327 ms
266,240 KB
testcase_26 AC 325 ms
266,240 KB
testcase_27 AC 325 ms
266,240 KB
testcase_28 AC 327 ms
266,240 KB
testcase_29 AC 324 ms
266,240 KB
testcase_30 AC 324 ms
266,240 KB
testcase_31 AC 326 ms
266,240 KB
testcase_32 AC 326 ms
266,240 KB
testcase_33 AC 324 ms
266,240 KB
testcase_34 AC 329 ms
266,240 KB
testcase_35 AC 1 ms
5,248 KB
testcase_36 AC 1 ms
5,248 KB
testcase_37 AC 1 ms
5,248 KB
testcase_38 AC 1 ms
5,248 KB
testcase_39 AC 1 ms
5,248 KB
testcase_40 AC 1 ms
5,248 KB
testcase_41 AC 1 ms
5,248 KB
testcase_42 AC 1 ms
5,248 KB
testcase_43 AC 326 ms
266,240 KB
権限があれば一括ダウンロードができます

ソースコード

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, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };
    ($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error"));
}

/// Verified by https://atcoder.jp/contests/abc198/submissions/21774342
mod mod_int {
    use std::ops::*;
    pub trait Mod: Copy { fn m() -> i64; }
    #[derive(Copy, Clone, Hash, PartialEq, Eq, PartialOrd, Ord)]
    pub struct ModInt<M> { pub x: i64, phantom: ::std::marker::PhantomData<M> }
    impl<M: Mod> ModInt<M> {
        // x >= 0
        pub fn new(x: i64) -> Self { ModInt::new_internal(x % M::m()) }
        fn new_internal(x: i64) -> Self {
            ModInt { x: x, phantom: ::std::marker::PhantomData }
        }
        pub fn pow(self, mut e: i64) -> Self {
            debug_assert!(e >= 0);
            let mut sum = ModInt::new_internal(1);
            let mut cur = self;
            while e > 0 {
                if e % 2 != 0 { sum *= cur; }
                cur *= cur;
                e /= 2;
            }
            sum
        }
        #[allow(dead_code)]
        pub fn inv(self) -> Self { self.pow(M::m() - 2) }
    }
    impl<M: Mod, T: Into<ModInt<M>>> Add<T> for ModInt<M> {
        type Output = Self;
        fn add(self, other: T) -> Self {
            let other = other.into();
            let mut sum = self.x + other.x;
            if sum >= M::m() { sum -= M::m(); }
            ModInt::new_internal(sum)
        }
    }
    impl<M: Mod, T: Into<ModInt<M>>> Sub<T> for ModInt<M> {
        type Output = Self;
        fn sub(self, other: T) -> Self {
            let other = other.into();
            let mut sum = self.x - other.x;
            if sum < 0 { sum += M::m(); }
            ModInt::new_internal(sum)
        }
    }
    impl<M: Mod, T: Into<ModInt<M>>> Mul<T> for ModInt<M> {
        type Output = Self;
        fn mul(self, other: T) -> Self { ModInt::new(self.x * other.into().x % M::m()) }
    }
    impl<M: Mod, T: Into<ModInt<M>>> AddAssign<T> for ModInt<M> {
        fn add_assign(&mut self, other: T) { *self = *self + other; }
    }
    impl<M: Mod, T: Into<ModInt<M>>> SubAssign<T> for ModInt<M> {
        fn sub_assign(&mut self, other: T) { *self = *self - other; }
    }
    impl<M: Mod, T: Into<ModInt<M>>> MulAssign<T> for ModInt<M> {
        fn mul_assign(&mut self, other: T) { *self = *self * other; }
    }
    impl<M: Mod> Neg for ModInt<M> {
        type Output = Self;
        fn neg(self) -> Self { ModInt::new(0) - self }
    }
    impl<M> ::std::fmt::Display for ModInt<M> {
        fn fmt(&self, f: &mut ::std::fmt::Formatter) -> ::std::fmt::Result {
            self.x.fmt(f)
        }
    }
    impl<M: Mod> ::std::fmt::Debug for ModInt<M> {
        fn fmt(&self, f: &mut ::std::fmt::Formatter) -> ::std::fmt::Result {
            let (mut a, mut b, _) = red(self.x, M::m());
            if b < 0 {
                a = -a;
                b = -b;
            }
            write!(f, "{}/{}", a, b)
        }
    }
    impl<M: Mod> From<i64> for ModInt<M> {
        fn from(x: i64) -> Self { Self::new(x) }
    }
    // Finds the simplest fraction x/y congruent to r mod p.
    // The return value (x, y, z) satisfies x = y * r + z * p.
    fn red(r: i64, p: i64) -> (i64, i64, i64) {
        if r.abs() <= 10000 {
            return (r, 1, 0);
        }
        let mut nxt_r = p % r;
        let mut q = p / r;
        if 2 * nxt_r >= r {
            nxt_r -= r;
            q += 1;
        }
        if 2 * nxt_r <= -r {
            nxt_r += r;
            q -= 1;
        }
        let (x, z, y) = red(nxt_r, r);
        (x, y - q * z, z)
    }
} // mod mod_int

macro_rules! define_mod {
    ($struct_name: ident, $modulo: expr) => {
        #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash)]
        struct $struct_name {}
        impl mod_int::Mod for $struct_name { fn m() -> i64 { $modulo } }
    }
}
const MOD: i64 = 998_244_353;
define_mod!(P, MOD);
type MInt = mod_int::ModInt<P>;

fn main() {
    input! {
        n: usize,
        s: chars,
    }
    if n == 1 {
        println!("{}", if s[0] == '?' { 26 } else { 1 });
        return;
    }
    let mut dp = vec![[[MInt::new(0); 26]; 26]; n + 1];
    for i in 0..26 {
        let a = (b'a' + i as u8) as char;
        if s[0] != '?' && s[0] != a {
            continue;
        }
        for j in 0..26 {
            let b = (b'a' + j as u8) as char;
            if s[1] != '?' && s[1] != b {
                continue;
            }
            if a == b {
                continue;
            }
            dp[2][i][j] += 1;
        }
    }
    for i in 2..n {
        for k in 0..26 {
            let mut sum = MInt::new(0);
            for j in 0..26 {
                sum += dp[i][j][k];
            }
            for l in 0..26 {
                if k == l {
                    continue;
                }
                let a = (b'a' + l as u8) as char;
                if s[i] != '?' && s[i] != a {
                    continue;
                }
                let mut ex = dp[i][k][k];
                if k != l {
                    ex += dp[i][l][k];
                }
                dp[i + 1][k][l] = dp[i + 1][k][l] + sum - ex;
            }
        }
    }
    let mut tot = MInt::new(0);
    for i in 0..26 {
        for j in 0..26 {
            tot += dp[n][i][j];
        }
    }
    println!("{}", tot);
}
0