#246656 (Rust) No.670 log は定数

• 問題: No.670 log は定数
• ユーザー: hatoo
• 提出日時: 2018-03-24 00:31:13
• 言語: Rust (1.77.0)
• 結果: CE (最新)
  AC
  (最初)
• 実行時間: -
• コード長: 6,131 bytes
• コンパイル時間: 10,264 ms
• コンパイル使用メモリ: 390,320 KB
• 最終ジャッジ日時: 2024-04-27 02:32:46
• 合計ジャッジ時間: 10,873 ms
• ジャッジサーバーID （参考情報）: judge3 / judge5

コンパイルメッセージ

error: expected one of `:`, `@`, or `|`, found `)`
  --> src/main.rs:84:28
   |
84 |     fn lower_bound(&self, T) -> usize;
   |                            ^ expected one of `:`, `@`, or `|`
   |
   = note: anonymous parameters are removed in the 2018 edition (see RFC 1685)
help: if this is a parameter name, give it a type
   |
84 |     fn lower_bound(&self, T: TypeName) -> usize;
   |                            ++++++++++
help: if this is a type, explicitly ignore the parameter name
   |
84 |     fn lower_bound(&self, _: T) -> usize;
   |                           ++

error: expected one of `:`, `@`, or `|`, found `)`
  --> src/main.rs:85:29
   |
85 |     fn upper_bound(&self, &T) -> usize;
   |                             ^ expected one of `:`, `@`, or `|`
   |
   = note: anonymous parameters are removed in the 2018 edition (see RFC 1685)
help: if this is a parameter name, give it a type
   |
85 |     fn upper_bound(&self, T: &TypeName) -> usize;
   |                           ~~~~~~~~~~~~
help: if this is a type, explicitly ignore the parameter name
   |
85 |     fn upper_bound(&self, _: &T) -> usize;
   |                           ++

error: could not compile `main` (bin "main") due to 2 previous errors

ソースコード

/**
*  _           _                 __                            _   _ _   _                                 _                    _                  _
* | |         | |               / /                           | | (_) | (_)                               | |                  (_)                | |
* | |__   __ _| |_ ___   ___   / /__ ___  _ __ ___  _ __   ___| |_ _| |_ ___   _____ ______ _ __ _   _ ___| |_ ______ ___ _ __  _ _ __  _ __   ___| |_ ___
* | '_ \ / _` | __/ _ \ / _ \ / / __/ _ \| '_ ` _ \| '_ \ / _ \ __| | __| \ \ / / _ \______| '__| | | / __| __|______/ __| '_ \| | '_ \| '_ \ / _ \ __/ __|
* | | | | (_| | || (_) | (_) / / (_| (_) | | | | | | |_) |  __/ |_| | |_| |\ V /  __/      | |  | |_| \__ \ |_       \__ \ | | | | |_) | |_) |  __/ |_\__ \
* |_| |_|\__,_|\__\___/ \___/_/ \___\___/|_| |_| |_| .__/ \___|\__|_|\__|_| \_/ \___|      |_|   \__,_|___/\__|      |___/_| |_|_| .__/| .__/ \___|\__|___/
*                                                  | |                                                                           | |   | |
*                                                  |_|                                                                           |_|   |_|
*
* https://github.com/hatoo/competitive-rust-snippets
*/
#[allow(unused_imports)]
use std::cmp::{max, min, Ordering};
#[allow(unused_imports)]
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};
#[allow(unused_imports)]
use std::iter::FromIterator;
#[allow(unused_imports)]
use std::io::{stdin, stdout, BufWriter, Write};
mod util {
    use std::io::{stdin, stdout, BufWriter, StdoutLock};
    use std::str::FromStr;
    use std::fmt::Debug;
    #[allow(dead_code)]
    pub fn line() -> String {
        let mut line: String = String::new();
        stdin().read_line(&mut line).unwrap();
        line.trim().to_string()
    }
    #[allow(dead_code)]
    pub fn chars() -> Vec<char> {
        line().chars().collect()
    }
    #[allow(dead_code)]
    pub fn gets<T: FromStr>() -> Vec<T>
    where
        <T as FromStr>::Err: Debug,
    {
        let mut line: String = String::new();
        stdin().read_line(&mut line).unwrap();
        line.split_whitespace()
            .map(|t| t.parse().unwrap())
            .collect()
    }
    #[allow(dead_code)]
    pub fn with_bufwriter<F: FnOnce(BufWriter<StdoutLock>) -> ()>(f: F) {
        let out = stdout();
        let writer = BufWriter::new(out.lock());
        f(writer)
    }
}
#[allow(unused_macros)]
macro_rules ! get { ( $ t : ty ) => { { let mut line : String = String :: new ( ) ; stdin ( ) . read_line ( & mut line ) . unwrap ( ) ; line . trim ( ) . parse ::<$ t > ( ) . unwrap ( ) } } ; ( $ ( $ t : ty ) ,* ) => { { let mut line : String = String :: new ( ) ; stdin ( ) . read_line ( & mut line ) . unwrap ( ) ; let mut iter = line . split_whitespace ( ) ; ( $ ( iter . next ( ) . unwrap ( ) . parse ::<$ t > ( ) . unwrap ( ) , ) * ) } } ; ( $ t : ty ; $ n : expr ) => { ( 0 ..$ n ) . map ( | _ | get ! ( $ t ) ) . collect ::< Vec < _ >> ( ) } ; ( $ ( $ t : ty ) ,*; $ n : expr ) => { ( 0 ..$ n ) . map ( | _ | get ! ( $ ( $ t ) ,* ) ) . collect ::< Vec < _ >> ( ) } ; ( $ t : ty ;; ) => { { let mut line : String = String :: new ( ) ; stdin ( ) . read_line ( & mut line ) . unwrap ( ) ; line . split_whitespace ( ) . map ( | t | t . parse ::<$ t > ( ) . unwrap ( ) ) . collect ::< Vec < _ >> ( ) } } ; ( $ t : ty ;; $ n : expr ) => { ( 0 ..$ n ) . map ( | _ | get ! ( $ t ;; ) ) . collect ::< Vec < _ >> ( ) } ; }
#[allow(unused_macros)]
macro_rules ! debug { ( $ ( $ a : expr ) ,* ) => { eprintln ! ( concat ! ( $ ( stringify ! ( $ a ) , " = {:?}, " ) ,* ) , $ ( $ a ) ,* ) ; } }
const BIG_STACK_SIZE: bool = false;
#[allow(dead_code)]
fn main() {
    use std::thread;
    if BIG_STACK_SIZE {
        thread::Builder::new()
            .stack_size(32 * 1024 * 1024)
            .name("solve".into())
            .spawn(solve)
            .unwrap()
            .join()
            .unwrap();
    } else {
        solve();
    }
}

