結果

問題 No.1300 Sum of Inversions
ユーザー phsplsphspls
提出日時 2022-11-25 01:23:06
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 261 ms / 2,000 ms
コード長 3,152 bytes
コンパイル時間 13,747 ms
コンパイル使用メモリ 390,272 KB
実行使用メモリ 29,940 KB
最終ジャッジ日時 2024-10-01 13:19:56
合計ジャッジ時間 20,751 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
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 199 ms
24,004 KB
testcase_04 AC 199 ms
23,252 KB
testcase_05 AC 167 ms
19,412 KB
testcase_06 AC 240 ms
26,516 KB
testcase_07 AC 235 ms
25,560 KB
testcase_08 AC 243 ms
27,780 KB
testcase_09 AC 248 ms
27,628 KB
testcase_10 AC 127 ms
16,580 KB
testcase_11 AC 122 ms
16,736 KB
testcase_12 AC 192 ms
23,408 KB
testcase_13 AC 196 ms
22,804 KB
testcase_14 AC 261 ms
29,940 KB
testcase_15 AC 243 ms
27,600 KB
testcase_16 AC 200 ms
24,352 KB
testcase_17 AC 121 ms
16,108 KB
testcase_18 AC 136 ms
18,004 KB
testcase_19 AC 169 ms
20,804 KB
testcase_20 AC 178 ms
21,256 KB
testcase_21 AC 179 ms
21,252 KB
testcase_22 AC 150 ms
19,148 KB
testcase_23 AC 234 ms
26,500 KB
testcase_24 AC 153 ms
19,888 KB
testcase_25 AC 134 ms
17,528 KB
testcase_26 AC 126 ms
17,352 KB
testcase_27 AC 145 ms
18,804 KB
testcase_28 AC 251 ms
28,240 KB
testcase_29 AC 171 ms
21,092 KB
testcase_30 AC 239 ms
27,556 KB
testcase_31 AC 149 ms
19,572 KB
testcase_32 AC 155 ms
20,184 KB
testcase_33 AC 151 ms
27,328 KB
testcase_34 AC 165 ms
29,212 KB
testcase_35 AC 156 ms
28,264 KB
testcase_36 AC 158 ms
28,892 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: field `orgn` is never read
 --> src/main.rs:7:5
  |
5 | struct SegmentTree<F, T> {
  |        ----------- field in this struct
6 |     n: usize,
7 |     orgn: usize,
  |     ^^^^
  |
  = note: `SegmentTree` has derived impls for the traits `Clone` and `Debug`, but these are intentionally ignored during dead code analysis
  = note: `#[warn(dead_code)]` on by default

warning: methods `find_closed` and `get` are never used
  --> src/main.rs:29:8
   |
13 | / impl<F, T> SegmentTree<F, T> where
14 | | T: std::fmt::Debug + Copy,
15 | | F: Fn(T, T) -> T
   | |________________- methods in this implementation
...
29 |       fn find_closed(&self, l: usize, r: usize) -> T {
   |          ^^^^^^^^^^^
...
46 |       fn get(&mut self, pos: usize) -> T {
   |          ^^^

ソースコード

diff # 

const MOD: usize = 998244353;

#[derive(Debug, Clone)]
struct SegmentTree<F, T> {
    n: usize,
    orgn: usize,
    unit: T,
    mem: Vec<T>,
    operator: F
}

impl<F, T> SegmentTree<F, T> where
T: std::fmt::Debug + Copy,
F: Fn(T, T) -> T
{
    fn new(n: usize, unit: T, operator: F) -> Self {
        let mut size = 1usize;
        while size < n { size *= 2; }
        Self {
            n: size,
            orgn: n,
            unit: unit,
            mem: vec![unit; size*2-1],
            operator: operator,
        }
    }

    fn find_closed(&self, l: usize, r: usize) -> T {
        self.find(l, r+1)
    }

    fn find(&self, l: usize, r: usize) -> T {
        self._find(l, r, 0, 0, self.n)
    }

    fn set(&mut self, pos: usize, val: T) {
        let mut pos = pos + self.n - 1;
        self.mem[pos] = val;
        while pos > 0 {
            pos = self._parent(pos);
            self.mem[pos] = (self.operator)(self.mem[self._left(pos)], self.mem[self._right(pos)]);
        }
    }

    fn get(&mut self, pos: usize) -> T {
        self.mem[pos + self.n - 1]
    }

    fn _find(&self, a: usize, b: usize, nodenum: usize, l: usize, r: usize) -> T {
        if r <= a || b <= l {
            return self.unit;
        } else if a <= l && r <= b {
            return self.mem[nodenum];
        }
        let left = self._find(a, b, self._left(nodenum), l, (l+r)/2);
        let right = self._find(a, b, self._right(nodenum), (l+r)/2, r);
        (self.operator)(left, right)
    }
    fn _left(&self, k: usize) -> usize {
        2*k+1
    }
    fn _right(&self, k: usize) -> usize {
        2*k+2
    }
    fn _parent(&self, k: usize) -> usize {
        (k-1)/2
    }
}

fn main() {
    let mut n = String::new();
    std::io::stdin().read_line(&mut n).ok();
    let n: usize = n.trim().parse().unwrap();
    let mut a = String::new();
    std::io::stdin().read_line(&mut a).ok();
    let a: Vec<usize> = a.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();

    let orga = a.clone().to_owned();
    let mut maxvalseg = SegmentTree::new(n, 0usize, |x, y| x + y);
    let mut maxcntseg = SegmentTree::new(n, 0usize, |x, y| x + y);
    let mut minvalseg = SegmentTree::new(n, 0usize, |x, y| x + y);
    let mut mincntseg = SegmentTree::new(n, 0usize, |x, y| x + y);
    let mut maxvals = vec![0usize; n];
    let mut minvals = vec![0usize; n];
    let mut maxcnts = vec![0usize; n];
    let mut mincnts = vec![0usize; n];
    let mut a = (0..n).map(|i| (a[i], i)).collect::<Vec<_>>();
    a.sort();
    for &(val, i) in a.iter() {
        minvals[i] = minvalseg.find(i, n);
        mincnts[i] = mincntseg.find(i, n);
        minvalseg.set(i, val);
        mincntseg.set(i, 1);
    }
    a.reverse();
    for &(val, i) in a.iter() {
        maxvals[i] = maxvalseg.find(0, i);
        maxcnts[i] = maxcntseg.find(0, i);
        maxvalseg.set(i, val);
        maxcntseg.set(i, 1);
    }
    let mut result = 0usize;
    for i in 0..n {
        result += maxvals[i] * mincnts[i] % MOD + minvals[i] * maxcnts[i] % MOD + maxcnts[i] * mincnts[i] % MOD * orga[i] % MOD;
        result %= MOD;
    }
    println!("{}", result);
}
0