#374417 (Rust) No.871 かえるのうた

• 問題: No.871 かえるのうた
• ユーザー: akiradeveloper
• 提出日時: 2019-08-31 01:35:57
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 404 ms / 2,000 ms
• コード長: 5,909 bytes
• コンパイル時間: 11,342 ms
• コンパイル使用メモリ: 401,672 KB
• 実行使用メモリ: 11,776 KB
• 最終ジャッジ日時: 2024-05-07 16:28:11
• 合計ジャッジ時間: 13,847 ms
• ジャッジサーバーID （参考情報）: judge3 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	1 ms; 5,248 KB
testcase_02	AC	1 ms; 5,376 KB
testcase_03	AC	1 ms; 5,376 KB
testcase_04	AC	1 ms; 5,376 KB
testcase_05	AC	1 ms; 5,376 KB
testcase_06	AC	0 ms; 5,376 KB
testcase_07	AC	1 ms; 5,376 KB
testcase_08	AC	1 ms; 5,376 KB
testcase_09	AC	1 ms; 5,376 KB
testcase_10	AC	1 ms; 5,376 KB
testcase_11	AC	1 ms; 5,376 KB
testcase_12	AC	3 ms; 5,376 KB
testcase_13	AC	1 ms; 5,376 KB
testcase_14	AC	15 ms; 5,376 KB
testcase_15	AC	14 ms; 5,376 KB
testcase_16	AC	404 ms; 11,776 KB
testcase_17	AC	14 ms; 5,376 KB
testcase_18	AC	3 ms; 5,376 KB
testcase_19	AC	16 ms; 5,376 KB
testcase_20	AC	45 ms; 5,376 KB
testcase_21	AC	9 ms; 5,376 KB
testcase_22	AC	1 ms; 5,376 KB
testcase_23	AC	1 ms; 5,376 KB
testcase_24	AC	1 ms; 5,376 KB
testcase_25	AC	2 ms; 5,376 KB
testcase_26	AC	5 ms; 5,376 KB
testcase_27	AC	3 ms; 5,376 KB
testcase_28	AC	1 ms; 5,376 KB
testcase_29	AC	5 ms; 5,376 KB
testcase_30	AC	30 ms; 8,960 KB
testcase_31	AC	1 ms; 5,376 KB
testcase_32	AC	19 ms; 7,040 KB
testcase_33	AC	13 ms; 5,376 KB
testcase_34	AC	4 ms; 5,376 KB
testcase_35	AC	8 ms; 5,376 KB
testcase_36	AC	10 ms; 5,376 KB
testcase_37	AC	19 ms; 6,400 KB
testcase_38	AC	52 ms; 11,392 KB
testcase_39	AC	28 ms; 10,112 KB
testcase_40	AC	15 ms; 6,656 KB
testcase_41	AC	1 ms; 5,376 KB
testcase_42	AC	15 ms; 8,448 KB
testcase_43	AC	1 ms; 5,376 KB
testcase_44	AC	1 ms; 5,376 KB
testcase_45	AC	1 ms; 5,376 KB
testcase_46	AC	1 ms; 5,376 KB
testcase_47	AC	1 ms; 5,376 KB
testcase_48	AC	1 ms; 5,376 KB

コンパイルメッセージ

warning: variable `X` should have a snake case name
   --> src/main.rs:100:34
    |
100 | fn dfs(i: usize, b: &mut [bool], X: &[i64], A: &[i64]) {
    |                                  ^ help: convert the identifier to snake case (notice the capitalization): `x`
    |
    = note: `#[warn(non_snake_case)]` on by default

warning: variable `A` should have a snake case name
   --> src/main.rs:100:45
    |
100 | fn dfs(i: usize, b: &mut [bool], X: &[i64], A: &[i64]) {
    |                                             ^ help: convert the identifier to snake case: `a`

warning: variable `N` should have a snake case name
   --> src/main.rs:113:9
    |
113 |         N:usize,K:usize,
    |         ^ help: convert the identifier to snake case: `n`

warning: variable `K` should have a snake case name
   --> src/main.rs:113:17
    |
113 |         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:114:9
    |
114 |         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:115:9
    |
115 |         A:[i64;N],
    |         ^ help: convert the identifier to snake case: `a`

ソースコード

#[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 dfs(i: usize, b: &mut [bool], X: &[i64], A: &[i64]) {
    b[i]=true;
    let lower = X[i]-A[i];
    let upper = X[i]+A[i];
    let k0 = X.lower_bound(&lower);
    let k1 = X.lower_bound(&(upper+1));
    for j in k0..k1 {
        if b[j] { continue; }
        dfs(j, b, X, A);
    }
}
fn solve() {
    input!{
        N:usize,K:usize,
        X:[i64;N],
        A:[i64;N],
    }
    let mut b=vec![false;N];
    dfs(K-1, &mut b, &X, &A);

    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
    }
}