結果

問題 No.1193 Penguin Sequence
ユーザー koba-e964koba-e964
提出日時 2021-10-09 17:41:16
言語 Rust
(1.77.0)
結果
AC  
実行時間 159 ms / 2,000 ms
コード長 6,766 bytes
コンパイル時間 4,374 ms
コンパイル使用メモリ 162,440 KB
実行使用メモリ 12,996 KB
最終ジャッジ日時 2023-10-11 04:21:08
合計ジャッジ時間 7,190 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 95 ms
12,916 KB
testcase_01 AC 158 ms
12,788 KB
testcase_02 AC 158 ms
12,824 KB
testcase_03 AC 156 ms
12,832 KB
testcase_04 AC 156 ms
12,872 KB
testcase_05 AC 159 ms
12,996 KB
testcase_06 AC 155 ms
12,868 KB
testcase_07 AC 157 ms
12,816 KB
testcase_08 AC 156 ms
12,828 KB
testcase_09 AC 157 ms
12,840 KB
testcase_10 AC 156 ms
12,808 KB
testcase_11 AC 82 ms
8,092 KB
testcase_12 AC 83 ms
8,188 KB
testcase_13 AC 132 ms
11,456 KB
testcase_14 AC 121 ms
10,736 KB
testcase_15 AC 146 ms
12,220 KB
testcase_16 AC 62 ms
8,216 KB
testcase_17 AC 1 ms
4,348 KB
testcase_18 AC 11 ms
4,352 KB
testcase_19 AC 155 ms
12,780 KB
testcase_20 AC 117 ms
10,528 KB
testcase_21 AC 91 ms
8,860 KB
testcase_22 AC 14 ms
4,352 KB
testcase_23 AC 75 ms
7,632 KB
testcase_24 AC 65 ms
6,992 KB
testcase_25 AC 29 ms
4,352 KB
testcase_26 AC 7 ms
4,352 KB
testcase_27 AC 129 ms
11,168 KB
testcase_28 AC 85 ms
8,452 KB
testcase_29 AC 132 ms
11,272 KB
testcase_30 AC 41 ms
5,284 KB
testcase_31 AC 34 ms
4,764 KB
testcase_32 AC 100 ms
9,320 KB
testcase_33 AC 68 ms
7,200 KB
testcase_34 AC 54 ms
6,256 KB
testcase_35 AC 70 ms
7,104 KB
testcase_36 AC 53 ms
6,040 KB
testcase_37 AC 125 ms
11,020 KB
testcase_38 AC 1 ms
4,352 KB
testcase_39 AC 1 ms
4,348 KB
testcase_40 AC 1 ms
4,348 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, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };
    ($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> From<i64> for ModInt<M> {
        fn from(x: i64) -> Self { Self::new(x) }
    }
} // 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>;

// Depends on MInt.rs
fn fact_init(w: usize) -> (Vec<MInt>, Vec<MInt>) {
    let mut fac = vec![MInt::new(1); w];
    let mut invfac = vec![0.into(); w];
    for i in 1..w {
        fac[i] = fac[i - 1] * i as i64;
    }
    invfac[w - 1] = fac[w - 1].inv();
    for i in (0..w - 1).rev() {
        invfac[i] = invfac[i + 1] * (i as i64 + 1);
    }
    (fac, invfac)
}

/// Binary Indexed Tree (Fenwick Tree). Holds an array of type T.
/// T is a commutative monoid. Indices are 1 .. n.
/// Verified by yukicoder No.404 (http://yukicoder.me/submissions/155373)
struct BIT<T> {
    n: usize,
    ary: Vec<T>,
    e: T,
}

impl<T: Clone + std::ops::AddAssign<T>> BIT<T> {
    fn new(n: usize, e: T) -> Self {
        let n = n.next_power_of_two();
        BIT { n: n, ary: vec![e.clone(); n + 1], e: e }
    }
    /**
     * gets the sum in [1 .. idx]
     * @param idx
     * @return sum
     */
    fn accum(&self, mut idx: usize) -> T {
        let mut sum = self.e.clone();
        while idx > 0 {
            sum += self.ary[idx].clone();
            idx &= idx - 1;
        }
        sum
    }
    /**
     * performs data[idx] += val;
     */
    fn add<U: Clone>(&mut self, mut idx: usize, val: U)
        where T: std::ops::AddAssign<U> {
        assert!(idx > 0);
        let n = self.n;
        while idx <= n {
            self.ary[idx] += val.clone();
            idx += idx & idx.wrapping_neg();
        }
    }
    /// Make sure that 1 <= idx <= n.
    #[allow(unused)]
    fn single(&self, idx: usize) -> T
        where T: std::ops::Sub<Output = T> {
        self.accum(idx) - self.accum(idx - 1)
    }
}

fn main() {
    input! {
        n: usize,
        a: [i64; n],
    }
    let (fac, invfac) = fact_init(n + 1);
    let mut coo = a.clone();
    coo.sort(); coo.dedup();
    let m = coo.len();
    let mut tot = MInt::new(0);
    let mut f = vec![0; m];
    for &a in &a {
        let a = coo.binary_search(&a).unwrap();
        f[a] += 1;
    }
    let mut acc = vec![0; m + 1];
    for i in 0..m {
        acc[i + 1] = acc[i] + f[i];
    }
    let ninv2 = MInt::new(n as i64 * n as i64 * 2).inv();
    // inter
    let mut stairs = MInt::new(0);
    let mut sq = MInt::new(0);
    for i in 1..n + 1 {
        let i = i as i64;
        stairs += i;
        sq += i * i;
    }
    for i in 0..m {
        let count = acc[i] as i64 * f[i];
        tot += (stairs * stairs - sq) * ninv2 * count;
    }
    // self-contained
    let mut tmp = MInt::new(0);
    for i in 1..n + 1 {
        tmp += i as i64 * (i as i64 - 1);
    }
    tmp *= MInt::new(n as i64 * (n - 1) as i64).inv();
    let mut bit = BIT::new(m, 0);
    for i in 0..n {
        let a = coo.binary_search(&a[i]).unwrap();
        tot += tmp * (i as i64 - bit.accum(a + 1));
        bit.add(a + 1, 1);
    }
    for i in 1..n + 1 {
        tot *= fac[n] * invfac[i] * invfac[n - i];
    }
    println!("{}", tot);
}
0