#[inline(always)]
fn next(x: &mut u64) -> u64 {
    *x = *x ^ (*x << 13);
    *x = *x ^ (*x >> 7);
    *x = *x ^ (*x << 17);
    *x >> 33
}

/// Equivalent to std::lowerbound and std::upperbound in c++
pub trait BinarySearch<T> {
    fn lower_bound(&self, T) -> usize;
    fn upper_bound(&self, &T) -> usize;
}
impl<T: Ord> BinarySearch<T> for [T] {
    #[inline]
    fn lower_bound(&self, x: T) -> usize {
        let mut low = 0;
        let mut high = self.len();
        while low != high {
            let mid = (low + high) / 2;
            match unsafe { self.get_unchecked(mid) }.cmp(&x) {
                Ordering::Less => {
                    low = mid + 1;
                }
                Ordering::Equal | Ordering::Greater => {
                    high = mid;
                }
            }
        }
        low
    }
    fn upper_bound(&self, x: &T) -> usize {
        let mut low = 0;
        let mut high = self.len();
        while low != high {
            let mid = (low + high) / 2;
            match self[mid].cmp(x) {
                Ordering::Less | Ordering::Equal => {
                    low = mid + 1;
                }
                Ordering::Greater => {
                    high = mid;
                }
            }
        }
        low
    }
}

fn solve() {
    let (n, q, mut seed) = get!(usize, usize, u64);

    for _ in 0..10_000 {
        next(&mut seed);
    }

    let mut xs = Vec::with_capacity(n);

    for _ in 0..n {
        xs.push(next(&mut seed) as u32);
    }

    xs.sort();

    let mut ans = 0;

    const B: usize = 300_000;
    let mut buckets = vec![Vec::new(); u32::max_value() as usize / B];

    for &x in &xs {
        buckets[x as usize / B].push(x);
    }

    let mut csum = buckets.iter().map(|b| b.len()).collect::<Vec<_>>();

    for i in 1..csum.len() {
        csum[i] += csum[i - 1];
    }

    csum.insert(0, 0);

    for i in 0..q {
        let x = next(&mut seed) as u32;

        let k = x as usize / B;

        let l = csum[k];

        ans ^= i * (l + buckets[k].lower_bound(x));
    }

    println!("{}", ans);
}