結果
問題 | No.2665 Minimize Inversions of Deque |
ユーザー | Moss_Local |
提出日時 | 2024-03-08 22:29:04 |
言語 | Rust (1.83.0 + proconio) |
結果 |
AC
|
実行時間 | 91 ms / 2,000 ms |
コード長 | 9,105 bytes |
コンパイル時間 | 11,120 ms |
コンパイル使用メモリ | 384,268 KB |
実行使用メモリ | 9,372 KB |
最終ジャッジ日時 | 2024-09-29 19:57:49 |
合計ジャッジ時間 | 16,075 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 40 |
コンパイルメッセージ
warning: unnecessary parentheses around match arm expression --> src/main.rs:293:46 | 293 | std::ops::Bound::Included(&x) => (x + 1), | ^ ^ | = note: `#[warn(unused_parens)]` on by default help: remove these parentheses | 293 - std::ops::Bound::Included(&x) => (x + 1), 293 + std::ops::Bound::Included(&x) => x + 1, | warning: variable does not need to be mutable --> src/main.rs:122:9 | 122 | let mut vec: Vec<i64> = read_vec(); | ----^^^ | | | help: remove this `mut` | = note: `#[warn(unused_mut)]` on by default warning: variable does not need to be mutable --> src/main.rs:128:9 | 128 | let mut vec: Vec<i64> = read_vec(); | ----^^^ | | | help: remove this `mut` warning: variable does not need to be mutable --> src/main.rs:133:9 | 133 | let mut vec: Vec<usize> = read_vec(); | ----^^^ | | | help: remove this `mut` warning: variable does not need to be mutable --> src/main.rs:139:9 | 139 | let mut vec: Vec<f64> = read_vec(); | ----^^^ | | | help: remove this `mut` warning: variable does not need to be mutable --> src/main.rs:144:9 | 144 | let mut vec: Vec<char> = read_vec(); | ----^^^ | | | help: remove this `mut` warning: variable does not need to be mutable --> src/main.rs:149:9 | 149 | let mut vec: Vec<usize> = read_vec(); | ----^^^ | | | help: remove this `mut` warning: variable does not need to be mutable --> src/main.rs:154:9 | 154 | let mut vec: Vec<i64> = read_vec(); | ----^^^ | | | help: remove this `mut` warning: variable does not need to be mutable --> src/main.rs:160:9 | 160 | let mut vec: Vec<usize>
ソースコード
// -*- coding:utf-8-unix -*-// #![feature(map_first_last)]#![allow(dead_code)]#![allow(unused_imports)]#![allow(unused_macros)]// use core::num;use std::cmp::*;use std::fmt::*;use std::hash::*;use std::iter::FromIterator;use std::*;use std::{cmp, collections, fmt, io, iter, ops, str};const INF: i64 = 1223372036854775807;const UINF: usize = INF as usize;const LINF: i64 = 2147483647;const INF128: i128 = 1223372036854775807000000000000;const MOD1: i64 = 1000000007;const MOD9: i64 = 998244353;const MOD: i64 = MOD9;// const MOD: i64 = MOD2;const UMOD: usize = MOD as usize;const M_PI: f64 = 3.14159265358979323846;// use proconio::input;// const MOD: i64 = INF;use cmp::Ordering::*;use std::collections::*;use std::io::stdin;use std::io::stdout;use std::io::Write;macro_rules! p {($x:expr) => {//if exprprintln!("{}", $x);};}macro_rules! vp {// vector print separate with space($x:expr) => {println!("{}",$x.iter().map(|x| x.to_string()).collect::<Vec<_>>().join(" "));};}macro_rules! d {($x:expr) => {eprintln!("{:?}", $x);};}macro_rules! yn {($val:expr) => {if $val {println!("Yes");} else {println!("No");}};}macro_rules! map{// declear btreemap($($key:expr => $val:expr),*) => {{let mut map = ::std::collections::BTreeMap::new();$(map.insert($key, $val);)*map}};}macro_rules! set{// declear btreemap($($key:expr),*) => {{let mut set = ::std::collections::BTreeSet::new();$(set.insert($key);)*set}};}fn main() {solve();}// use str::Chars;#[allow(dead_code)]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()}#[allow(dead_code)]fn read_vec<T: std::str::FromStr>() -> Vec<T> {read::<String>().split_whitespace().map(|e| e.parse().ok().unwrap()).collect()}#[allow(dead_code)]fn read_mat<T: std::str::FromStr>(n: u32) -> Vec<Vec<T>> {(0..n).map(|_| read_vec()).collect()}#[allow(dead_code)]fn readii() -> (i64, i64) {let mut vec: Vec<i64> = read_vec();(vec[0], vec[1])}#[allow(dead_code)]fn readiii() -> (i64, i64, i64) {let mut vec: Vec<i64> = read_vec();(vec[0], vec[1], vec[2])}#[allow(dead_code)]fn readuu() -> (usize, usize) {let mut vec: Vec<usize> = read_vec();(vec[0], vec[1])}#[allow(dead_code)]fn readff() -> (f64, f64) {let mut vec: Vec<f64> = read_vec();(vec[0], vec[1])}fn readcc() -> (char, char) {let mut vec: Vec<char> = read_vec();(vec[0], vec[1])}fn readuuu() -> (usize, usize, usize) {let mut vec: Vec<usize> = read_vec();(vec[0], vec[1], vec[2])}#[allow(dead_code)]fn readiiii() -> (i64, i64, i64, i64) {let mut vec: Vec<i64> = read_vec();(vec[0], vec[1], vec[2], vec[3])}#[allow(dead_code)]fn readuuuu() -> (usize, usize, usize, usize) {let mut vec: Vec<usize> = read_vec();(vec[0], vec[1], vec[2], vec[3])}fn read_imat(h: usize) -> Vec<Vec<i64>> {(0..h).map(|_| read_vec()).collect()}fn read_cmat(h: usize) -> Vec<Vec<char>> {(0..h).map(|_| read::<String>().chars().collect()).collect()}pub struct Dsu {n: usize,// root node: -1 * component size// otherwise: parentparent_or_size: Vec<i32>,}impl Dsu {// 0 <= size <= 10^8 is constrained.pub fn new(size: usize) -> Self {Self {n: size,parent_or_size: vec![-1; size],}}pub fn merge(&mut self, a: usize, b: usize) -> usize {assert!(a < self.n);assert!(b < self.n);let (mut x, mut y) = (self.leader(a), self.leader(b));if x == y {return x;}if -self.parent_or_size[x] < -self.parent_or_size[y] {std::mem::swap(&mut x, &mut y);}self.parent_or_size[x] += self.parent_or_size[y];self.parent_or_size[y] = x as i32;x}pub fn same(&mut self, a: usize, b: usize) -> bool {assert!(a < self.n);assert!(b < self.n);self.leader(a) == self.leader(b)}pub fn leader(&mut self, a: usize) -> usize {assert!(a < self.n);if self.parent_or_size[a] < 0 {return a;}self.parent_or_size[a] = self.leader(self.parent_or_size[a] as usize) as i32;self.parent_or_size[a] as usize}pub fn size(&mut self, a: usize) -> usize {assert!(a < self.n);let x = self.leader(a);-self.parent_or_size[x] as usize}pub fn groups(&mut self) -> Vec<Vec<usize>> {let mut leader_buf = vec![0; self.n];let mut group_size = vec![0; self.n];for i in 0..self.n {leader_buf[i] = self.leader(i);group_size[leader_buf[i]] += 1;}let mut result = vec![Vec::new(); self.n];for i in 0..self.n {result[i].reserve(group_size[i]);}for i in 0..self.n {result[leader_buf[i]].push(i);}result.into_iter().filter(|x| !x.is_empty()).collect::<Vec<Vec<usize>>>()}}pub struct SEG<M: Monoid> {n: usize,buf: Vec<M::T>,}impl<M: Monoid> SEG<M> {#[allow(dead_code)]pub fn new(n: usize) -> SEG<M> {SEG {n,buf: vec![M::id(); 2 * n],}}#[allow(dead_code)]pub fn update(&mut self, k: usize, a: M::T) {let mut k = k + self.n;self.buf[k] = a;while k > 0 {k >>= 1;self.buf[k] = M::op(&self.buf[k << 1], &self.buf[(k << 1) | 1]);}}#[allow(dead_code)]pub fn add(&mut self, k: usize, a: &M::T) {let mut k = k + self.n;self.buf[k] = M::op(&self.buf[k], a);while k > 0 {k >>= 1;self.buf[k] = M::op(&self.buf[k << 1], &self.buf[(k << 1) | 1]);}}#[allow(dead_code)]pub fn get(&self, i: usize) -> M::T {self.query(i, i + 1)}#[allow(dead_code)]pub fn query_range<R: std::ops::RangeBounds<usize>>(&self, range: R) -> M::T {let l = match range.start_bound() {std::ops::Bound::Excluded(&x) => {assert!(x > 0);x - 1}std::ops::Bound::Included(&x) => x,std::ops::Bound::Unbounded => 0,};let r = match range.end_bound() {std::ops::Bound::Excluded(&x) => x,std::ops::Bound::Included(&x) => (x + 1),std::ops::Bound::Unbounded => self.n,};self.query(l, r)}#[allow(dead_code)]pub fn query(&self, l: usize, r: usize) -> M::T {let mut vl = M::id();let mut vr = M::id();let mut l = l + self.n;let mut r = r + self.n;while l < r {if l & 1 == 1 {vl = M::op(&vl, &self.buf[l]);l += 1;}if r & 1 == 1 {r -= 1;vr = M::op(&self.buf[r], &vr);}l >>= 1;r >>= 1;}M::op(&vl, &vr)}}pub trait Monoid {type T: Clone;fn id() -> Self::T;fn op(a: &Self::T, b: &Self::T) -> Self::T;}pub enum MON {}impl Monoid for MON {type T = u64;fn id() -> Self::T {0}fn op(a: &Self::T, b: &Self::T) -> Self::T {*a + *b}}fn solve_part() {let n: usize = read();// let mut set = set![];let mut dq = VecDeque::new();let mut p: Vec<usize> = read_vec();let mut seg: SEG<MON> = SEG::new(n + 1);let mut res = 0;for i in 0..n {let x = p[i];// let less_cnt = set.range(0..x).count();// let more_cnt = set.range(x + 1..).count();let less_cnt = seg.query_range(0..x) as usize;let more_cnt = seg.query_range(x + 1..=n) as usize;if less_cnt > more_cnt {dq.push_back(x);res += more_cnt;} else if less_cnt < more_cnt {dq.push_front(x);res += less_cnt;} else {let front = *dq.front().unwrap_or(&UINF);if front > x {dq.push_front(x)} else {dq.push_back(x);}res += less_cnt;}seg.update(x, 1);}println!("{}", res);for i in 0..n {if i != 0 {print!(" ");}print!("{}", dq.pop_front().unwrap());}println!();return;}fn solve() {let n: usize = read();for i in 0..n {solve_part();}return;}