結果
問題 | No.670 log は定数 |
ユーザー |
|
提出日時 | 2020-10-15 23:51:32 |
言語 | Rust (1.83.0 + proconio) |
結果 |
AC
|
実行時間 | 1,980 ms / 4,000 ms |
コード長 | 4,321 bytes |
コンパイル時間 | 14,275 ms |
コンパイル使用メモリ | 378,740 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-07-20 20:08:54 |
合計ジャッジ時間 | 36,688 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 10 |
ソースコード
#[allow(unused_imports)]use std::cmp::*;#[allow(unused_imports)]use std::collections::*;use std::io::{Write, BufWriter};// https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8macro_rules! input {($($r:tt)*) => {let stdin = std::io::stdin();let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));let mut next = move || -> String{bytes.by_ref().map(|r|r.unwrap() as char).skip_while(|c|c.is_whitespace()).take_while(|c|!c.is_whitespace()).collect()};input_inner!{next, $($r)*}};}macro_rules! input_inner {($next:expr) => {};($next:expr, ) => {};($next:expr, $var:ident : $t:tt $($r:tt)*) => {let $var = read_value!($next, $t);input_inner!{$next $($r)*}};}macro_rules! read_value {($next:expr, [graph1; $len:expr]) => {{let mut g = vec![vec![]; $len];let ab = read_value!($next, [(usize1, usize1)]);for (a, b) in ab {g[a].push(b);g[b].push(a);}g}};($next:expr, ( $($t:tt),* )) => {( $(read_value!($next, $t)),* )};($next:expr, [ $t:tt ; $len:expr ]) => {(0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()};($next:expr, chars) => {read_value!($next, String).chars().collect::<Vec<char>>()};($next:expr, usize1) => (read_value!($next, usize) - 1);($next:expr, [ $t:tt ]) => {{let len = read_value!($next, usize);read_value!($next, [$t; len])}};($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error"));}#[allow(unused)]macro_rules! debug {($($format:tt)*) => (write!(std::io::stderr(), $($format)*).unwrap());}#[allow(unused)]macro_rules! debugln {($($format:tt)*) => (writeln!(std::io::stderr(), $($format)*).unwrap());}trait Bisect<T> {fn lower_bound(&self, val: &T) -> usize;fn upper_bound(&self, val: &T) -> usize;}impl<T: Ord> Bisect<T> for [T] {fn lower_bound(&self, val: &T) -> usize {let mut pass = self.len() + 1;let mut fail = 0;while pass - fail > 1 {let mid = (pass + fail) / 2;if &self[mid - 1] >= val {pass = mid;} else {fail = mid;}}pass - 1}fn upper_bound(&self, val: &T) -> usize {let mut pass = self.len() + 1;let mut fail = 0;while pass - fail > 1 {let mid = (pass + fail) / 2;if &self[mid - 1] > val {pass = mid;} else {fail = mid;}}pass - 1}}fn solve() {let out = std::io::stdout();let mut out = BufWriter::new(out.lock());macro_rules! puts {($($format:tt)*) => (let _ = write!(out,$($format)*););}#[allow(unused)]macro_rules! putvec {($v:expr) => {for i in 0..$v.len() {puts!("{}{}", $v[i], if i + 1 == $v.len() {"\n"} else {" "});}}}input! {n: usize, q: usize, seed: u64,}let mut seed = seed;let mut next = move || {seed = seed ^ seed.wrapping_shl(13);seed = seed ^ (seed >> 7);seed = seed ^ seed.wrapping_shl(17);seed >> 33};let mut a = vec![0; n];for _ in 0..10000 {next();}for i in 0..n {a[i] = next();}a.sort();const W: usize = 1 << 15;const B: usize = 16;let mut precomp = vec![0; W + 1];for i in 0..W as u64 + 1 {let l = i << B;let idx = a.lower_bound(&l);precomp[i as usize] = idx;}let mut tot: i64 = 0;for i in 0..q {let x = next();let hi = (x >> B) as usize;let l = precomp[hi];let r = precomp[hi + 1];let idx = a[l..r].lower_bound(&x) + l;tot ^= idx as i64 * i as i64;}puts!("{}\n", tot);}fn main() {// In order to avoid potential stack overflow, spawn a new thread.let stack_size = 104_857_600; // 100 MBlet thd = std::thread::Builder::new().stack_size(stack_size);thd.spawn(|| solve()).unwrap().join().unwrap();}