結果

問題 No.694 square1001 and Permutation 3
ユーザー phsplsphspls
提出日時 2023-01-01 15:50:34
言語 Rust
(1.77.0 + proconio)
結果
WA  
実行時間 -
コード長 2,782 bytes
コンパイル時間 12,721 ms
コンパイル使用メモリ 404,900 KB
実行使用メモリ 44,396 KB
最終ジャッジ日時 2024-05-05 05:50:38
合計ジャッジ時間 21,788 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 WA -
testcase_02 WA -
testcase_03 WA -
testcase_04 WA -
testcase_05 AC 1 ms
6,944 KB
testcase_06 AC 1 ms
6,940 KB
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 AC 1 ms
6,940 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: unused import: `cmp::Reverse`
 --> src/main.rs:1:45
  |
1 | use std::{collections::{BTreeSet, HashMap}, cmp::Reverse};
  |                                             ^^^^^^^^^^^^
  |
  = note: `#[warn(unused_imports)]` on by default

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 # 

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


#[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 a = (0..n).map(|_| {
            let mut temp = String::new();
            std::io::stdin().read_line(&mut temp).ok();
            let temp: usize = temp.trim().parse().unwrap();
            temp
        })
        .collect::<Vec<_>>();

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