結果

問題 No.2170 Left Addition Machine
ユーザー akakimidoriakakimidori
提出日時 2022-12-22 00:09:46
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 105 ms / 2,000 ms
コード長 8,137 bytes
コンパイル時間 11,336 ms
コンパイル使用メモリ 390,356 KB
実行使用メモリ 12,800 KB
最終ジャッジ日時 2024-04-29 05:19:29
合計ジャッジ時間 22,055 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 0 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 1 ms
5,376 KB
testcase_03 AC 105 ms
11,776 KB
testcase_04 AC 16 ms
5,376 KB
testcase_05 AC 28 ms
7,552 KB
testcase_06 AC 47 ms
8,192 KB
testcase_07 AC 48 ms
10,240 KB
testcase_08 AC 12 ms
5,376 KB
testcase_09 AC 35 ms
7,808 KB
testcase_10 AC 6 ms
5,376 KB
testcase_11 AC 28 ms
6,784 KB
testcase_12 AC 63 ms
12,672 KB
testcase_13 AC 49 ms
12,672 KB
testcase_14 AC 45 ms
12,624 KB
testcase_15 AC 47 ms
12,672 KB
testcase_16 AC 48 ms
12,672 KB
testcase_17 AC 44 ms
12,652 KB
testcase_18 AC 45 ms
12,764 KB
testcase_19 AC 45 ms
12,672 KB
testcase_20 AC 45 ms
12,620 KB
testcase_21 AC 22 ms
6,656 KB
testcase_22 AC 22 ms
6,528 KB
testcase_23 AC 23 ms
6,528 KB
testcase_24 AC 22 ms
6,656 KB
testcase_25 AC 22 ms
6,656 KB
testcase_26 AC 22 ms
6,656 KB
testcase_27 AC 23 ms
6,656 KB
testcase_28 AC 22 ms
6,528 KB
testcase_29 AC 22 ms
6,656 KB
testcase_30 AC 61 ms
12,672 KB
testcase_31 AC 58 ms
12,672 KB
testcase_32 AC 59 ms
12,664 KB
testcase_33 AC 60 ms
12,672 KB
testcase_34 AC 59 ms
12,588 KB
testcase_35 AC 62 ms
12,672 KB
testcase_36 AC 59 ms
12,672 KB
testcase_37 AC 60 ms
12,640 KB
testcase_38 AC 60 ms
12,672 KB
testcase_39 AC 30 ms
6,528 KB
testcase_40 AC 30 ms
6,528 KB
testcase_41 AC 30 ms
6,528 KB
testcase_42 AC 31 ms
6,528 KB
testcase_43 AC 29 ms
6,656 KB
testcase_44 AC 31 ms
6,656 KB
testcase_45 AC 32 ms
6,528 KB
testcase_46 AC 32 ms
6,656 KB
testcase_47 AC 28 ms
6,528 KB
testcase_48 AC 60 ms
12,544 KB
testcase_49 AC 59 ms
12,672 KB
testcase_50 AC 57 ms
12,672 KB
testcase_51 AC 63 ms
12,672 KB
testcase_52 AC 62 ms
12,672 KB
testcase_53 AC 62 ms
12,672 KB
testcase_54 AC 65 ms
12,672 KB
testcase_55 AC 61 ms
12,656 KB
testcase_56 AC 60 ms
12,588 KB
testcase_57 AC 46 ms
12,672 KB
testcase_58 AC 43 ms
12,800 KB
testcase_59 AC 43 ms
12,544 KB
testcase_60 AC 43 ms
12,544 KB
testcase_61 AC 43 ms
12,640 KB
testcase_62 AC 46 ms
12,672 KB
testcase_63 AC 45 ms
12,800 KB
testcase_64 AC 43 ms
12,608 KB
testcase_65 AC 43 ms
12,656 KB
testcase_66 AC 7 ms
5,376 KB
testcase_67 AC 37 ms
11,136 KB
testcase_68 AC 45 ms
12,672 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

use std::io::Write;

