結果
問題 | No.1099 Range Square Sum |
ユーザー |
![]() |
提出日時 | 2020-06-27 15:16:55 |
言語 | Rust (1.83.0 + proconio) |
結果 |
CE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 7,347 bytes |
コンパイル時間 | 12,353 ms |
コンパイル使用メモリ | 400,308 KB |
最終ジャッジ日時 | 2024-11-14 22:40:01 |
合計ジャッジ時間 | 14,613 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。(リジャッジ後のコンパイルエラーは公開されます)
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
error: expected one of `!`, `(`, `...`, `..=`, `..`, `::`, `:`, `{`, or `|`, found `,` --> src/main.rs:106:20 | 106 | fn fold(Self::T, Self::T) -> Self::T; | ^ expected one of 9 possible tokens | = note: anonymous parameters are removed in the 2018 edition (see RFC 1685) help: explicitly ignore the parameter name | 106 | fn fold(_: Self::T, Self::T) -> Self::T; | ~~~~~~~~~~ error: expected one of `!`, `(`, `...`, `..=`, `..`, `::`, `:`, `{`, or `|`, found `)` --> src/main.rs:106:29 | 106 | fn fold(Self::T, Self::T) -> Self::T; | ^ expected one of 9 possible tokens | = note: anonymous parameters are removed in the 2018 edition (see RFC 1685) help: explicitly ignore the parameter name | 106 | fn fold(Self::T, _: Self::T) -> Self::T; | ~~~~~~~~~~ error: expected one of `!`, `(`, `...`, `..=`, `..`, `::`, `:`, `{`, or `|`, found `,` --> src/main.rs:107:20 | 107 | fn eval(Self::T, Self::E) -> Self::T; | ^ expected one of 9 possible tokens | = note: anonymous parameters are removed in the 2018 edition (see RFC 1685) help: explicitly ignore the parameter name | 107 | fn eval(_: Self::T, Self::E) -> Self::T; | ~~~~~~~~~~ error: expected one of `!`, `(`, `...`, `..=`, `..`, `::`, `:`, `{`, or `|`, found `)` --> src/main.rs:107:29 | 107 | fn eval(Self::T, Self::E) -> Self::T; | ^ expected one of 9 possible tokens | = note: anonymous parameters are removed in the 2018 edition (see RFC 1685) help: explicitly ignore the parameter name | 107 | fn eval(Self::T, _: Self::E) -> Self::T; | ~~~~~~~~~~ error: expected one of `!`, `(`, `...`, `..=`, `..`, `::`, `:`, `{`, or `|`, found `,` --> src/main.rs:108:21 | 108 | fn merge(Self::E, Self::E) -> Self::E; |
ソースコード
#![allow(unused_imports)]#![allow(non_snake_case, unused)]use std::cmp::*;use std::collections::*;use std::ops::*;// https://atcoder.jp/contests/hokudai-hitachi2019-1/submissions/10518254macro_rules! eprint {($($t:tt)*) => {{use ::std::io::Write;let _ = write!(::std::io::stderr(), $($t)*);}};}macro_rules! eprintln {() => { eprintln!(""); };($($t:tt)*) => {{use ::std::io::Write;let _ = writeln!(::std::io::stderr(), $($t)*);}};}macro_rules! dbg {($v:expr) => {{let val = $v;eprintln!("[{}:{}] {} = {:?}", file!(), line!(), stringify!($v), val);val}}}macro_rules! mat {($($e:expr),*) => { Vec::from(vec![$($e),*]) };($($e:expr,)*) => { Vec::from(vec![$($e),*]) };($e:expr; $d:expr) => { Vec::from(vec![$e; $d]) };($e:expr; $d:expr $(; $ds:expr)+) => { Vec::from(vec![mat![$e $(; $ds)*]; $d]) };}macro_rules! ok {($a:ident$([$i:expr])*.$f:ident()$(@$t:ident)*) => {$a$([$i])*.$f($($t),*)};($a:ident$([$i:expr])*.$f:ident($e:expr$(,$es:expr)*)$(@$t:ident)*) => { {let t = $e;ok!($a$([$i])*.$f($($es),*)$(@$t)*@t)} };}pub fn readln() -> String {let mut line = String::new();::std::io::stdin().read_line(&mut line).unwrap_or_else(|e| panic!("{}", e));line}macro_rules! read {($($t:tt),*; $n:expr) => {{let stdin = ::std::io::stdin();let ret = ::std::io::BufRead::lines(stdin.lock()).take($n).map(|line| {let line = line.unwrap();let mut it = line.split_whitespace();_read!(it; $($t),*)}).collect::<Vec<_>>();ret}};($($t:tt),*) => {{let line = readln();let mut it = line.split_whitespace();_read!(it; $($t),*)}};}macro_rules! _read {($it:ident; [char]) => {_read!($it; String).chars().collect::<Vec<_>>()};($it:ident; [u8]) => {Vec::from(_read!($it; String).into_bytes())};($it:ident; usize1) => {$it.next().unwrap_or_else(|| panic!("input mismatch")).parse::<usize>().unwrap_or_else(|e| panic!("{}", e)) - 1};($it:ident; [usize1]) => {$it.map(|s| s.parse::<usize>().unwrap_or_else(|e| panic!("{}", e)) - 1).collect::<Vec<_>>()};($it:ident; [$t:ty]) => {$it.map(|s| s.parse::<$t>().unwrap_or_else(|e| panic!("{}", e))).collect::<Vec<_>>()};($it:ident; $t:ty) => {$it.next().unwrap_or_else(|| panic!("input mismatch")).parse::<$t>().unwrap_or_else(|e| panic!("{}", e))};($it:ident; $($t:tt),+) => {($(_read!($it; $t)),*)};}pub fn main() {let _ = ::std::thread::Builder::new().name("run".to_string()).stack_size(32 * 1024 * 1024).spawn(run).unwrap().join();}const MOD: usize = 998244353;const INF: i64 = std::i64::MAX/3;pub trait TE {type T: Clone;type E: Clone;fn fold(Self::T, Self::T) -> Self::T;fn eval(Self::T, Self::E) -> Self::T;fn merge(Self::E, Self::E) -> Self::E;fn e() -> Self::T;fn id() -> Self::E;}pub struct LazySegmentTree<R: TE> {size: usize,bit: usize,a: Vec<(R::T, R::E)>,}impl <R: TE> LazySegmentTree<R> {pub fn new(n: usize) -> LazySegmentTree<R> {let mut bit = 0;while (1 << bit) < n {bit += 1;}LazySegmentTree {size: 1 << bit,bit: bit,a: vec![(R::e(), R::id()); 2 << bit],}}pub fn build_by(z: &[R::T]) -> LazySegmentTree<R> {let n = z.len();let mut bit = 0;while (1 << bit) < n {bit += 1;}let mut a = vec![(R::e(), R::id()); 2 << bit];for (a, z) in a[(1 << bit)..].iter_mut().zip(z.iter()) {a.0 = z.clone();}for i in (1..(1 << bit)).rev() {let l = R::eval(a[2 * i].0.clone(), a[2 * i].1.clone());let r = R::eval(a[2 * i + 1].0.clone(), a[2 * i + 1].1.clone());a[i].0 = R::fold(l, r);}LazySegmentTree {size: 1 << bit,bit : bit,a: a,}}fn eval(&self, k: usize) -> R::T {R::eval(self.a[k].0.clone(), self.a[k].1.clone())}fn propagate(&mut self, x: usize) {let x = x + self.size;for i in (1..(self.bit + 1)).rev() {let k = x >> i;self.a[2 * k].1 = R::merge(self.a[2 * k].1.clone(), self.a[k].1.clone());self.a[2 * k + 1].1 = R::merge(self.a[2 * k + 1].1.clone(), self.a[k].1.clone());self.a[k].1 = R::id();self.a[k].0 = R::fold(self.eval(2 * k), self.eval(2 * k + 1));}}fn save(&mut self, x: usize) {let x = x + self.size;for i in 1..(self.bit + 1) {let k = x >> i;self.a[k].0 = R::fold(self.eval(2 * k), self.eval(2 * k + 1));}}pub fn update(&mut self, l: usize, r: usize, op: R::E) {self.propagate(l);self.propagate(r - 1);let mut x = l + self.size;let mut y = r + self.size;while x < y {if x & 1 == 1 {self.a[x].1 = R::merge(self.a[x].1.clone(), op.clone());x += 1;}if y & 1 == 1 {y -= 1;self.a[y].1 = R::merge(self.a[y].1.clone(), op.clone());}x >>= 1;y >>= 1;}self.save(l);self.save(r - 1);}pub fn find(&mut self, l: usize, r: usize) -> R::T {self.propagate(l);self.propagate(r - 1);let mut x = l + self.size;let mut y = r + self.size;let mut p = R::e();let mut q = R::e();while x < y {if x & 1 == 1 {p = R::fold(p, self.eval(x));x += 1;}if y & 1 == 1 {y -= 1;q = R::fold(self.eval(y), q);}x >>= 1;y >>= 1;}R::fold(p, q)}}struct R;impl TE for R {type T = (i64, i64, i64, usize, usize);type E = i64;fn fold(l: Self::T, r: Self::T) -> Self::T {(l.0 + r.0, l.1 + r.1, l.2 + r.2, min(l.3,r.3), max(l.4,r.4))}fn eval(p: Self::T, x: Self::E) -> Self::T {(p.0+x*p.2, p.1+2*p.0*x+x*x*p.2, p.2, p.3, p.4)}fn merge(f: Self::E, g: Self::E) -> Self::E {f + g}fn e() -> Self::T {(0, 0, 1, 100000000, 100000000)}fn id() -> Self::E {0}}fn solve() {let n = read!(usize);let a = read!([i64]);let q = read!(usize);let query = read!([i64];q);let mut b = vec![];for i in 0..n {b.push((a[i],a[i]*a[i],1,i,i));}let mut seg = LazySegmentTree::<R>::build_by(&b);for query in query {if query[0]==1 {let l = (query[1]-1) as usize;let r = (query[2]-1) as usize;let x = query[3];seg.update(l,r+1,x);}else {let l = (query[1]-1) as usize;let r = (query[2]-1) as usize;let val = seg.find(l,r+1);println!("{}",val.1);}}}fn run() {solve();}