結果
問題 | No.1705 Mode of long array |
ユーザー |
|
提出日時 | 2021-10-08 23:33:24 |
言語 | Rust (1.83.0 + proconio) |
結果 |
AC
|
実行時間 | 66 ms / 3,000 ms |
コード長 | 3,691 bytes |
コンパイル時間 | 23,854 ms |
コンパイル使用メモリ | 398,532 KB |
実行使用メモリ | 8,320 KB |
最終ジャッジ日時 | 2024-07-23 07:45:54 |
合計ジャッジ時間 | 19,156 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 51 |
コンパイルメッセージ
warning: unused variable: `n`
--> src/main.rs:98:9
|
98 | n: i64, m: usize,
| ^
|
help: `n` is captured in macro and introduced a unused variable
--> src/main.rs:25:13
|
25 | let next, $t);
| ^^^^
...
97 | / input! {
98 | | n: i64, m: usize,
99 | | a: [i64; m],
100 | | q: usize,
101 | | txy: [(i32, usize, i64); q],
102 | | }
| |_____- in this macro invocation
= note: `#[warn(unused_variables)]` on by default
= note: this warning originates in the macro `input_inner` which comes from the expansion of the macro `input` (in Nightly builds, run with -Z macro-backtrace for more info)
ソースコード
#[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, ( $($t:tt),* )) => { ($(read_value!($next, $t)),*) };($next:expr, [ $t:tt ; $len:expr ]) => {(0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()};($next:expr, usize1) => (read_value!($next, usize) - 1);($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error"));}/*** Segment Tree. This data structure is useful for fast folding on intervals of an array* whose elements are elements of monoid I. Note that constructing this tree requires the identity* element of I and the operation of I.* Verified by: yukicoder No. 259 (http://yukicoder.me/submissions/100581)* AGC015-E (http://agc015.contest.atcoder.jp/submissions/1461001)* yukicoder No. 833 (https://yukicoder.me/submissions/703521)*/struct SegTree<I, BiOp> {n: usize,dat: Vec<I>,op: BiOp,e: I,}impl<I, BiOp> SegTree<I, BiOp>where BiOp: Fn(I, I) -> I,I: Copy {pub fn new(n_: usize, op: BiOp, e: I) -> Self {let mut n = 1;while n < n_ { n *= 2; } // n is a power of 2SegTree {n: n, dat: vec![e; 2 * n - 1], op: op, e: e}}/* ary[k] <- v */pub fn update(&mut self, idx: usize, v: I) {let mut k = idx + self.n - 1;self.dat[k] = v;while k > 0 {k = (k - 1) / 2;self.dat[k] = (self.op)(self.dat[2 * k + 1], self.dat[2 * k + 2]);}}/* [a, b) (note: half-inclusive)* http://proc-cpuinfo.fixstars.com/2017/07/optimize-segment-tree/ */#[allow(unused)]pub fn query(&self, mut a: usize, mut b: usize) -> I {let mut left = self.e;let mut right = self.e;a += self.n - 1;b += self.n - 1;while a < b {if (a & 1) == 0 {left = (self.op)(left, self.dat[a]);}if (b & 1) == 0 {right = (self.op)(self.dat[b - 1], right);}a = a / 2;b = (b - 1) / 2;}(self.op)(left, right)}}fn main() {let out = std::io::stdout();let mut out = BufWriter::new(out.lock());macro_rules! puts {($($format:tt)*) => (let _ = write!(out,$($format)*););}input! {n: i64, m: usize,a: [i64; m],q: usize,txy: [(i32, usize, i64); q],}let mut st = SegTree::new(m, max, (0, 0));for i in 0..m {st.update(i, (a[i], i + 1));}for (t, x, y) in txy {if t == 3 {puts!("{}\n", st.query(0, m).1);} else {let x = x - 1;let (v, old) = st.query(x, x + 1);let new = if t == 1 {v + y} else {v - y};st.update(x, (new, old));}}}