#558570 (Rust) No.1239 Multiplication -2

提出ソース

結果

問題	No.1239 Multiplication -2
ユーザー	ziita
提出日時	2020-09-25 23:27:47
言語	Rust (1.77.0 + proconio)
結果	AC
実行時間	64 ms / 2,000 ms
コード長	8,641 bytes
コンパイル時間	14,515 ms
コンパイル使用メモリ	401,296 KB
実行使用メモリ	6,944 KB
最終ジャッジ日時	2024-06-28 08:11:45
合計ジャッジ時間	16,821 ms
ジャッジサーバーID （参考情報）	judge4 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 6,812 KB
testcase_01	AC	1 ms 6,812 KB
testcase_02	AC	1 ms 6,944 KB
testcase_03	AC	2 ms 6,940 KB
testcase_04	AC	1 ms 6,940 KB
testcase_05	AC	2 ms 6,944 KB
testcase_06	AC	1 ms 6,944 KB
testcase_07	AC	1 ms 6,944 KB
testcase_08	AC	1 ms 6,940 KB
testcase_09	AC	1 ms 6,944 KB
testcase_10	AC	1 ms 6,940 KB
testcase_11	AC	1 ms 6,940 KB
testcase_12	AC	1 ms 6,940 KB
testcase_13	AC	1 ms 6,940 KB
testcase_14	AC	1 ms 6,940 KB
testcase_15	AC	13 ms 6,944 KB
testcase_16	AC	20 ms 6,940 KB
testcase_17	AC	58 ms 6,940 KB
testcase_18	AC	64 ms 6,940 KB
testcase_19	AC	21 ms 6,944 KB
testcase_20	AC	52 ms 6,940 KB
testcase_21	AC	58 ms 6,944 KB
testcase_22	AC	40 ms 6,940 KB
testcase_23	AC	41 ms 6,940 KB
testcase_24	AC	30 ms 6,940 KB
testcase_25	AC	5 ms 6,940 KB
testcase_26	AC	38 ms 6,940 KB
testcase_27	AC	17 ms 6,944 KB
testcase_28	AC	54 ms 6,940 KB
testcase_29	AC	58 ms 6,940 KB
testcase_30	AC	22 ms 6,940 KB
testcase_31	AC	31 ms 6,944 KB
testcase_32	AC	52 ms 6,940 KB
testcase_33	AC	37 ms 6,940 KB
testcase_34	AC	34 ms 6,940 KB
testcase_35	AC	17 ms 6,944 KB
testcase_36	AC	15 ms 6,944 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#![allow(unused_imports)]
#![allow(non_snake_case, unused)]

use std::cmp::*;
use std::collections::*;
use std::ops::*;

// https://atcoder.jp/contests/hokudai-hitachi2019-1/submissions/10518254 より

macro_rules! eprint {
    ($($t:tt)*) => {{
        use ::std::io::Write;
        let _ = write!(::std::io::stderr(), $($t)*);
    }};
}
macro_rules! eprintln {
    () => { eprintln!(""); };
    ($($t:tt)*) => {{
        use ::std::io::Write;
        let _ = writeln!(::std::io::stderr(), $($t)*);
    }};
}
macro_rules! dbg {
    ($v:expr) => {{
        let val = $v;
        eprintln!("[{}:{}] {} = {:?}", file!(), line!(), stringify!($v), val);
        val
    }}
}

macro_rules! mat {
    ($($e:expr),*) => { Vec::from(vec![$($e),*]) };
    ($($e:expr,)*) => { Vec::from(vec![$($e),*]) };
    ($e:expr; $d:expr) => { Vec::from(vec![$e; $d]) };
    ($e:expr; $d:expr $(; $ds:expr)+) => { Vec::from(vec![mat![$e $(; $ds)*]; $d]) };
}

macro_rules! ok {
    ($a:ident$([$i:expr])*.$f:ident()$(@$t:ident)*) => {
        $a$([$i])*.$f($($t),*)
    };
    ($a:ident$([$i:expr])*.$f:ident($e:expr$(,$es:expr)*)$(@$t:ident)*) => { {
        let t = $e;
        ok!($a$([$i])*.$f($($es),*)$(@$t)*@t)
    } };
}

