結果
問題 | No.711 競技レーティング単調増加 |
ユーザー | cotton_fn_ |
提出日時 | 2020-04-30 03:50:51 |
言語 | Rust (1.77.0 + proconio) |
結果 |
AC
|
実行時間 | 77 ms / 2,000 ms |
コード長 | 5,042 bytes |
コンパイル時間 | 14,732 ms |
コンパイル使用メモリ | 378,792 KB |
実行使用メモリ | 11,520 KB |
最終ジャッジ日時 | 2024-05-08 02:05:22 |
合計ジャッジ時間 | 18,958 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,248 KB |
testcase_02 | AC | 1 ms
5,376 KB |
testcase_03 | AC | 1 ms
5,376 KB |
testcase_04 | AC | 1 ms
5,376 KB |
testcase_05 | AC | 1 ms
5,376 KB |
testcase_06 | AC | 1 ms
5,376 KB |
testcase_07 | AC | 1 ms
5,376 KB |
testcase_08 | AC | 1 ms
5,376 KB |
testcase_09 | AC | 1 ms
5,376 KB |
testcase_10 | AC | 1 ms
5,376 KB |
testcase_11 | AC | 1 ms
5,376 KB |
testcase_12 | AC | 1 ms
5,376 KB |
testcase_13 | AC | 1 ms
5,376 KB |
testcase_14 | AC | 1 ms
5,376 KB |
testcase_15 | AC | 1 ms
5,376 KB |
testcase_16 | AC | 2 ms
5,376 KB |
testcase_17 | AC | 1 ms
5,376 KB |
testcase_18 | AC | 61 ms
8,448 KB |
testcase_19 | AC | 58 ms
8,192 KB |
testcase_20 | AC | 64 ms
8,576 KB |
testcase_21 | AC | 68 ms
8,960 KB |
testcase_22 | AC | 62 ms
8,320 KB |
testcase_23 | AC | 73 ms
9,344 KB |
testcase_24 | AC | 73 ms
9,216 KB |
testcase_25 | AC | 55 ms
7,936 KB |
testcase_26 | AC | 61 ms
8,576 KB |
testcase_27 | AC | 54 ms
7,936 KB |
testcase_28 | AC | 30 ms
7,040 KB |
testcase_29 | AC | 35 ms
8,064 KB |
testcase_30 | AC | 51 ms
7,552 KB |
testcase_31 | AC | 74 ms
8,320 KB |
testcase_32 | AC | 77 ms
8,576 KB |
testcase_33 | AC | 34 ms
7,552 KB |
testcase_34 | AC | 32 ms
7,040 KB |
testcase_35 | AC | 35 ms
7,680 KB |
testcase_36 | AC | 24 ms
10,240 KB |
testcase_37 | AC | 49 ms
11,520 KB |
testcase_38 | AC | 42 ms
10,240 KB |
testcase_39 | AC | 19 ms
6,400 KB |
testcase_40 | AC | 19 ms
6,016 KB |
testcase_41 | AC | 1 ms
5,376 KB |
testcase_42 | AC | 9 ms
5,376 KB |
testcase_43 | AC | 39 ms
8,320 KB |
コンパイルメッセージ
warning: unnecessary parentheses around assigned value --> src/main.rs:35:16 | 35 | a[i] = (a[i] - i as i32)/*.max(1)*/; | ^ ^ | = note: `#[warn(unused_parens)]` on by default help: remove these parentheses | 35 - a[i] = (a[i] - i as i32)/*.max(1)*/; 35 + a[i] = a[i] - i as i32/*.max(1)*/; |
ソースコード
#![allow(unused_imports, unused_macros)] use kyoproio::*; use std::{ collections::*, io::{self, prelude::*}, iter, mem::{replace, swap}, }; fn main() -> io::Result<()> { std::thread::Builder::new() .stack_size(64 * 1024 * 1024) .spawn(solve)? .join() .unwrap(); Ok(()) } fn solve() { let stdin = io::stdin(); let mut kin = KInput::new(stdin.lock()); let stdout = io::stdout(); let mut out = io::BufWriter::new(stdout.lock()); macro_rules! output { ($($args:expr),+) => { write!(&mut out, $($args),+).unwrap(); }; } macro_rules! outputln { ($($args:expr),+) => { output!($($args),+); outputln!(); }; () => { output!("\n"); if cfg!(debug_assertions) { out.flush().unwrap(); } } } let n: usize = kin.input(); let mut a: Vec<i32> = kin.seq(n); let mut map = BTreeMap::new(); for i in 0..n { a[i] = (a[i] - i as i32)/*.max(1)*/; map.insert(a[i], 0); } for (i, v) in map.values_mut().enumerate() { *v = i; } let mut ft = FenwickTree::new(n + 1, || 0, |&x, &y| x.max(y)); for i in 0..n { if a[i] > 0 { let x = *map.get(&a[i]).unwrap(); ft.apply(x, ft.fold(x + 1) + 1); } } let lis = ft.fold(n); outputln!("{}", n - lis); } pub struct FenwickTree<T, F, Z> { a: Vec<T>, f: F, z: Z, } impl<T, F: Fn(&T, &T) -> T, Z: Fn() -> T> FenwickTree<T, F, Z> { pub fn new(n: usize, z: Z, f: F) -> Self { Self { a: std::iter::repeat_with(&z).take(n + 1).collect(), f, z, } } pub fn apply(&mut self, mut i: usize, x: T) { i += 1; while i < self.a.len() { self.a[i] = (self.f)(&self.a[i], &x); i += i & (!i + 1); } } // [0, i) pub fn fold(&self, mut i: usize) -> T { let mut s = (self.z)(); while i > 0 { s = (self.f)(&self.a[i], &s); i -= i & (!i + 1); } s } } // ----------------------------------------------------------------------------- pub mod kyoproio { use std::io::prelude::*; pub trait Input { fn str(&mut self) -> &str; fn input<T: InputParse>(&mut self) -> T { T::input(self) } fn iter<T: InputParse>(&mut self) -> Iter<T, Self> { Iter(self, std::marker::PhantomData) } fn seq<T: InputParse, B: std::iter::FromIterator<T>>(&mut self, n: usize) -> B { self.iter().take(n).collect() } } pub struct KInput<R> { src: R, buf: String, pos: usize, } impl<R: BufRead> KInput<R> { pub fn new(src: R) -> Self { Self { src, buf: String::with_capacity(1024), pos: 0, } } } impl<R: BufRead> Input for KInput<R> { fn str(&mut self) -> &str { loop { if self.pos >= self.buf.len() { self.pos = 0; self.buf.clear(); if self.src.read_line(&mut self.buf).expect("io error") == 0 { return &self.buf; } } let range = self.pos ..self.buf[self.pos..] .find(|c: char| c.is_ascii_whitespace()) .map(|i| i + self.pos) .unwrap_or_else(|| self.buf.len()); self.pos = range.end + 1; if range.end > range.start { return &self.buf[range]; } } } } pub struct Iter<'a, T, I: ?Sized>(&'a mut I, std::marker::PhantomData<*const T>); impl<'a, T: InputParse, I: Input + ?Sized> Iterator for Iter<'a, T, I> { type Item = T; fn next(&mut self) -> Option<T> { Some(self.0.input()) } } pub trait InputParse: Sized { fn input<I: Input + ?Sized>(src: &mut I) -> Self; } impl InputParse for Vec<u8> { fn input<I: Input + ?Sized>(src: &mut I) -> Self { src.str().as_bytes().to_owned() } } macro_rules! from_str_impl { { $($T:ty)* } => { $(impl InputParse for $T { fn input<I: Input + ?Sized>(src: &mut I) -> Self { src.str().parse::<$T>().expect("parse error") } })* } } from_str_impl! { String char bool f32 f64 isize i8 i16 i32 i64 i128 usize u8 u16 u32 u64 u128 } macro_rules! tuple_impl { ($H:ident $($T:ident)*) => { impl<$H: InputParse, $($T: InputParse),*> InputParse for ($H, $($T),*) { fn input<I: Input + ?Sized>(src: &mut I) -> Self { ($H::input(src), $($T::input(src)),*) } } tuple_impl!($($T)*); }; () => {} } tuple_impl!(A B C D E F G); }