結果

問題 No.1008 Bench Craftsman
ユーザー koba-e964koba-e964
提出日時 2020-03-07 00:27:16
言語 Rust
(1.77.0 + proconio)
結果
WA  
実行時間 -
コード長 3,491 bytes
コンパイル時間 13,362 ms
コンパイル使用メモリ 377,252 KB
実行使用メモリ 5,952 KB
最終ジャッジ日時 2024-10-14 10:44:01
合計ジャッジ時間 16,126 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 1 ms
5,248 KB
testcase_02 AC 1 ms
5,248 KB
testcase_03 AC 1 ms
5,248 KB
testcase_04 WA -
testcase_05 AC 66 ms
5,952 KB
testcase_06 AC 27 ms
5,248 KB
testcase_07 WA -
testcase_08 AC 4 ms
5,248 KB
testcase_09 AC 31 ms
5,248 KB
testcase_10 AC 59 ms
5,828 KB
testcase_11 AC 58 ms
5,832 KB
testcase_12 AC 58 ms
5,828 KB
testcase_13 AC 58 ms
5,832 KB
testcase_14 AC 57 ms
5,832 KB
testcase_15 AC 58 ms
5,828 KB
testcase_16 AC 57 ms
5,812 KB
testcase_17 AC 58 ms
5,832 KB
testcase_18 WA -
testcase_19 AC 58 ms
5,828 KB
testcase_20 AC 24 ms
5,248 KB
testcase_21 AC 25 ms
5,248 KB
testcase_22 AC 34 ms
5,248 KB
testcase_23 AC 46 ms
5,248 KB
testcase_24 AC 43 ms
5,248 KB
testcase_25 AC 25 ms
5,248 KB
testcase_26 AC 19 ms
5,248 KB
testcase_27 AC 29 ms
5,248 KB
testcase_28 AC 36 ms
5,248 KB
testcase_29 AC 52 ms
5,248 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
use std::io::{Write, BufWriter};
// https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_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, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, [ $t:tt ]) => {{
        let len = read_value!($next, usize);
        (0..len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    }};

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}

#[allow(unused)]
macro_rules! debug {
    ($($format:tt)*) => (write!(std::io::stderr(), $($format)*).unwrap());
}
#[allow(unused)]
macro_rules! debugln {
    ($($format:tt)*) => (writeln!(std::io::stderr(), $($format)*).unwrap());
}

fn calc(n: usize, xw: &[(usize, i64)], c: i64) -> Vec<i64> {
    if c == 0 {
        let s = xw.iter().map(|&(_, w)| w).sum();
        return vec![s; n];
    }
    let mut sum = vec![0; n + 1];
    let mut sum2 = vec![0; n + 1];
    for &(x, w) in xw {
        let r = w / c;
        let lo = max(0, x as i64 - r);
        let hi = min(n as i64 - 1, x as i64 + r);
        // [lo, x]
        sum[lo as usize] += w - (lo - x as i64).abs() * c;
        sum2[lo as usize + 1] += c;
        sum2[x + 1] -= 2 * c;
        // [x + 1, hi]
        sum2[hi as usize + 1] += c;
        sum[hi as usize + 1] -= w - (hi - x as i64).abs() * c;
    }
    for i in 0..n {
        sum2[i + 1] += sum2[i];
    }
    for i in 0..n {
        sum[i] += sum2[i];
        sum[i + 1] += sum[i];
    }
    sum.pop();
    sum
}

fn solve() {
    let out = std::io::stdout();
    let mut out = BufWriter::new(out.lock());
    macro_rules! puts {
        ($($format:tt)*) => (let _ = write!(out,$($format)*););
    }
    input! {
        n: usize, m: usize,
        a: [i64; n],
        xw: [(usize1, i64); m],
    }
    const INF: i64 = 1 << 20;
    let mut pass = INF;
    let mut fail = -1;
    while pass - fail > 1 {
        let mid = (pass + fail) / 2;
        let w = calc(n, &xw, mid);
        let ok = (0..n).all(|i| a[i] >= w[i]);
        if ok {
            pass = mid;
        } else {
            fail = mid;
        }
    }
    puts!("{}\n", if pass >= INF { -1 } else { pass });
}

fn main() {
    // In order to avoid potential stack overflow, spawn a new thread.
    let stack_size = 104_857_600; // 100 MB
    let thd = std::thread::Builder::new().stack_size(stack_size);
    thd.spawn(|| solve()).unwrap().join().unwrap();
}
0