結果

問題 No.702 中央値を求めよ LIMITED
コンテスト
ユーザー cympfh
提出日時 2022-05-15 19:13:01
言語 Rust
(1.83.0 + proconio)
結果
MLE  
実行時間 -
コード長 5,483 bytes
コンパイル時間 12,077 ms
コンパイル使用メモリ 403,380 KB
実行使用メモリ 83,804 KB
最終ジャッジ日時 2024-09-13 04:22:18
合計ジャッジ時間 47,891 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample MLE * 2
other MLE * 25
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: constant `size` should have an upper case name
  --> src/main.rs:31:11
   |
31 |     const size: usize = 1000_0001;
   |           ^^^^ help: convert the identifier to upper case: `SIZE`
   |
   = note: `#[warn(non_upper_case_globals)]` on by default

ソースコード

diff # 

#![allow(unused_imports, unused_macros, dead_code)]
use std::{cmp::*, collections::*};

#[derive(Debug)]
struct Array {
    x: u32,
    y: u32,
    z: u32,
    w: u32,
}
impl Array {
    fn new(x: u32) -> Self {
        let y = 1;
        let z = 2;
        let w = 3;
        Array { x, y, z, w }
    }
    fn next(&mut self) -> u32 {
        let t = self.x ^ (self.x << 11);
        self.x = self.y;
        self.y = self.z;
        self.z = self.w;
        self.w = (self.w ^ (self.w >> 19)) ^ (t ^ (t >> 8));
        self.w
    }
}

fn main() {
    let mut sc = Scanner::new();
    let seed: u32 = sc.cin();
    const size: usize = 1000_0001;
    let mut arr = Array::new(seed);
    let mut heap = MedianHeap::new();
    for _ in 0..size {
        heap.push(arr.next());
    }
    if let Median::Just(ans) = heap.peek() {
        put!(ans);
    }
}

// @sequence/median_heap
/// Sequence - Median Heap
#[derive(Debug)]
pub struct MedianHeap<T>
where
    T: Ord + Copy,
{
    head: std::collections::BinaryHeap<T>,
    tail: std::collections::BinaryHeap<std::cmp::Reverse<T>>,
}
#[derive(Debug, PartialEq, Eq)]
pub enum Median<T> {
    None,
    Just(T),
    Between(T, T),
}
impl<T: Ord + Copy> MedianHeap<T> {
    pub fn new() -> MedianHeap<T> {
        MedianHeap {
            head: std::collections::BinaryHeap::new(),
            tail: std::collections::BinaryHeap::new(),
        }
    }
    pub fn len(&self) -> usize {
        (self.head.len() + self.tail.len()) / 2
    }
    pub fn push(&mut self, x: T) {
        match (self.head.peek(), self.tail.peek()) {
            (None, None) => {
                self.head.push(x);
                self.tail.push(std::cmp::Reverse(x));
            }
            (Some(&a), Some(&std::cmp::Reverse(b))) => {
                if a <= x && x <= b {
                    self.head.push(x);
                    self.tail.push(std::cmp::Reverse(x));
                } else if x < a {
                    self.head.push(x);
                    self.head.push(x);
                    let _ = self.head.pop();
                    self.tail.push(std::cmp::Reverse(a));
                } else {
                    self.tail.push(std::cmp::Reverse(x));
                    self.tail.push(std::cmp::Reverse(x));
                    let _ = self.tail.pop();
                    self.head.push(b);
                }
            }
            _ => {}
        }
    }
    pub fn peek(&self) -> Median<T> {
        let n = self.len();
        if n == 0 {
            Median::None
        } else if n % 2 == 1 {
            Median::Just(*self.head.peek().unwrap())
        } else {
            let a = self.head.peek().unwrap();
            let b = self.tail.peek().unwrap().0;
            Median::Between(*a, b)
        }
    }
    pub fn pop(&mut self) -> Median<T> {
        let n = self.len();
        if n == 0 {
            Median::None
        } else if n % 2 == 1 {
            let a = self.head.pop().unwrap();
            let _ = self.tail.pop();
            Median::Just(a)
        } else {
            let a = self.head.pop().unwrap();
            let b = self.tail.pop().unwrap().0;
            Median::Between(a, b)
        }
    }
}

// {{{
use std::io::{self, Write};
use std::str::FromStr;

pub struct Scanner {
    stdin: io::Stdin,
    buffer: VecDeque<String>,
}
impl Scanner {
    pub fn new() -> Self {
        Self {
            stdin: io::stdin(),
            buffer: VecDeque::new(),
        }
    }
    pub fn cin<T: FromStr>(&mut self) -> T {
        while self.buffer.is_empty() {
            let mut line = String::new();
            let _ = self.stdin.read_line(&mut line);
            for w in line.split_whitespace() {
                self.buffer.push_back(String::from(w));
            }
        }
        self.buffer.pop_front().unwrap().parse::<T>().ok().unwrap()
    }
    pub fn usize1(&mut self) -> usize {
        self.cin::<usize>() - 1
    }
    pub fn chars(&mut self) -> Vec<char> {
        self.cin::<String>().chars().collect()
    }
    pub fn vec<T: FromStr>(&mut self, n: usize) -> Vec<T> {
        (0..n).map(|_| self.cin()).collect()
    }
}
fn flush() {
    std::io::stdout().flush().unwrap();
}
#[macro_export]
macro_rules! min {
    (.. $x:expr) => {{
        let mut it = $x.iter();
        it.next().map(|z| it.fold(z, |x, y| min!(x, y)))
    }};
    ($x:expr) => ($x);
    ($x:expr, $($ys:expr),*) => {{
        let t = min!($($ys),*);
        if $x < t { $x } else { t }
    }}
}
#[macro_export]
macro_rules! max {
    (.. $x:expr) => {{
        let mut it = $x.iter();
        it.next().map(|z| it.fold(z, |x, y| max!(x, y)))
    }};
    ($x:expr) => ($x);
    ($x:expr, $($ys:expr),*) => {{
        let t = max!($($ys),*);
        if $x > t { $x } else { t }
    }}
}
#[macro_export]
macro_rules! trace {
    ($x:expr) => {
        #[cfg(debug_assertions)]
        eprintln!(">>> {} = {:?}", stringify!($x), $x)
    };
    ($($xs:expr),*) => { trace!(($($xs),*)) }
}
#[macro_export]
macro_rules! put {
    (.. $x:expr) => {{
        let mut it = $x.iter();
        if let Some(x) = it.next() { print!("{}", x); }
        for x in it { print!(" {}", x); }
        println!("");
    }};
    ($x:expr) => { println!("{}", $x) };
    ($x:expr, $($xs:expr),*) => { print!("{} ", $x); put!($($xs),*) }
}
#[macro_export]
macro_rules! ndarray {
    ($x:expr;) => {
        $x
    };
    ($x:expr; $size:expr $( , $rest:expr )*) => {
        vec![ndarray!($x; $($rest),*); $size]
    };
}

// }}}
0