結果

問題 No.1282 Display Elements
ユーザー phsplsphspls
提出日時 2022-11-14 11:38:26
言語 Rust
(1.77.0)
結果
AC  
実行時間 92 ms / 2,000 ms
コード長 2,832 bytes
コンパイル時間 8,228 ms
コンパイル使用メモリ 180,104 KB
実行使用メモリ 16,752 KB
最終ジャッジ日時 2023-10-13 17:54:42
合計ジャッジ時間 10,889 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,348 KB
testcase_01 AC 1 ms
4,348 KB
testcase_02 AC 1 ms
4,352 KB
testcase_03 AC 1 ms
4,352 KB
testcase_04 AC 1 ms
4,352 KB
testcase_05 AC 1 ms
4,352 KB
testcase_06 AC 1 ms
4,352 KB
testcase_07 AC 1 ms
4,352 KB
testcase_08 AC 1 ms
4,356 KB
testcase_09 AC 1 ms
4,356 KB
testcase_10 AC 1 ms
4,348 KB
testcase_11 AC 1 ms
4,352 KB
testcase_12 AC 1 ms
4,348 KB
testcase_13 AC 1 ms
4,348 KB
testcase_14 AC 1 ms
4,348 KB
testcase_15 AC 84 ms
15,748 KB
testcase_16 AC 30 ms
7,880 KB
testcase_17 AC 68 ms
14,780 KB
testcase_18 AC 39 ms
8,856 KB
testcase_19 AC 18 ms
6,664 KB
testcase_20 AC 18 ms
6,480 KB
testcase_21 AC 92 ms
16,752 KB
testcase_22 AC 39 ms
6,748 KB
testcase_23 AC 88 ms
16,752 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: variable does not need to be mutable
  --> Main.rs:76:9
   |
76 |     let mut a: Vec<usize> = a.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
   |         ----^
   |         |
   |         help: remove this `mut`
   |
   = note: `#[warn(unused_mut)]` on by default

warning: field `orgn` is never read
 --> Main.rs:6:5
  |
4 | struct SegmentTree<F, T> {
  |        ----------- field in this struct
5 |     n: usize,
6 |     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: associated function `find_closed` is never used
  --> Main.rs:28:8
   |
28 |     fn find_closed(&self, l: usize, r: usize) -> T {
   |        ^^^^^^^^^^^

warning: 3 warnings emitted

ソースコード

diff # 

use std::collections::{BTreeSet, HashMap};

#[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 mut a: Vec<usize> = a.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
    let mut b = String::new();
    std::io::stdin().read_line(&mut b).ok();
    let b: Vec<usize> = b.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();

    let mut vals = a.iter().copied().collect::<BTreeSet<_>>();
    for &v in b.iter() { vals.insert(v); }
    let mapping = vals.iter().enumerate().map(|(i, &v)| (v, i)).collect::<HashMap<usize, usize>>();
    let mut a = a.into_iter().map(|v| *mapping.get(&v).unwrap()).collect::<Vec<_>>();
    let b = b.into_iter().map(|v| *mapping.get(&v).unwrap()).collect::<Vec<_>>();
    a.sort();
    let mut segtree = SegmentTree::new(vals.len(), 0usize, |x, y| x+y);
    let mut result = 0usize;
    for i in 0..n {
        let val = segtree.get(b[i]);
        segtree.set(b[i], val+1);
        result += segtree.find(0, a[i]);
    }
    println!("{}", result);
}
0