#447138 (Rust) No.1012 荷物収集

提出ソース

結果

問題	No.1012 荷物収集
ユーザー	akiradeveloper
提出日時	2020-03-20 23:14:30
言語	Rust (1.77.0)
結果	AC
実行時間	58 ms / 2,000 ms
コード長	7,997 bytes
コンパイル時間	6,110 ms
コンパイル使用メモリ	183,344 KB
実行使用メモリ	11,088 KB
最終ジャッジ日時	2023-08-21 22:14:37
合計ジャッジ時間	12,149 ms
ジャッジサーバーID （参考情報）	judge12 / judge14

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 4,380 KB
testcase_01	AC	1 ms 4,380 KB
testcase_02	AC	2 ms 4,380 KB
testcase_03	AC	1 ms 4,376 KB
testcase_04	AC	41 ms 11,048 KB
testcase_05	AC	41 ms 10,952 KB
testcase_06	AC	42 ms 11,064 KB
testcase_07	AC	42 ms 10,996 KB
testcase_08	AC	41 ms 11,088 KB
testcase_09	AC	42 ms 10,940 KB
testcase_10	AC	42 ms 11,028 KB
testcase_11	AC	42 ms 10,964 KB
testcase_12	AC	42 ms 10,944 KB
testcase_13	AC	41 ms 11,052 KB
testcase_14	AC	1 ms 4,380 KB
testcase_15	AC	1 ms 4,380 KB
testcase_16	AC	1 ms 4,380 KB
testcase_17	AC	1 ms 4,376 KB
testcase_18	AC	2 ms 4,380 KB
testcase_19	AC	1 ms 4,380 KB
testcase_20	AC	1 ms 4,380 KB
testcase_21	AC	1 ms 4,380 KB
testcase_22	AC	1 ms 4,380 KB
testcase_23	AC	1 ms 4,376 KB
testcase_24	AC	43 ms 8,200 KB
testcase_25	AC	54 ms 10,096 KB
testcase_26	AC	23 ms 5,392 KB
testcase_27	AC	7 ms 4,376 KB
testcase_28	AC	55 ms 10,364 KB
testcase_29	AC	23 ms 5,456 KB
testcase_30	AC	53 ms 10,692 KB
testcase_31	AC	28 ms 6,076 KB
testcase_32	AC	19 ms 4,564 KB
testcase_33	AC	34 ms 6,536 KB
testcase_34	AC	36 ms 6,896 KB
testcase_35	AC	42 ms 9,640 KB
testcase_36	AC	35 ms 6,636 KB
testcase_37	AC	23 ms 5,196 KB
testcase_38	AC	44 ms 8,476 KB
testcase_39	AC	17 ms 4,380 KB
testcase_40	AC	23 ms 5,140 KB
testcase_41	AC	58 ms 10,556 KB
testcase_42	AC	27 ms 5,600 KB
testcase_43	AC	36 ms 6,980 KB
testcase_44	AC	1 ms 4,380 KB

権限があれば一括ダウンロードができます

コンパイルメッセージ

warning: variable does not need to be mutable
   --> Main.rs:119:9
    |
119 |     let mut Xorig = X.clone();
    |         ----^^^^^
    |         |
    |         help: remove this `mut`
    |
    = note: `#[warn(unused_mut)]` on by default

warning: variable `X` should have a snake case name
   --> Main.rs:117:9
    |
117 |         X:[i64;q],
    |         ^ help: convert the identifier to snake case (notice the capitalization): `x`
    |
    = note: `#[warn(non_snake_case)]` on by default

warning: variable `Xorig` should have a snake case name
   --> Main.rs:119:13
    |
119 |     let mut Xorig = X.clone();
    |             ^^^^^ help: convert the identifier to snake case (notice the capitalization): `xorig`

warning: variable `X` should have a snake case name
   --> Main.rs:127:13
    |
127 |     let mut X = X;
    |             ^ help: convert the identifier to snake case (notice the capitalization): `x`

warning: variable `Xi` should have a snake case name
   --> Main.rs:137:9
    |
137 |     let Xi = X[0];
    |         ^^ help: convert the identifier to snake case (notice the capitalization): `xi`

warning: variable `Xi` should have a snake case name
   --> Main.rs:152:13
    |
152 |         let Xi = X[i];
    |             ^^ help: convert the identifier to snake case (notice the capitalization): `xi`

warning: variable `D` should have a snake case name
   --> Main.rs:153:13
    |
153 |         let D = X[i] - X[i-1];
    |             ^ help: convert the identifier to snake case: `d`

warning: variable `wL` should have a snake case name
   --> Main.rs:155:13
    |
155 |         let wL = sumw[l] - sumw[0];
    |             ^^ help: convert the identifier to snake case: `w_l`

warning: variable `wR` should have a snake case name
   --> Main.rs:156:13
    |
156 |         let wR = sumw[n] - sumw[r];
    |             ^^ help: convert the identifier to snake case: `w_r`

warning: variable `Xi` should have a snake case name
   --> Main.rs:168:9
    |
168 |

ソースコード

raw source code

