結果
問題 | No.2338 Range AtCoder Query |
ユーザー |
![]() |
提出日時 | 2023-06-02 22:08:25 |
言語 | Rust (1.83.0 + proconio) |
結果 |
AC
|
実行時間 | 174 ms / 4,000 ms |
コード長 | 6,244 bytes |
コンパイル時間 | 12,099 ms |
コンパイル使用メモリ | 404,488 KB |
実行使用メモリ | 43,520 KB |
最終ジャッジ日時 | 2024-12-28 18:18:17 |
合計ジャッジ時間 | 19,251 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 34 |
コンパイルメッセージ
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>; | ^^^^^
ソースコード
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,m: usize,q: usize,a: [(usize1, bytes); n],ask: [(usize1, usize); q],}let mut last = vec![(n, 0); m];let mut seg = SegmentTreePURQ::new(n + 1, (0, 0), |a, b| (a.0 + b.0, a.1 + b.1));let mut query = vec![vec![]; n];for (i, &(l, r)) in ask.iter().enumerate() {query[l].push((r, i));}let mut ans = vec![(0, 0); q];for (l, a) in a.iter().enumerate().rev() {let (pos, pena) = last[a.0];let v = seg.find(pos, pos + 1);if a.1[0] == b'A' {seg.update(pos, (v.0 - 1, v.1 - pena));seg.update(l, (1, 0));last[a.0] = (l, 0);} else {last[a.0].1 += 1;seg.update(pos, (v.0, v.1 + 1));}for &(r, k) in query[l].iter() {ans[k] = seg.find(l, r);}}let out = std::io::stdout();let mut out = std::io::BufWriter::new(out.lock());for p in ans {writeln!(out, "{} {}", p.0, p.1).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 ----------// ---------- 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>whereT: 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) -> usizewhereP: 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) -> usizewhereP: 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 ----------