結果

問題 No.1115 二つの数列 / Two Sequences
ユーザー fukafukatani
提出日時 2020-07-17 22:31:01
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 24 ms / 2,000 ms
コード長 1,888 bytes
コンパイル時間 15,991 ms
コンパイル使用メモリ 378,776 KB
実行使用メモリ 8,164 KB
最終ジャッジ日時 2024-11-30 01:19:44
合計ジャッジ時間 15,912 ms
ジャッジサーバーID
(参考情報)
judge3 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 5
other AC * 35
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#![allow(unused_imports)]
#![allow(non_snake_case)]
use std::cmp::*;
use std::collections::*;
use std::io::Write;
#[allow(unused_macros)]
macro_rules! debug {
($($e:expr),*) => {
#[cfg(debug_assertions)]
$({
let (e, mut err) = (stringify!($e), std::io::stderr());
writeln!(err, "{} = {:?}", e, $e).unwrap()
})*
};
}
fn main() {
let n = read::<usize>();
let a = read_vec::<usize>();
let b = read_vec::<usize>();
let mut dict = HashMap::new();
for i in 0..n {
dict.insert(b[i], i + 1);
}
let a = a.iter().map(|x| dict[&x]).collect::<Vec<_>>();
solve(a);
}
struct BinaryIndexTree {
bit: Vec<i64>,
n: usize,
}
impl BinaryIndexTree {
fn new(n: usize) -> BinaryIndexTree {
BinaryIndexTree {
bit: vec![0; n + 1],
n: n,
}
}
fn sum(&self, i: usize) -> i64 {
assert!(i > 0);
let mut i = i;
let mut s = 0i64;
while i > 0 {
s += self.bit[i];
i -= (i as i64 & -(i as i64)) as usize;
}
s
}
fn add(&mut self, i: usize, x: i64) {
assert!(i > 0);
let mut i = i;
while i <= self.n {
self.bit[i as usize] += x;
i += (i as i64 & -(i as i64)) as usize;
}
}
}
fn solve(a: Vec<usize>) {
let mut bt = BinaryIndexTree::new(a.len());
let mut ans = 0;
for i in 0..a.len() {
ans += i - bt.sum(a[i]) as usize;
bt.add(a[i] as usize, 1);
}
println!("{:?}", ans);
}
fn read<T: std::str::FromStr>() -> T {
let mut s = String::new();
std::io::stdin().read_line(&mut s).ok();
s.trim().parse().ok().unwrap()
}
fn read_vec<T: std::str::FromStr>() -> Vec<T> {
read::<String>()
.split_whitespace()
.map(|e| e.parse().ok().unwrap())
.collect()
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0