結果

問題 No.1300 Sum of Inversions
ユーザー phsplsphspls
提出日時 2022-12-15 23:26:27
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 373 ms / 2,000 ms
コード長 3,125 bytes
コンパイル時間 1,773 ms
コンパイル使用メモリ 167,424 KB
実行使用メモリ 27,520 KB
最終ジャッジ日時 2024-04-26 23:05:58
合計ジャッジ時間 12,158 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 1 ms
5,376 KB
testcase_02 AC 1 ms
5,376 KB
testcase_03 AC 284 ms
21,624 KB
testcase_04 AC 270 ms
21,084 KB
testcase_05 AC 201 ms
17,696 KB
testcase_06 AC 323 ms
23,896 KB
testcase_07 AC 301 ms
23,012 KB
testcase_08 AC 343 ms
24,980 KB
testcase_09 AC 351 ms
24,940 KB
testcase_10 AC 170 ms
15,084 KB
testcase_11 AC 168 ms
15,244 KB
testcase_12 AC 278 ms
21,124 KB
testcase_13 AC 264 ms
20,624 KB
testcase_14 AC 373 ms
27,004 KB
testcase_15 AC 348 ms
24,780 KB
testcase_16 AC 283 ms
22,128 KB
testcase_17 AC 164 ms
14,588 KB
testcase_18 AC 189 ms
16,464 KB
testcase_19 AC 231 ms
19,160 KB
testcase_20 AC 250 ms
19,392 KB
testcase_21 AC 247 ms
19,244 KB
testcase_22 AC 218 ms
17,688 KB
testcase_23 AC 329 ms
24,008 KB
testcase_24 AC 219 ms
18,072 KB
testcase_25 AC 187 ms
15,960 KB
testcase_26 AC 184 ms
15,772 KB
testcase_27 AC 212 ms
17,320 KB
testcase_28 AC 359 ms
25,496 KB
testcase_29 AC 242 ms
19,208 KB
testcase_30 AC 345 ms
25,056 KB
testcase_31 AC 212 ms
17,860 KB
testcase_32 AC 230 ms
18,384 KB
testcase_33 AC 159 ms
25,728 KB
testcase_34 AC 168 ms
27,520 KB
testcase_35 AC 160 ms
26,624 KB
testcase_36 AC 161 ms
27,392 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: field `orgn` is never read
 --> 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
  --> 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 {
   |          ^^^

warning: 2 warnings emitted

ソースコード

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 mut a = (0..n).map(|i| (a[i], i)).collect::<Vec<_>>();
    a.sort();
    let mut minvalseg = SegmentTree::new(n, 0usize, |x, y| x + y);
    let mut maxvalseg = SegmentTree::new(n, 0usize, |x, y| x + y);
    let mut mincntseg = SegmentTree::new(n, 0usize, |x, y| x + y);
    let mut maxcntseg = SegmentTree::new(n, 0usize, |x, y| x + y);
    let mut min_cnts = vec![0usize; n];
    let mut max_cnts = vec![0usize; n];
    let mut min_vals = vec![0usize; n];
    let mut max_vals = vec![0usize; n];
    for &(v, i) in a.iter() {
        min_cnts[i] = mincntseg.find(i, n);
        mincntseg.set(i, 1);
        min_vals[i] = minvalseg.find(i, n) % MOD;
        minvalseg.set(i, v);
    }
    a.reverse();
    for &(v, i) in a.iter() {
        max_cnts[i] = maxcntseg.find(0, i);
        maxcntseg.set(i, 1);
        max_vals[i] = maxvalseg.find(0, i) % MOD;
        maxvalseg.set(i, v);
    }
    let mut result = 0usize;
    for &(v, i) in a.iter() {
        result += min_cnts[i] * max_vals[i] + max_cnts[i] * min_vals[i] + v * min_cnts[i] % MOD * max_cnts[i] % MOD;
        result %= MOD;
    }
    println!("{}", result);
}
0