pub fn readln() -> String {
    let mut line = String::new();
    ::std::io::stdin().read_line(&mut line).unwrap_or_else(|e| panic!("{}", e));
    line
}

macro_rules! read {
    ($($t:tt),*; $n:expr) => {{
        let stdin = ::std::io::stdin();
        let ret = ::std::io::BufRead::lines(stdin.lock()).take($n).map(|line| {
            let line = line.unwrap();
            let mut it = line.split_whitespace();
            _read!(it; $($t),*)
        }).collect::<Vec<_>>();
        ret
    }};
    ($($t:tt),*) => {{
        let line = readln();
        let mut it = line.split_whitespace();
        _read!(it; $($t),*)
    }};
}

macro_rules! _read {
    ($it:ident; [char]) => {
        _read!($it; String).chars().collect::<Vec<_>>()
    };
    ($it:ident; [u8]) => {
        Vec::from(_read!($it; String).into_bytes())
    };
    ($it:ident; usize1) => {
        $it.next().unwrap_or_else(|| panic!("input mismatch")).parse::<usize>().unwrap_or_else(|e| panic!("{}", e)) - 1
    };
    ($it:ident; [usize1]) => {
        $it.map(|s| s.parse::<usize>().unwrap_or_else(|e| panic!("{}", e)) - 1).collect::<Vec<_>>()
    };
    ($it:ident; [$t:ty]) => {
        $it.map(|s| s.parse::<$t>().unwrap_or_else(|e| panic!("{}", e))).collect::<Vec<_>>()
    };
    ($it:ident; $t:ty) => {
        $it.next().unwrap_or_else(|| panic!("input mismatch")).parse::<$t>().unwrap_or_else(|e| panic!("{}", e))
    };
    ($it:ident; $($t:tt),+) => {
        ($(_read!($it; $t)),*)
    };
}


pub fn main() {
    let _ = ::std::thread::Builder::new().name("run".to_string()).stack_size(32 * 1024 * 1024).spawn(run).unwrap().join();
}

const MOD: usize = 998244353;
// const MOD: usize = 1_000_000_007;
// const MOD: i128 = std::i128::MAX/2;
const INF: i64 = std::i64::MAX/2;

#[derive(Clone, Copy)]
struct ModInt(usize);
 
impl std::ops::Add for ModInt {
    type Output = ModInt;
    fn add(self, rhs: ModInt) -> Self::Output {
        let mut d = self.0 + rhs.0;
        if d >= MOD {
            d -= MOD;
        }
        ModInt(d)
    }
}
 
impl std::ops::AddAssign for ModInt {
    fn add_assign(&mut self, rhs: ModInt) {
        *self = *self + rhs;
    }
}
 
impl std::ops::Sub for ModInt {
    type Output = ModInt;
    fn sub(self, rhs: ModInt) -> Self::Output {
        let mut d = self.0 + MOD - rhs.0;
        if d >= MOD {
            d -= MOD;
        }
        ModInt(d)
    }
}
 
impl std::ops::SubAssign for ModInt {
    fn sub_assign(&mut self, rhs: ModInt) {
        *self = *self - rhs;
    }
}
 
impl std::ops::Mul for ModInt {
    type Output = ModInt;
    fn mul(self, rhs: ModInt) -> Self::Output {
        ModInt((self.0 as u64 * rhs.0 as u64 % MOD as u64) as usize)
    }
}
 
impl std::ops::MulAssign for ModInt {
    fn mul_assign(&mut self, rhs: ModInt) {
        *self = *self * rhs;
    }
}
 
impl std::ops::Neg for ModInt {
    type Output = ModInt;
    fn neg(self) -> Self::Output {
        ModInt(if self.0 == 0 {0} else {MOD - self.0})
    }
}
 
/* 
impl std::fmt::Display for ModInt {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        write!(f, "{}", self.0)
    }
}
*/
 