fn run() {
    input! {
        n: usize,
        q: usize,
        a: [u32; n],
        ask: [(usize1, usize); q],
    }
    let mut left = (0..n).collect::<Vec<_>>();
    for i in 1..n {
        if a[i] > a[i - 1] {
            left[i] = left[i - 1];
        }
    }
    let mut sum = vec![M::zero(); n + 1];
    for (i, a) in a.iter().enumerate().rev() {
        sum[i] = M::new(2) * sum[i + 1] + M::new(*a);
    }
    let out = std::io::stdout();
    let mut out = std::io::BufWriter::new(out.lock());
    for (l, r) in ask {
        let l = left[r - 1].max(l);
        let ans = M::new(a[l]) + sum[l + 1] - sum[r] * M::new(2).pow((r - l - 1) as u64);
        writeln!(out, "{}", ans).ok();
    }
}

fn main() {
    run();
}

// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
#[macro_export]
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_export]
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_export]
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 ----------
// ---------- begin modint ----------
use std::marker::*;
use std::ops::*;

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

pub struct ConstantModulo<const M: u32>;

impl<const M: u32> Modulo for ConstantModulo<{ M }> {
    fn modulo() -> u32 {
        M
    }
}

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

impl<T> Clone for ModInt<T> {
    fn clone(&self) -> Self {
        Self::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 v = self.0 + rhs.0;
        if v >= T::modulo() {
            v -= T::modulo();
        }
        Self::new_unchecked(v)
    }
}

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 v = self.0 - rhs.0;
        if self.0 < rhs.0 {
            v += T::modulo();
        }
        Self::new_unchecked(v)
    }
}

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;
        Self::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.is_zero() {
            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> Default for ModInt<T> {
    fn default() -> Self {
        Self::zero()
    }
}

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 mut v = ((val % T::modulo() as i64) + T::modulo() as i64) as u32;
        if v >= T::modulo() {
            v -= T::modulo();
        }
        ModInt::new_unchecked(v)
    }
}

impl<T> ModInt<T> {
    pub fn new_unchecked(n: u32) -> Self {
        ModInt(n, 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
    }
}

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
    }
    pub fn inv(&self) -> Self {
        assert!(!self.is_zero());
        self.pow(T::modulo() as u64 - 2)
    }
    pub fn fact(n: usize) -> Self {
        (1..=n).fold(Self::one(), |s, a| s * Self::from(a))
    }
    pub fn perm(n: usize, k: usize) -> Self {
        if k > n {
            return Self::zero();
        }
        ((n - k + 1)..=n).fold(Self::one(), |s, a| s * Self::from(a))
    }
    pub fn binom(n: usize, k: usize) -> Self {
        if k > n {
            return Self::zero();
        }
        let k = k.min(n - k);
        let mut nu = Self::one();
        let mut de = Self::one();
        for i in 0..k {
            nu *= Self::from(n - i);
            de *= Self::from(i + 1);
        }
        nu * de.inv()
    }
}
// ---------- end modint ----------
// ---------- begin precalc ----------
pub struct Precalc<T> {
    fact: Vec<ModInt<T>>,
    ifact: Vec<ModInt<T>>,
    inv: Vec<ModInt<T>>,
}

impl<T: Modulo> Precalc<T> {
    pub fn new(n: usize) -> Precalc<T> {
        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 {
            fact[i] = fact[i - 1] * ModInt::new_unchecked(i as u32);
        }
        ifact[n] = fact[n].inv();
        if n > 0 {
            inv[n] = ifact[n] * fact[n - 1];
        }
        for i in (1..n).rev() {
            ifact[i] = ifact[i + 1] * ModInt::new_unchecked((i + 1) as u32);
            inv[i] = ifact[i] * fact[i - 1];
        }
        Precalc { fact, ifact, inv }
    }
    pub fn inv(&self, n: usize) -> ModInt<T> {
        assert!(n > 0);
        self.inv[n]
    }
    pub fn fact(&self, n: usize) -> ModInt<T> {
        self.fact[n]
    }
    pub fn ifact(&self, n: usize) -> ModInt<T> {
        self.ifact[n]
    }
    pub fn perm(&self, n: usize, k: usize) -> ModInt<T> {
        if k > n {
            return ModInt::zero();
        }
        self.fact[n] * self.ifact[n - k]
    }
    pub fn binom(&self, n: usize, k: usize) -> ModInt<T> {
        if k > n {
            return ModInt::zero();
        }
        self.fact[n] * self.ifact[k] * self.ifact[n - k]
    }
}
// ---------- end precalc ----------

type M = ModInt<ConstantModulo<998_244_353>>;
0