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

• 問題: No.871 かえるのうた
• ユーザー: kei
• 提出日時: 2019-08-30 22:16:40
• 言語: Rust (1.77.0 + proconio)
• 結果: WA
• 実行時間: -
• コード長: 4,435 bytes
• コンパイル時間: 21,018 ms
• コンパイル使用メモリ: 378,236 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-11-22 00:11:24
• 合計ジャッジ時間: 20,298 ms
• ジャッジサーバーID （参考情報）: judge3 / judge1

入力	結果	実行時間; 実行使用メモリ
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	1 ms; 5,248 KB
testcase_10	AC	1 ms; 5,248 KB
testcase_11	AC	1 ms; 5,248 KB
testcase_12	AC	5 ms; 5,248 KB
testcase_13	AC	2 ms; 5,248 KB
testcase_14	AC	37 ms; 5,248 KB
testcase_15	AC	36 ms; 5,248 KB
testcase_16	AC	39 ms; 5,248 KB
testcase_17	AC	34 ms; 5,248 KB
testcase_18	AC	7 ms; 5,248 KB
testcase_19	AC	38 ms; 5,248 KB
testcase_20	AC	4 ms; 5,248 KB
testcase_21	AC	14 ms; 5,248 KB
testcase_22	AC	1 ms; 5,248 KB
testcase_23	AC	2 ms; 5,248 KB
testcase_24	AC	1 ms; 5,248 KB
testcase_25	AC	2 ms; 5,248 KB
testcase_26	AC	2 ms; 5,248 KB
testcase_27	AC	4 ms; 5,248 KB
testcase_28	AC	2 ms; 5,248 KB
testcase_29	AC	12 ms; 5,248 KB
testcase_30	AC	20 ms; 5,248 KB
testcase_31	AC	1 ms; 5,248 KB
testcase_32	AC	16 ms; 5,248 KB
testcase_33	AC	23 ms; 5,248 KB
testcase_34	AC	7 ms; 5,248 KB
testcase_35	AC	14 ms; 5,248 KB
testcase_36	AC	18 ms; 5,248 KB
testcase_37	AC	13 ms; 5,248 KB
testcase_38	AC	27 ms; 5,248 KB
testcase_39	AC	26 ms; 5,248 KB
testcase_40	AC	10 ms; 5,248 KB
testcase_41	AC	1 ms; 5,248 KB
testcase_42	AC	10 ms; 5,248 KB
testcase_43	AC	1 ms; 5,248 KB
testcase_44	WA	-
testcase_45	AC	1 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

ソースコード

#![allow(unused_mut, non_snake_case, unused_imports, dead_code,unused_macros)]

use std::iter;
use std::cmp::{max, min, Ordering};
use std::mem::swap;
use std::collections::{HashMap, BTreeMap, HashSet, BTreeSet, BinaryHeap,VecDeque};
use std::iter::FromIterator;

//　高速 EOF要
//macro_rules! input {(source = $s:expr, $($r:tt)*) => {let mut iter = $s.split_whitespace();input_inner!{iter, $($r)*}};($($r:tt)*) => {let mut s = {use std::io::Read;let mut s = String::new();std::io::stdin().read_to_string(&mut s).unwrap();s};let mut iter = s.split_whitespace();input_inner!{iter, $($r)*}};}
//macro_rules! input_inner {($iter:expr) => {};($iter:expr, ) => {};($iter:expr, $var:ident : $t:tt $($r:tt)*) => {let $var = read_value!($iter, $t);input_inner!{$iter $($r)*}};}
//macro_rules! read_value {($iter:expr, ( $($t:tt),* )) => {( $(read_value!($iter, $t)),* )};($iter:expr, [ $t:tt ; $len:expr ]) => {(0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()};($iter:expr, chars) => {read_value!($iter, String).chars().collect::<Vec<char>>()};($iter:expr, usize1) => {read_value!($iter, usize) - 1};($iter:expr, $t:ty) => {$iter.next().unwrap().parse::<$t>().expect("Parse error")};}
// 低速 EOF不要
macro_rules! input {(source = $s:expr, $($r:tt)*) => {let mut iter = $s.split_whitespace();let mut next = || { iter.next().unwrap() };input_inner!{next, $($r)*}};($($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! mut_input {(source = $s:expr, $($r:tt)*) => {let mut iter = $s.split_whitespace();let mut next = || { iter.next().unwrap() }; mut_input_inner!{next, $($r)*}};($($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()}; mut_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! mut_input_inner {($next:expr) => {};($next:expr, ) => {};($next:expr, $var:ident : $t:tt $($r:tt)*) => {let mut $var = read_value!($next, $t);mut_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:ty) => {$next().parse::<$t>().expect("Parse error")};}

// 非常時
fn read_line() -> String {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).unwrap();
    s.trim().to_string()
}
fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().split_whitespace()
        .map(|e| e.parse().ok().unwrap()).collect()
}



fn solve(){
    mut_input!(N:usize,K:usize1,X:[i64;N],A:[i64;N]);
    let mut X:Vec<i64> = X;
    let mut A:Vec<i64> = A;

    let mut ok = vec![false;N];

    ok[K] = true;
    let mut R = X[K] + A[K];
    let mut L = X[K] - A[K];

    for k in 0..N{
        if L <= X[k] && X[k] <= R{
            ok[k] = true;
            R = max(R,X[k]+A[k]);
            L = min(L,X[k]-A[k]);
        }
    }
    for k in (0..N).rev(){
        if L <= X[k] && X[k] <= R{
            ok[k] = true;
            R = max(R,X[k]+A[k]);
            L = min(L,X[k]-A[k]);
        }
    }

    for k in 0..N{
        if L <= X[k] && X[k] <= R{
            ok[k] = true;
            R = max(R,X[k]+A[k]);
            L = min(L,X[k]-A[k]);
        }
    }
    for k in (0..N).rev(){
        if L <= X[k] && X[k] <= R{
            ok[k] = true;
            R = max(R,X[k]+A[k]);
            L = min(L,X[k]-A[k]);
        }
    }



    println!("{}",ok.into_iter().filter(|v| *v).count());
}
fn main() {
    let stack_size = 104_857_600; // 100 MB
    let thd = std::thread::Builder::new().stack_size(stack_size);
    thd.spawn(|| solve()).unwrap().join().unwrap();
}