#[allow(dead_code)]
impl ModInt {
    pub fn new(n: usize) -> ModInt {
        ModInt(n % MOD)
    }
    pub fn zero() -> ModInt {
        ModInt(0)
    }
    pub fn one() -> ModInt {
        ModInt(1)
    }
    pub fn pow(self, mut n: usize) -> ModInt {
        let mut t = ModInt::one();
        let mut s = self;
        while n > 0 {
            if n & 1 == 1 {
                t *= s;
            }
            s *= s;
            n >>= 1;
        }
        t
    }
    pub fn inv(self) -> ModInt {
        self.pow(MOD - 2)
    }
}
// ---------- end ModInt ----------
// ---------- begin Precalc ----------
#[allow(dead_code)]
struct Precalc {
    inv: Vec<ModInt>,
    fact: Vec<ModInt>,
    ifact: Vec<ModInt>,
}
 
#[allow(dead_code)]
impl Precalc {
    pub fn new(n: usize) -> Precalc {
        let mut inv = vec![ModInt::one(); n + 1];
        let mut fact = vec![ModInt::one(); n + 1];
        let mut ifact = vec![ModInt::one(); n + 1];
        for i in 2..(n + 1) {
            inv[i] = -inv[MOD as usize % i] * ModInt(MOD / i as usize);
            fact[i] = fact[i - 1] * ModInt(i as usize);
            ifact[i] = ifact[i - 1] * inv[i];
        }
        Precalc {
            inv: inv,
            fact: fact,
            ifact: ifact,
        }
    }
    pub fn inv(&self, n: usize) -> ModInt {
        self.inv[n]
    }
    pub fn fact(&self, n: usize) -> ModInt {
        self.fact[n]
    }
    pub fn ifact(&self, n: usize) -> ModInt {
        self.ifact[n]
    }
    pub fn comb(&self, n: usize, k: usize) -> ModInt {
        if k > n {
            return ModInt::zero();
        }
        self.fact[n] * self.ifact[k] * self.ifact[n - k]
    }
}
// ---------- end Precalc ----------

fn solve() {
    let n = read!(usize);
    let a = read!([i64]);
    let mut ans = ModInt(0);
    for i in 1..n-1 {
        if a[i].abs()==2 {
            let mut l1 = vec![];
            let mut l2 = vec![];
            let mut r1 = vec![];
            let mut r2 = vec![];  
            l1.push(0);
            r1.push(0);
            let mut s = 0;
            for j in (1..i).rev() {
                if a[j].abs()!=1 {
                    break;
                }
                if a[j]==-1 {
                    s = 1-s;
                }
                if s==0 {
                    l1.push(i-j);
                }
                else {
                    l2.push(i-j);
                }
            }
            s = 0;
            for j in (i+1)..(n-1) {
                if a[j].abs()!=1 {
                    break;
                }
                if a[j]==-1 {
                    s = 1-s;
                }
                if s==0 {
                    r1.push(j-i);
                }
                else {
                    r2.push(j-i);
                }
            }
            let mut r1c = ModInt(0);
            let mut r2c = ModInt(0);
            for &v in &r1 {
                r1c += ModInt(2).pow(n-3-v);
            }
            for &v in &r2 {
                r2c += ModInt(2).pow(n-3-v);
            }
            for &v in &l1 {
                if a[i]==2 {
                    ans += r2c * ModInt(2).pow(v).inv();
                }
                else {
                    ans += r1c * ModInt(2).pow(v).inv();
                }
            }
            for &v in &l2 {
                if a[i]==2 {
                    ans += r1c * ModInt(2).pow(v).inv();
                }
                else {
                    ans += r2c * ModInt(2).pow(v).inv();
                }
            }
        }
    }
    let mut v = 1;
    for i in 0..n-1 {
        v *= a[i];
        if v==-2 {
            ans += ModInt(2).pow(n-2-i);
        }
        if v.abs()>2 {
            break;
        }
    }
    v = 1;
    for i in (1..n).rev() {
        v *= a[i];
        if v==-2 {
            ans += ModInt(2).pow(i-1);
        }
        if v.abs()>2 {
            break;
        }
    }
    v = 1;
    for i in 0..n {
        v *= a[i];
        if v.abs()>2 {
            break;
        }
        if i==n-1 && v==-2 {
            ans += ModInt(1);
        }
    }
    ans *= ModInt(2).pow(n-1).inv();
    println!("{}",ans.0);
}

fn run() {
    let stack_size = 104_857_600; // 100 MB
    let thd = std::thread::Builder::new().stack_size(stack_size);
    solve();
}

yukicoder

結果

テストケース

ソースコード