結果

問題 No.877 Range ReLU Query
ユーザー akiradeveloperakiradeveloper
提出日時 2019-09-09 16:46:32
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 199 ms / 2,000 ms
コード長 5,811 bytes
コンパイル時間 14,005 ms
コンパイル使用メモリ 378,820 KB
実行使用メモリ 13,052 KB
最終ジャッジ日時 2024-11-08 10:19:55
合計ジャッジ時間 17,791 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 2 ms
5,248 KB
testcase_04 AC 1 ms
5,248 KB
testcase_05 AC 2 ms
5,248 KB
testcase_06 AC 1 ms
5,248 KB
testcase_07 AC 1 ms
5,248 KB
testcase_08 AC 3 ms
5,248 KB
testcase_09 AC 1 ms
5,248 KB
testcase_10 AC 2 ms
5,248 KB
testcase_11 AC 195 ms
12,032 KB
testcase_12 AC 166 ms
11,008 KB
testcase_13 AC 134 ms
9,348 KB
testcase_14 AC 144 ms
9,344 KB
testcase_15 AC 194 ms
12,776 KB
testcase_16 AC 185 ms
12,268 KB
testcase_17 AC 189 ms
12,488 KB
testcase_18 AC 186 ms
12,536 KB
testcase_19 AC 192 ms
13,052 KB
testcase_20 AC 199 ms
13,036 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: variable `N` should have a snake case name
   --> src/main.rs:102:9
    |
102 |         N:usize,Q:usize,
    |         ^ help: convert the identifier to snake case: `n`
    |
    = note: `#[warn(non_snake_case)]` on by default

warning: variable `Q` should have a snake case name
   --> src/main.rs:102:17
    |
102 |         N:usize,Q:usize,
    |                 ^ help: convert the identifier to snake case: `q`

ソースコード

diff # 