#[doc = " https://github.com/akiradeveloper/rust-comp-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::iter::FromIterator;
#[macro_export]
macro_rules ! chmax { ( $ x : expr , $ ( $ v : expr ) ,+ ) => { $ ( $ x = std :: cmp :: max ( $ x ,$ v ) ; ) + } ; }
#[macro_export]
macro_rules ! chmin { ( $ x : expr , $ ( $ v : expr ) ,+ ) => { $ ( $ x = std :: cmp :: min ( $ x ,$ v ) ; ) + } ; }
#[macro_export]
macro_rules ! max { ( $ x : expr ) => ( $ x ) ; ( $ x : expr , $ ( $ xs : expr ) ,+ ) => { std :: cmp :: max ( $ x , max ! ( $ ( $ xs ) ,+ ) ) } ; }
#[macro_export]
macro_rules ! min { ( $ x : expr ) => ( $ x ) ; ( $ x : expr , $ ( $ xs : expr ) ,+ ) => { std :: cmp :: min ( $ x , min ! ( $ ( $ xs ) ,+ ) ) } ; }
#[macro_export]
macro_rules ! dvec { ( $ t : expr ; $ len : expr ) => { vec ! [ $ t ; $ len ] } ; ( $ t : expr ; $ len : expr , $ ( $ rest : expr ) ,* ) => { vec ! [ dvec ! ( $ t ; $ ( $ rest ) ,* ) ; $ len ] } ; }
#[macro_export]
macro_rules ! cfor { ( ; $ ( $ rest : tt ) * ) => { cfor ! ( ( ) ; $ ( $ rest ) * ) } ; ( $ ( $ init : stmt ) ,+; ; $ ( $ rest : tt ) * ) => { cfor ! ( $ ( $ init ) ,+; ! false ; $ ( $ rest ) * ) } ; ( $ ( $ init : stmt ) ,+; $ cond : expr ; ; $ body : block ) => { cfor ! { $ ( $ init ) ,+; $ cond ; ( ) ; $ body } } ; ( $ ( $ init : stmt ) ,+; $ cond : expr ; $ ( $ step : expr ) ,+; $ body : block ) => { { $ ( $ init ; ) + while $ cond { let mut _first = true ; let mut _continue = false ; loop { if ! _first { _continue = true ; break } _first = false ; $ body } if ! _continue { break } $ ( $ step ; ) + } } } ; }
#[doc = " main"]
#[allow(unused_imports)]
use std::io::{stdin, stdout, BufWriter, Write};
#[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() {
    let out = stdout();
    let mut out = BufWriter::new(out.lock());
    input!{
        n:usize,q:usize,
        xw:[(i64,i64);n],
        X:[i64;q],
    }
    let mut Xorig = X.clone();

    let mut xw = xw;
    xw.sort_by_key(|a|a.0);
    let mut x = vec![];
    for i in 0..n { x.push(xw[i].0); }
    let mut w = vec![];
    for i in 0..n { w.push(xw[i].1); }
    let mut X = X;
    X.sort();
    let mut ans = HashMap::new();

    let mut sumw = vec![0;n+1];
    for i in 0..n {
        sumw[i+1] = sumw[i] + w[i];
    }

    // init
    let Xi = X[0];
    let r = x.lower_bound(&Xi);
    let mut tot = 0;
    for i in 0..r {
        let d = i64::abs(x[i]-Xi);
        tot += w[i] * d;
    }
    for i in r..n {
        let d = i64::abs(x[i]-Xi);
        tot += w[i] * d;
    }
    ans.insert(Xi, tot);

    let mut l = r;
    for i in 1..q {
        let Xi = X[i];
        let D = X[i] - X[i-1];
        let r = x.lower_bound(&Xi);
        let wL = sumw[l] - sumw[0];
        let wR = sumw[n] - sumw[r];
        tot += wL * D;
        tot -= wR * D;
        for j in l..r {
            tot += w[j] * i64::abs(X[i]-x[j]);
            tot -= w[j] * i64::abs(x[j]-X[i-1]);
        }
        l = r;

        ans.insert(Xi, tot);
    }

    for Xi in Xorig {
        let v = ans.get(&Xi).unwrap();
        writeln!(out,"{}",v);
    }
}
#[doc = " Equivalent to std::lowerbound and std::upperbound in c++"]
pub trait LowerBound<T> {
    fn lower_bound(&self, x: &T) -> usize;
    fn upper_bound(&self, x: &T) -> usize;
}
impl<T: Ord> LowerBound<T> for [T] {
    fn lower_bound(&self, x: &T) -> usize {
        let mut low = 0;
        let mut high = self.len();
        while low != high {
            let mid = (low + high) / 2;
            match self[mid].cmp(x) {
                Ordering::Less => {
                    low = mid + 1;
                }
                Ordering::Equal | Ordering::Greater => {
                    high = mid;
                }
            }
        }
        low
    }
    fn upper_bound(&self, x: &T) -> usize {
        let mut low = 0;
        let mut high = self.len();
        while low != high {
            let mid = (low + high) / 2;
            match self[mid].cmp(x) {
                Ordering::Less | Ordering::Equal => {
                    low = mid + 1;
                }
                Ordering::Greater => {
                    high = mid;
                }
            }
        }
        low
    }
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード