結果

問題 No.871 かえるのうた
ユーザー akiradeveloperakiradeveloper
提出日時 2019-08-30 23:45:40
言語 Rust
(1.77.0 + proconio)
結果
WA  
実行時間 -
コード長 7,266 bytes
コンパイル時間 26,523 ms
コンパイル使用メモリ 376,388 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-11-22 04:44:25
合計ジャッジ時間 16,395 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
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 AC 1 ms
5,248 KB
testcase_05 AC 1 ms
5,248 KB
testcase_06 AC 1 ms
5,248 KB
testcase_07 AC 1 ms
5,248 KB
testcase_08 AC 1 ms
5,248 KB
testcase_09 AC 2 ms
5,248 KB
testcase_10 AC 1 ms
5,248 KB
testcase_11 AC 1 ms
5,248 KB
testcase_12 AC 3 ms
5,248 KB
testcase_13 AC 2 ms
5,248 KB
testcase_14 AC 16 ms
5,248 KB
testcase_15 AC 16 ms
5,248 KB
testcase_16 AC 55 ms
5,248 KB
testcase_17 AC 15 ms
5,248 KB
testcase_18 AC 4 ms
5,248 KB
testcase_19 AC 18 ms
5,248 KB
testcase_20 AC 3 ms
5,248 KB
testcase_21 AC 10 ms
5,248 KB
testcase_22 AC 1 ms
5,248 KB
testcase_23 AC 1 ms
5,248 KB
testcase_24 AC 1 ms
5,248 KB
testcase_25 AC 2 ms
5,248 KB
testcase_26 AC 4 ms
5,248 KB
testcase_27 AC 2 ms
5,248 KB
testcase_28 AC 1 ms
5,248 KB
testcase_29 AC 6 ms
5,248 KB
testcase_30 AC 27 ms
5,248 KB
testcase_31 AC 2 ms
5,248 KB
testcase_32 AC 21 ms
5,248 KB
testcase_33 AC 13 ms
5,248 KB
testcase_34 AC 4 ms
5,248 KB
testcase_35 AC 8 ms
5,248 KB
testcase_36 AC 11 ms
5,248 KB
testcase_37 AC 18 ms
5,248 KB
testcase_38 AC 41 ms
5,248 KB
testcase_39 AC 33 ms
5,248 KB
testcase_40 AC 21 ms
5,248 KB
testcase_41 AC 1 ms
5,248 KB
testcase_42 AC 22 ms
5,248 KB
testcase_43 AC 1 ms
5,248 KB
testcase_44 WA -
testcase_45 AC 2 ms
5,248 KB
testcase_46 AC 1 ms
5,248 KB
testcase_47 AC 1 ms
5,248 KB
testcase_48 AC 1 ms
5,248 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: variable `N` should have a snake case name
   --> src/main.rs:102:9
    |
102 |         N:usize,K:usize,
    |         ^ help: convert the identifier to snake case: `n`
    |
    = note: `#[warn(non_snake_case)]` on by default

warning: variable `K` should have a snake case name
   --> src/main.rs:102:17
    |
102 |         N:usize,K:usize,
    |                 ^ help: convert the identifier to snake case (notice the capitalization): `k`

warning: variable `X` should have a snake case name
   --> src/main.rs:103:9
    |
103 |         X:[i64;N],
    |         ^ help: convert the identifier to snake case (notice the capitalization): `x`

warning: variable `A` should have a snake case name
   --> src/main.rs:104:9
    |
104 |         A:[i64;N],
    |         ^ help: convert the identifier to snake case: `a`

ソースコード

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,K:usize,
        X:[i64;N],
        A:[i64;N],
    }
    let mut b=vec![false;N];
    b[K-1]=true;
    let mut i=K-1;
    while b[i] {
        let lower = X[i]-A[i];
        let upper = X[i]+A[i];
        let k = X.lower_bound(&lower);
        for j in k..K {
            if b[j] { break; }
            b[j]=true;
        }
        let k = X.lower_bound(&(upper+1));
        for j in (K-1..k).rev() {
            if b[j] { break; }
            b[j]=true;
        }
        if i==N-1 { break; }
        i+=1;
    }
    let mut i=K-1;
    while b[i] {
        let lower = X[i]-A[i];
        let upper = X[i]+A[i];
        let k = X.lower_bound(&lower);
        for j in k..K {
            if b[j] { break; }
            b[j]=true;
        }
        let k = X.lower_bound(&(upper+1));
        for j in (K-1..k).rev() {
            if b[j] { break; }
            b[j]=true;
        }
        if i==0 { break; }
        i-=1;
    }

    let mut i=K-1;
    while b[i] {
        let lower = X[i]-A[i];
        let upper = X[i]+A[i];
        let k = X.lower_bound(&lower);
        for j in k..K {
            if b[j] { break; }
            b[j]=true;
        }
        let k = X.lower_bound(&(upper+1));
        for j in (K-1..k).rev() {
            if b[j] { break; }
            b[j]=true;
        }
        if i==N-1 { break; }
        i+=1;
    }
    let mut i=K-1;
    while b[i] {
        let lower = X[i]-A[i];
        let upper = X[i]+A[i];
        let k = X.lower_bound(&lower);
        for j in k..K {
            if b[j] { break; }
            b[j]=true;
        }
        let k = X.lower_bound(&(upper+1));
        for j in (K-1..k).rev() {
            if b[j] { break; }
            b[j]=true;
        }
        if i==0 { break; }
        i-=1;
    }

    let mut n=0;
    for i in 0..N{
        if b[i] {
            n+=1;
        }
    }
    println!("{}",n);
}
#[doc = " Equivalent to std::lowerbound and std::upperbound in c++"]
pub trait BinarySearchCpp<T> {
    fn lower_bound(&self, x: &T) -> usize;
    fn upper_bound(&self, x: &T) -> usize;
}
impl<T: Ord> BinarySearchCpp<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
    }
}
0