#459689 (Rust) No.702 中央値を求めよ LIMITED

• 問題: No.702 中央値を求めよ LIMITED
• ユーザー: cotton_fn_
• 提出日時: 2020-04-06 20:38:51
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 141 ms / 5,000 ms
• コード長: 4,846 bytes
• コンパイル時間: 15,369 ms
• コンパイル使用メモリ: 377,948 KB
• 実行使用メモリ: 5,632 KB
• 最終ジャッジ日時: 2024-11-22 22:50:09
• 合計ジャッジ時間: 19,030 ms
• ジャッジサーバーID （参考情報）: judge1 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	139 ms; 5,376 KB
testcase_01	AC	141 ms; 5,504 KB
testcase_02	AC	139 ms; 5,504 KB
testcase_03	AC	140 ms; 5,504 KB
testcase_04	AC	140 ms; 5,504 KB
testcase_05	AC	139 ms; 5,504 KB
testcase_06	AC	140 ms; 5,632 KB
testcase_07	AC	141 ms; 5,504 KB
testcase_08	AC	139 ms; 5,504 KB
testcase_09	AC	139 ms; 5,504 KB
testcase_10	AC	139 ms; 5,632 KB
testcase_11	AC	139 ms; 5,504 KB
testcase_12	AC	140 ms; 5,504 KB
testcase_13	AC	140 ms; 5,504 KB
testcase_14	AC	139 ms; 5,376 KB
testcase_15	AC	140 ms; 5,504 KB
testcase_16	AC	140 ms; 5,504 KB
testcase_17	AC	139 ms; 5,504 KB
testcase_18	AC	139 ms; 5,504 KB
testcase_19	AC	141 ms; 5,504 KB
testcase_20	AC	140 ms; 5,504 KB
testcase_21	AC	139 ms; 5,504 KB
testcase_22	AC	140 ms; 5,504 KB
testcase_23	AC	139 ms; 5,632 KB
testcase_24	AC	139 ms; 5,504 KB
testcase_25	AC	140 ms; 5,504 KB
testcase_26	AC	139 ms; 5,504 KB

ソースコード

#![allow(unused)]

use kyoproio::*;
use std::{
    collections::*,
    io::{self, prelude::*},
    iter,
    mem::{replace, swap},
};

fn main() -> io::Result<()> {
    /*
    std::thread::Builder::new()
        .stack_size(50 * 1024 * 1024)
        .spawn(solve)?
        .join()
        .unwrap();
    Ok(())
    */
    solve();
    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),+) };
    }
    macro_rules! outputln {
        ($($args:expr),+) => { output!($($args),+); outputln!(); };
        () => { output!("\n"); if cfg!(debug_assertions) { out.flush(); } }
    }

    let s: u32 = kin.input();
    let (mut x, mut y, mut z, mut w) = (s, 1, 2, 3);
    let mut a = Vec::new();
    let mut c = 0;
    let mut d = 0;
    const N: usize = 10000001;
    const S: u32 = 1 << 27;
    const L: u32 = (1 << 31) - S;
    const R: u32 = (1 << 31) + S;
    for _ in 0..N {
        let t = x ^ x << 11;
        x = y;
        y = z;
        z = w;
        w = (w ^ w >> 19) ^ (t ^ t >> 8);
        if w < L {
            c += 1;
        } else if w < R {
            a.push(w);
        } else {
            d += 1;
        }
    }
    a.sort();
    dbg!(a.first());
    dbg!(a.last());
    dbg!(L, R, c, d, N - c - d);
    outputln!("{}", a[N / 2 - c]);
}


// -----------------------------------------------------------------------------
pub mod kyoproio {
    #![warn(unused)]
    use std::io::prelude::*;
    pub trait Input: Sized {
        fn str(&mut self) -> &str;
        fn bytes(&mut self) -> &[u8] {
            self.str().as_ref()
        }
        fn input<T: InputParse>(&mut self) -> T {
            self.input_fallible().expect("input error")
        }
        fn input_fallible<T: InputParse>(&mut self) -> Result<T, T::Err> {
            T::input(self)
        }
        fn iter<T: InputParse>(&mut self) -> Iter<T, Self> {
            Iter {
                input: self,
                _t: 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> {
        input: &'a mut I,
        _t: std::marker::PhantomData<*const T>,
    }
    impl<'a, T: InputParse, I: Input> Iterator for Iter<'a, T, I> {
        type Item = T;
        fn next(&mut self) -> Option<Self::Item> {
            Some(self.input.input())
        }
    }
    pub trait InputParse: Sized {
        type Err: std::fmt::Debug;
        fn input<I: Input>(input: &mut I) -> Result<Self, Self::Err>;
    }
    macro_rules! from_str_impls {
        { $($T:ty)* } => {
            $(impl InputParse for $T {
                type Err = <$T as std::str::FromStr>::Err;
                fn input<I: Input>(input: &mut I) -> Result<Self, Self::Err> {
                    input.str().parse::<$T>()
                }
            })*
        };
    }
    from_str_impls! {
        String char bool f32 f64 isize i8 i16 i32 i64 i128 usize u8 u16 u32 u64 u128
    }
    macro_rules! tuple_impls {
        ($H:ident $($T:ident)*) => {
            impl<$H: InputParse, $($T: InputParse),*> InputParse for ($H, $($T),*) {
                type Err = ();
                fn input<I: Input>(input: &mut I) -> Result<Self, Self::Err> {
                    // ?
                    Ok(($H::input(input).unwrap(), $($T::input(input).unwrap()),*))
                }
            }
            tuple_impls!($($T)*);
        };
        () => {};
    }
    tuple_impls!(A B C D E F G);
}