結果

問題 No.1300 Sum of Inversions
ユーザー ziita
提出日時 2021-03-29 12:03:43
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 114 ms / 2,000 ms
コード長 8,174 bytes
コンパイル時間 17,259 ms
コンパイル使用メモリ 378,320 KB
実行使用メモリ 22,480 KB
最終ジャッジ日時 2024-11-29 09:45:07
合計ジャッジ時間 18,967 ms
ジャッジサーバーID
(参考情報)
judge1 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 34
権限があれば一括ダウンロードができます

ソースコード

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

#![allow(unused_imports)]
#![allow(non_snake_case, unused)]
use std::cmp::*;
use std::collections::*;
use std::ops::*;
// https://atcoder.jp/contests/hokudai-hitachi2019-1/submissions/10518254
macro_rules! eprint {
($($t:tt)*) => {{
use ::std::io::Write;
let _ = write!(::std::io::stderr(), $($t)*);
}};
}
macro_rules! eprintln {
() => { eprintln!(""); };
($($t:tt)*) => {{
use ::std::io::Write;
let _ = writeln!(::std::io::stderr(), $($t)*);
}};
}
macro_rules! dbg {
($v:expr) => {{
let val = $v;
eprintln!("[{}:{}] {} = {:?}", file!(), line!(), stringify!($v), val);
val
}}
}
macro_rules! mat {
($($e:expr),*) => { Vec::from(vec![$($e),*]) };
($($e:expr,)*) => { Vec::from(vec![$($e),*]) };
($e:expr; $d:expr) => { Vec::from(vec![$e; $d]) };
($e:expr; $d:expr $(; $ds:expr)+) => { Vec::from(vec![mat![$e $(; $ds)*]; $d]) };
}
macro_rules! ok {
($a:ident$([$i:expr])*.$f:ident()$(@$t:ident)*) => {
$a$([$i])*.$f($($t),*)
};
($a:ident$([$i:expr])*.$f:ident($e:expr$(,$es:expr)*)$(@$t:ident)*) => { {
let t = $e;
ok!($a$([$i])*.$f($($es),*)$(@$t)*@t)
} };
}
pub fn readln() -> String {
let mut line = String::new();
::std::io::stdin().read_line(&mut line).unwrap_or_else(|e| panic!("{}", e));
line
}
macro_rules! read {
($($t:tt),*; $n:expr) => {{
let stdin = ::std::io::stdin();
let ret = ::std::io::BufRead::lines(stdin.lock()).take($n).map(|line| {
let line = line.unwrap();
let mut it = line.split_whitespace();
_read!(it; $($t),*)
}).collect::<Vec<_>>();
ret
}};
($($t:tt),*) => {{
let line = readln();
let mut it = line.split_whitespace();
_read!(it; $($t),*)
}};
}
macro_rules! _read {
($it:ident; [char]) => {
_read!($it; String).chars().collect::<Vec<_>>()
};
($it:ident; [u8]) => {
Vec::from(_read!($it; String).into_bytes())
};
($it:ident; usize1) => {
$it.next().unwrap_or_else(|| panic!("input mismatch")).parse::<usize>().unwrap_or_else(|e| panic!("{}", e)) - 1
};
($it:ident; [usize1]) => {
$it.map(|s| s.parse::<usize>().unwrap_or_else(|e| panic!("{}", e)) - 1).collect::<Vec<_>>()
};
($it:ident; [$t:ty]) => {
$it.map(|s| s.parse::<$t>().unwrap_or_else(|e| panic!("{}", e))).collect::<Vec<_>>()
};
($it:ident; $t:ty) => {
$it.next().unwrap_or_else(|| panic!("input mismatch")).parse::<$t>().unwrap_or_else(|e| panic!("{}", e))
};
($it:ident; $($t:tt),+) => {
($(_read!($it; $t)),*)
};
}
pub fn main() {
let _ = ::std::thread::Builder::new().name("run".to_string()).stack_size(32 * 1024 * 1024).spawn(run).unwrap().join();
}
const MOD: usize = 998244353;
// const MOD: usize = 1_000_000_007;
const INF: i64 = std::i64::MAX/100;
// const INF: usize = std::usize::MAX;
// const INF: i128 = std::i128::MAX/100;
#[derive(Clone, Copy)]
struct ModInt(usize);
impl std::ops::Add for ModInt {
type Output = ModInt;
fn add(self, rhs: ModInt) -> Self::Output {
let mut d = self.0 + rhs.0;
if d >= MOD {
d -= MOD;
}
ModInt(d)
}
}
impl std::ops::AddAssign for ModInt {
fn add_assign(&mut self, rhs: ModInt) {
*self = *self + rhs;
}
}
impl std::ops::Sub for ModInt {
type Output = ModInt;
fn sub(self, rhs: ModInt) -> Self::Output {
let mut d = self.0 + MOD - rhs.0;
if d >= MOD {
d -= MOD;
}
ModInt(d)
}
}
impl std::ops::SubAssign for ModInt {
fn sub_assign(&mut self, rhs: ModInt) {
*self = *self - rhs;
}
}
impl std::ops::Mul for ModInt {
type Output = ModInt;
fn mul(self, rhs: ModInt) -> Self::Output {
ModInt((self.0 as u64 * rhs.0 as u64 % MOD as u64) as usize)
}
}
impl std::ops::MulAssign for ModInt {
fn mul_assign(&mut self, rhs: ModInt) {
*self = *self * rhs;
}
}
impl std::ops::Neg for ModInt {
type Output = ModInt;
fn neg(self) -> Self::Output {
ModInt(if self.0 == 0 {0} else {MOD - self.0})
}
}
/*
impl std::fmt::Display for ModInt {
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
write!(f, "{}", self.0)
}
}
*/
#[allow(dead_code)]
impl ModInt {
pub fn new(n: usize) -> ModInt {
ModInt(n % MOD)
}
pub fn zero() -> ModInt {
ModInt(0)
}
pub fn one() -> ModInt {
ModInt(1)
}
pub fn pow(self, mut n: usize) -> ModInt {
let mut t = ModInt::one();
let mut s = self;
while n > 0 {
if n & 1 == 1 {
t *= s;
}
s *= s;
n >>= 1;
}
t
}
pub fn inv(self) -> ModInt {
self.pow(MOD - 2)
}
}
// ---------- end ModInt ----------
// ---------- begin Precalc ----------
#[allow(dead_code)]
struct Precalc {
inv: Vec<ModInt>,
fact: Vec<ModInt>,
ifact: Vec<ModInt>,
}
#[allow(dead_code)]
impl Precalc {
pub fn new(n: usize) -> Precalc {
let mut inv = vec![ModInt::one(); n + 1];
let mut fact = vec![ModInt::one(); n + 1];
let mut ifact = vec![ModInt::one(); n + 1];
for i in 2..(n + 1) {
inv[i] = -inv[MOD as usize % i] * ModInt(MOD / i as usize);
fact[i] = fact[i - 1] * ModInt(i as usize);
ifact[i] = ifact[i - 1] * inv[i];
}
Precalc {
inv: inv,
fact: fact,
ifact: ifact,
}
}
pub fn inv(&self, n: usize) -> ModInt {
self.inv[n]
}
pub fn fact(&self, n: usize) -> ModInt {
self.fact[n]
}
pub fn ifact(&self, n: usize) -> ModInt {
self.ifact[n]
}
pub fn comb(&self, n: usize, k: usize) -> ModInt {
if k > n {
return ModInt::zero();
}
self.fact[n] * self.ifact[k] * self.ifact[n - k]
}
}
// ---------- end Precalc ----------
struct BIT {
a: Vec<i64>,
n: usize,
}
impl BIT {
pub fn new(n: usize) -> Self {
BIT {
a: vec![0;n],
n: n,
}
}
pub fn add(&mut self, idx: usize, x: i64) {
let mut v = idx as i64;
loop {
self.a[v as usize] += x;
v |= v+1;
if v>=self.n as i64{
break;
}
}
}
pub fn acc(&self, idx: usize) -> i64 {
let mut ret = 0;
let mut v = (idx-1) as i64;
loop {
ret += self.a[v as usize];
v = (v & (v+1))-1;
if v<0 {
break;
}
}
ret
}
pub fn sum(&self, l: usize, r: usize) -> i64 {
(if r==0 {0} else {self.acc(r)}) - (if l==0 {0} else {self.acc(l)})
}
}
fn solve() {
let n = read!(usize);
let a = read!([i64]);
let mut b = a.clone();
b.sort();
b.dedup();
let mut map = HashMap::new();
for i in 0..b.len() {
map.insert(b[i],i);
}
let mut bit = BIT::new(n);
let mut bit2 = BIT::new(n);
let mut l = vec![0;n];
let mut lcum = vec![0;n];
for i in 0..n {
let val = *map.get(&a[i]).unwrap();
l[i] = bit.sum(val+1,n);
lcum[i] = bit2.sum(val+1,n);
bit.add(val,1);
bit2.add(val,l[i]);
}
let mut bit = BIT::new(n);
let mut bit2 = BIT::new(n);
let mut r = vec![0;n];
let mut rcum = vec![0;n];
for i in (0..n).rev() {
let val = *map.get(&a[i]).unwrap();
r[i] = bit.sum(0,val);
rcum[i] = bit2.sum(0,val);
bit.add(val,1);
bit2.add(val,r[i]);
}
let mut ans = ModInt(0);
for i in 0..n {
ans += ModInt(a[i] as usize) * ModInt(l[i] as usize)*ModInt(r[i] as usize);
ans += ModInt(a[i] as usize) * ModInt((lcum[i]%MOD as i64) as usize);
ans += ModInt(a[i] as usize) * ModInt((rcum[i]%MOD as i64) as usize);
}
println!("{}",ans.0);
}
fn run() {
let stack_size = 104_857_600; // 100 MB
let thd = std::thread::Builder::new().stack_size(stack_size);
solve();
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0