#[doc = " https://github.com/hatoo/competitive-rust-snippets"]
#[allow(unused_imports)]
use std::cmp::{max, min, Ordering};
#[allow(unused_imports)]
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};
#[allow(unused_imports)]
use std::io::{stdin, stdout, BufWriter, Write};
#[allow(unused_imports)]
use std::iter::FromIterator;
#[allow(unused_macros)]
macro_rules ! debug { ( $ ( $ a : expr ) ,* ) => { eprintln ! ( concat ! ( $ ( stringify ! ( $ a ) , " = {:?}, " ) ,* ) , $ ( $ a ) ,* ) ; } }
#[macro_export]
macro_rules ! input { ( source = $ s : expr , $ ( $ r : tt ) * ) => { let mut parser = Parser :: from_str ( $ s ) ; input_inner ! { parser , $ ( $ r ) * } } ; ( parser = $ parser : ident , $ ( $ r : tt ) * ) => { input_inner ! { $ parser , $ ( $ r ) * } } ; ( new_stdin_parser = $ parser : ident , $ ( $ r : tt ) * ) => { let stdin = std :: io :: stdin ( ) ; let reader = std :: io :: BufReader :: new ( stdin . lock ( ) ) ; let mut $ parser = Parser :: new ( reader ) ; input_inner ! { $ parser , $ ( $ r ) * } } ; ( $ ( $ r : tt ) * ) => { input ! { new_stdin_parser = parser , $ ( $ r ) * } } ; }
#[macro_export]
macro_rules ! input_inner { ( $ parser : ident ) => { } ; ( $ parser : ident , ) => { } ; ( $ parser : ident , $ var : ident : $ t : tt $ ( $ r : tt ) * ) => { let $ var = read_value ! ( $ parser , $ t ) ; input_inner ! { $ parser $ ( $ r ) * } } ; }
#[macro_export]
macro_rules ! read_value { ( $ parser : ident , ( $ ( $ t : tt ) ,* ) ) => { ( $ ( read_value ! ( $ parser , $ t ) ) ,* ) } ; ( $ parser : ident , [ $ t : tt ; $ len : expr ] ) => { ( 0 ..$ len ) . map ( | _ | read_value ! ( $ parser , $ t ) ) . collect ::< Vec < _ >> ( ) } ; ( $ parser : ident , chars ) => { read_value ! ( $ parser , String ) . chars ( ) . collect ::< Vec < char >> ( ) } ; ( $ parser : ident , usize1 ) => { read_value ! ( $ parser , usize ) - 1 } ; ( $ parser : ident , $ t : ty ) => { $ parser . next ::<$ t > ( ) . expect ( "Parse error" ) } ; }
use std::io;
use std::io::BufRead;
use std::str;
pub struct Parser<R> {
    reader: R,
    buf: Vec<u8>,
    pos: usize,
}
impl Parser<io::Empty> {
    pub fn from_str(s: &str) -> Parser<io::Empty> {
        Parser {
            reader: io::empty(),
            buf: s.as_bytes().to_vec(),
            pos: 0,
        }
    }
}
impl<R: BufRead> Parser<R> {
    pub fn new(reader: R) -> Parser<R> {
        Parser {
            reader: reader,
            buf: vec![],
            pos: 0,
        }
    }
    pub fn update_buf(&mut self) {
        self.buf.clear();
        self.pos = 0;
        loop {
            let (len, complete) = {
                let buf2 = self.reader.fill_buf().unwrap();
                self.buf.extend_from_slice(buf2);
                let len = buf2.len();
                if len == 0 {
                    break;
                }
                (len, buf2[len - 1] <= 0x20)
            };
            self.reader.consume(len);
            if complete {
                break;
            }
        }
    }
    pub fn next<T: str::FromStr>(&mut self) -> Result<T, T::Err> {
        loop {
            let mut begin = self.pos;
            while begin < self.buf.len() && (self.buf[begin] <= 0x20) {
                begin += 1;
            }
            let mut end = begin;
            while end < self.buf.len() && (self.buf[end] > 0x20) {
                end += 1;
            }
            if begin != self.buf.len() {
                self.pos = end;
                return str::from_utf8(&self.buf[begin..end]).unwrap().parse::<T>();
            } else {
                self.update_buf();
            }
        }
    }
}
#[allow(unused_macros)]
macro_rules ! debug { ( $ ( $ a : expr ) ,* ) => { eprintln ! ( concat ! ( $ ( stringify ! ( $ a ) , " = {:?}, " ) ,* ) , $ ( $ a ) ,* ) ; } }
#[doc = " https://github.com/hatoo/competitive-rust-snippets"]
const BIG_STACK_SIZE: bool = true;
#[allow(dead_code)]
fn main() {
    use std::thread;
    if BIG_STACK_SIZE {
        thread::Builder::new()
            .stack_size(32 * 1024 * 1024)
            .name("solve".into())
            .spawn(solve)
            .unwrap()
            .join()
            .unwrap();
    } else {
        solve();
    }
}
fn solve() {
    input!{
        N:usize,Q:usize,
        a:[i64;N],
        q:[(usize,usize,usize,i64);Q],
    }
    let mut ans=vec![0;Q];
    let mut v=vec![];
    for i in 0..N {
        v.push((a[i],1,i));
    }
    for i in 0..Q {
        v.push((q[i].3,0,N+i));
    }
    v.sort(); v.reverse();

    let mut sum=BIT::new(N);
    let mut cnt=BIT::new(N);
    for i in 0..v.len() {
        let (x,_,j) = v[i];
        // dbg!(x,j);
        if j>=N { // query
            let k=j-N;
            let (_,l,r,_)=q[k];
            let l=l-1; // 0オリ
            let r=r-1;
            let s = sum.sum(r+1)-sum.sum(l);
            let t = cnt.sum(r+1)-cnt.sum(l);
            ans[k]=s-t*x;
        } else { // add value
            // dbg!(j+1);
            sum.add(j+1, x);
            cnt.add(j+1, 1 as i64);
        }
    }
    for x in ans {
        println!("{}",x);
    }
}
#[allow(dead_code)]
#[doc = " Binary Indexed Tree of usize"]
pub struct BIT<T> {
    buf: Vec<T>,
}
#[allow(dead_code)]
impl<T: Clone + Default + std::ops::AddAssign> BIT<T> {
    pub fn new(n: usize) -> BIT<T> {
        BIT {
            buf: vec![T::default(); n + 1],
        }
    }
    pub fn sum(&self, i: usize) -> T {
        let mut i = i;
        let mut s = T::default();
        while i > 0 {
            s += self.buf[i].clone();
            i &= i - 1;
        }
        s
    }
    pub fn add(&mut self, i: usize, x: T) {
        let mut i = i as i64;
        while i < self.buf.len() as i64 {
            self.buf[i as usize] += x.clone();
            i += i & -i;
        }
    }
}
0