結果
問題 |
No.3258 Xor Division Game
|
ユーザー |
![]() |
提出日時 | 2025-09-05 21:43:44 |
言語 | Rust (1.83.0 + proconio) |
結果 |
AC
|
実行時間 | 194 ms / 2,000 ms |
コード長 | 6,222 bytes |
コンパイル時間 | 14,401 ms |
コンパイル使用メモリ | 396,248 KB |
実行使用メモリ | 31,716 KB |
最終ジャッジ日時 | 2025-09-05 21:44:11 |
合計ジャッジ時間 | 26,464 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 67 |
コンパイルメッセージ
warning: type alias `Set` is never used --> src/main.rs:2:6 | 2 | type Set<T> = std::collections::BTreeSet<T>; | ^^^ | = note: `#[warn(dead_code)]` on by default warning: type alias `Map` is never used --> src/main.rs:3:6 | 3 | type Map<K, T> = std::collections::BTreeMap<K, T>; | ^^^
ソースコード
type Set<T> = std::collections::BTreeSet<T>; type Map<K, T> = std::collections::BTreeMap<K, T>; fn main() { input! { n: usize, f: [u32; n], } let mut map = std::collections::BTreeMap::new(); for (i, f) in f.iter().enumerate() { map.entry(*f).or_insert(vec![]).push(i); } let mut cnt = vec![0; n]; let mut dfs = vec![]; let mut seg = SegmentTreePURQ::new(n, (0, 0), |a, b| std::cmp::max(*a, *b)); for (_, x) in map.iter() { if x.len() == 1 { dfs.push(x[0]); } for x in x.windows(2) { cnt[x[0]] += 1; cnt[x[1]] += 1; seg.update(x[0], (x[1], x[0])); } } let mut valid = 0; while let Some(x) = dfs.pop() { valid += 1; loop { let (r, l) = seg.find(0, x); if r == 0 || r <= x { break; } seg.update(l, (0, 0)); for &y in [l, r].iter() { cnt[y] -= 1; if cnt[y] == 0 { dfs.push(y); } } } } let ans = if valid % 2 == 0 {"Bob"} else {"Alice"}; println!("{}", ans); } // ---------- 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 ---------- // ---------- begin segment tree Point Update Range Query ---------- pub struct SegmentTreePURQ<T, F> { n: usize, size: usize, data: Vec<T>, e: T, op: F, } impl<T, F> SegmentTreePURQ<T, F> where T: Clone, F: Fn(&T, &T) -> T, { pub fn new(n: usize, e: T, op: F) -> Self { assert!(n > 0); let size = n.next_power_of_two(); let data = vec![e.clone(); 2 * size]; SegmentTreePURQ { n, size, data, e, op, } } pub fn update_tmp(&mut self, x: usize, v: T) { assert!(x < self.n); self.data[x + self.size] = v; } pub fn update_all(&mut self) { for i in (1..self.size).rev() { self.data[i] = (self.op)(&self.data[2 * i], &self.data[2 * i + 1]); } } pub fn update(&mut self, x: usize, v: T) { assert!(x < self.n); let mut x = x + self.size; self.data[x] = v; x >>= 1; while x > 0 { self.data[x] = (self.op)(&self.data[2 * x], &self.data[2 * x + 1]); x >>= 1; } } pub fn find(&self, l: usize, r: usize) -> T { assert!(l <= r && r <= self.n); if l == r { return self.e.clone(); } let mut l = self.size + l; let mut r = self.size + r; let mut x = self.e.clone(); let mut y = self.e.clone(); while l < r { if l & 1 == 1 { x = (self.op)(&x, &self.data[l]); l += 1; } if r & 1 == 1 { r -= 1; y = (self.op)(&self.data[r], &y); } l >>= 1; r >>= 1; } (self.op)(&x, &y) } pub fn max_right<P>(&self, l: usize, f: P) -> usize where P: Fn(&T) -> bool, { assert!(l <= self.n); assert!(f(&self.e)); if l == self.n { return self.n; } let mut l = l + self.size; let mut sum = self.e.clone(); while { l >>= l.trailing_zeros(); let v = (self.op)(&sum, &self.data[l]); if !f(&v) { while l < self.size { l <<= 1; let v = (self.op)(&sum, &self.data[l]); if f(&v) { sum = v; l += 1; } } return l - self.size; } sum = v; l += 1; l.count_ones() > 1 } {} self.n } pub fn min_left<P>(&self, r: usize, f: P) -> usize where P: Fn(&T) -> bool, { assert!(r <= self.n); assert!(f(&self.e)); if r == 0 { return 0; } let mut r = r + self.size; let mut sum = self.e.clone(); while { r -= 1; while r > 1 && r & 1 == 1 { r >>= 1; } let v = (self.op)(&self.data[r], &sum); if !f(&v) { while r < self.size { r = 2 * r + 1; let v = (self.op)(&self.data[r], &sum); if f(&v) { sum = v; r -= 1; } } return r + 1 - self.size; } sum = v; (r & (!r + 1)) != r } {} 0 } } // ---------- end segment tree Point Update Range Query ----------