結果

問題 No.1300 Sum of Inversions
ユーザー phsplsphspls
提出日時 2022-11-17 11:08:19
言語 Rust
(1.77.0)
結果
AC  
実行時間 420 ms / 2,000 ms
コード長 3,194 bytes
コンパイル時間 1,485 ms
コンパイル使用メモリ 181,144 KB
実行使用メモリ 26,856 KB
最終ジャッジ日時 2023-10-19 04:02:11
合計ジャッジ時間 14,449 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,348 KB
testcase_01 AC 1 ms
4,348 KB
testcase_02 AC 1 ms
4,348 KB
testcase_03 AC 309 ms
23,868 KB
testcase_04 AC 305 ms
20,040 KB
testcase_05 AC 236 ms
16,820 KB
testcase_06 AC 359 ms
25,532 KB
testcase_07 AC 342 ms
23,172 KB
testcase_08 AC 381 ms
23,656 KB
testcase_09 AC 387 ms
24,952 KB
testcase_10 AC 184 ms
14,348 KB
testcase_11 AC 188 ms
14,524 KB
testcase_12 AC 308 ms
20,148 KB
testcase_13 AC 304 ms
21,376 KB
testcase_14 AC 420 ms
25,492 KB
testcase_15 AC 383 ms
23,508 KB
testcase_16 AC 318 ms
22,500 KB
testcase_17 AC 179 ms
13,932 KB
testcase_18 AC 211 ms
15,572 KB
testcase_19 AC 281 ms
20,040 KB
testcase_20 AC 283 ms
18,276 KB
testcase_21 AC 279 ms
20,256 KB
testcase_22 AC 239 ms
16,944 KB
testcase_23 AC 364 ms
23,936 KB
testcase_24 AC 248 ms
17,288 KB
testcase_25 AC 204 ms
15,280 KB
testcase_26 AC 203 ms
15,064 KB
testcase_27 AC 232 ms
16,448 KB
testcase_28 AC 398 ms
24,272 KB
testcase_29 AC 271 ms
20,300 KB
testcase_30 AC 384 ms
24,972 KB
testcase_31 AC 233 ms
16,960 KB
testcase_32 AC 246 ms
17,444 KB
testcase_33 AC 160 ms
24,336 KB
testcase_34 AC 167 ms
26,120 KB
testcase_35 AC 158 ms
26,160 KB
testcase_36 AC 161 ms
26,856 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
   | ---------------------------- 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 orders = (0..n).collect::<Vec<_>>();
    orders.sort_by_key(|&i| a[i]);
    let mut maxvalseg = SegmentTree::new(n, 0usize, |x, y| x + y);
    let mut minvalseg = SegmentTree::new(n, 0usize, |x, y| x + y);
    let mut maxcntseg = SegmentTree::new(n, 0usize, |x, y| x + y);
    let mut mincntseg = SegmentTree::new(n, 0usize, |x, y| x + y);
    let mut leftvals = vec![0usize; n];
    let mut rightvals = vec![0usize; n];
    let mut leftcnts = vec![0usize; n];
    let mut rightcnts = vec![0usize; n];
    for &i in orders.iter() {
        rightvals[i] = minvalseg.find(i+1, n);
        rightcnts[i] = mincntseg.find(i+1, n);
        minvalseg.set(i, a[i]);
        mincntseg.set(i, 1);
    }
    for &i in orders.iter().rev() {
        leftvals[i] = maxvalseg.find(0, i);
        leftcnts[i] = maxcntseg.find(0, i);
        maxvalseg.set(i, a[i]);
        maxcntseg.set(i, 1);
    }
    let mut result = 0usize;
    for i in 0..n {
        let target = a[i];
        result += target * leftcnts[i] % MOD * rightcnts[i] % MOD;
        result += leftvals[i] * rightcnts[i] % MOD;
        result += rightvals[i] * leftcnts[i] % MOD;
        result %= MOD;
    }
    println!("{}", result);
}
0