結果
問題 | No.2592 おでぶなおばけさん 2 |
ユーザー |
![]() |
提出日時 | 2023-12-20 00:16:53 |
言語 | Rust (1.83.0 + proconio) |
結果 |
AC
|
実行時間 | 256 ms / 2,500 ms |
コード長 | 2,997 bytes |
コンパイル時間 | 13,422 ms |
コンパイル使用メモリ | 402,828 KB |
実行使用メモリ | 10,648 KB |
最終ジャッジ日時 | 2024-09-27 09:32:09 |
合計ジャッジ時間 | 33,851 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 83 |
コンパイルメッセージ
warning: type alias `Map` is never used --> src/main.rs:4:6 | 4 | type Map<K, V> = BTreeMap<K, V>; | ^^^ | = note: `#[warn(dead_code)]` on by default warning: type alias `Set` is never used --> src/main.rs:5:6 | 5 | type Set<T> = BTreeSet<T>; | ^^^ warning: type alias `Deque` is never used --> src/main.rs:6:6 | 6 | type Deque<T> = VecDeque<T>; | ^^^^^ warning: function `shuffle` is never used --> src/main.rs:116:4 | 116 | fn shuffle<T>(a: &mut [T]) { | ^^^^^^^
ソースコード
use std::io::Write; use std::collections::*; type Map<K, V> = BTreeMap<K, V>; type Set<T> = BTreeSet<T>; type Deque<T> = VecDeque<T>; fn run() { input! { n: usize, q: usize, k: i64, a: [i64; n], ask: [(usize1, usize); q], } let mut ans = vec!["No"; q]; for _ in 0..30 { let m = (rand() % 1000000000 + 1) as i64; let r = k % m; let mut pow = vec![1; n + 1]; for i in 1..(n + 1) { pow[i] = pow[i - 1] * (k % m) % m; } let mut sum = vec![0; n + 1]; for (i, a) in a.iter().enumerate().rev() { let a = (*a % m + m) % m; sum[i] = (sum[i + 1] * r + a) % m; } for (ans, &(l, r)) in ans.iter_mut().zip(ask.iter()) { let val = (sum[l] - sum[r] * pow[r - l] + m * m) % m; if val != 0 { *ans = "Yes"; } } } let out = std::io::stdout(); let mut out = std::io::BufWriter::new(out.lock()); for a in ans { writeln!(out, "{}", a).ok(); } } fn main() { run(); } // ---------- begin input macro ---------- // reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8 #[macro_export] macro_rules! input { (source = $s:expr, $($r:tt)*) => { let mut iter = $s.split_whitespace(); input_inner!{iter, $($r)*} }; ($($r:tt)*) => { let s = { use std::io::Read; let mut s = String::new(); std::io::stdin().read_to_string(&mut s).unwrap(); s }; let mut iter = s.split_whitespace(); input_inner!{iter, $($r)*} }; } #[macro_export] macro_rules! input_inner { ($iter:expr) => {}; ($iter:expr, ) => {}; ($iter:expr, $var:ident : $t:tt $($r:tt)*) => { let $var = read_value!($iter, $t); input_inner!{$iter $($r)*} }; } #[macro_export] macro_rules! read_value { ($iter:expr, ( $($t:tt),* )) => { ( $(read_value!($iter, $t)),* ) }; ($iter:expr, [ $t:tt ; $len:expr ]) => { (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>() }; ($iter:expr, chars) => { read_value!($iter, String).chars().collect::<Vec<char>>() }; ($iter:expr, bytes) => { read_value!($iter, String).bytes().collect::<Vec<u8>>() }; ($iter:expr, usize1) => { read_value!($iter, usize) - 1 }; ($iter:expr, $t:ty) => { $iter.next().unwrap().parse::<$t>().expect("Parse error") }; } // ---------- end input macro ---------- fn rand_memory() -> usize { Box::into_raw(Box::new("I hope this is a random number")) as usize } fn rand() -> usize { static mut X: usize = 0; unsafe { if X == 0 { X = rand_memory(); } X ^= X << 13; X ^= X >> 17; X ^= X << 5; X } } fn shuffle<T>(a: &mut [T]) { for i in 1..a.len() { let p = rand() % (i + 1); a.swap(i, p); } }