結果

問題 No.949 飲酒プログラミングコンテスト
ユーザー akiradeveloperakiradeveloper
提出日時 2019-12-12 15:23:51
言語 Rust
(1.77.0)
結果
AC  
実行時間 245 ms / 2,500 ms
コード長 7,353 bytes
コンパイル時間 1,671 ms
コンパイル使用メモリ 166,532 KB
実行使用メモリ 71,588 KB
最終ジャッジ日時 2023-09-07 07:29:48
合計ジャッジ時間 6,574 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 1 ms
4,380 KB
testcase_04 AC 2 ms
4,376 KB
testcase_05 AC 1 ms
4,376 KB
testcase_06 AC 1 ms
4,500 KB
testcase_07 AC 1 ms
4,380 KB
testcase_08 AC 3 ms
4,376 KB
testcase_09 AC 1 ms
4,376 KB
testcase_10 AC 2 ms
4,380 KB
testcase_11 AC 169 ms
50,944 KB
testcase_12 AC 175 ms
51,728 KB
testcase_13 AC 155 ms
45,712 KB
testcase_14 AC 20 ms
7,132 KB
testcase_15 AC 110 ms
35,416 KB
testcase_16 AC 204 ms
64,932 KB
testcase_17 AC 26 ms
9,076 KB
testcase_18 AC 234 ms
68,368 KB
testcase_19 AC 134 ms
51,212 KB
testcase_20 AC 29 ms
11,428 KB
testcase_21 AC 9 ms
5,344 KB
testcase_22 AC 17 ms
10,080 KB
testcase_23 AC 2 ms
4,376 KB
testcase_24 AC 126 ms
37,792 KB
testcase_25 AC 245 ms
71,588 KB
testcase_26 AC 245 ms
71,540 KB
testcase_27 AC 225 ms
71,528 KB
testcase_28 AC 245 ms
71,548 KB
testcase_29 AC 196 ms
71,548 KB
testcase_30 AC 121 ms
71,588 KB
testcase_31 AC 86 ms
71,548 KB
testcase_32 AC 236 ms
71,548 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: unused variable: `out`
   --> Main.rs:112:13
    |
112 |     let mut out = BufWriter::new(out.lock());
    |             ^^^ help: if this is intentional, prefix it with an underscore: `_out`
    |
    = note: `#[warn(unused_variables)]` on by default

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

warning: 2 warnings emitted

ソースコード

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;
#[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 ] } ; }
#[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() {
    let out = stdout();
    let mut out = BufWriter::new(out.lock());

    input!{
        n:usize,
        a:[i64;n+1],
        b:[i64;n+1],
        d:[i64;n],
    }

    // 出来るだけ大きいやつをとるという戦略は正しい
    let mut d = d;
    d.sort();
    d.reverse();

    // a,bがi,jまで飲んで、
    // dの中で消化した最小index + 1（つまり次）
    let mut dp = dvec![1<<30;n+1,n+1];
    dp[0][0] = 0;

    // nlogn
    for i in 0..n+1 {
        for j in 0..n+1 {
            let l = dp[i][j];
            if l >= n {
                continue;
            }

            if i+1 <= n {
                let a_drink = a[i+1] + b[j];
                let bs = BinarySearch {
                    lower: l as i64,
                    upper: n as i64 -1,
                    p: |x:i64| {
                        d[x as usize] <= a_drink
                    }
                };
                let k = bs.lower_bound() as usize;
                chmin!(dp[i+1][j], k+1);
            }

            if j+1 <= n {
                let b_drink = a[i] + b[j+1];
                let bs = BinarySearch {
                    lower: l as i64,
                    upper: n as i64 -1,
                    p: |x:i64| {
                        d[x as usize] <= b_drink
                    }
                };
                let k = bs.lower_bound() as usize;
                chmin!(dp[i][j+1], k+1);
            }
        }
    }

    let mut maxv = 0;
    for i in 0..n+1 {
        for j in 0..n+1 {
            if dp[i][j] <= n {
                chmax!(maxv, i+j);
            }
        }
    }

    println!("{}", maxv);
}
#[doc = "lower,upper are inclusive range"]
pub struct BinarySearch<F> {
    pub p: F,
    pub lower: i64,
    pub upper: i64,
}
impl<F: Fn(i64) -> bool> BinarySearch<F> {
    #[doc = "O(log(upper-lower))"]
    pub fn lower_bound(&self) -> i64 {
        let lower = self.lower;
        let upper = self.upper;
        assert!(lower <= upper);
        let mut lb = lower - 1;
        let mut ub = upper + 1;
        while ub - lb > 1 {
            let mid = (lb + ub) / 2;
            if (self.p)(mid) {
                ub = mid;
            } else {
                lb = mid;
            }
        }
        let latter = ub;
        latter
    }
}
0