結果

問題 No.2015 Stair Counter
ユーザー manta1130manta1130
提出日時 2022-07-22 21:47:24
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 12 ms / 2,000 ms
コード長 5,342 bytes
コンパイル時間 12,747 ms
コンパイル使用メモリ 379,784 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-07-04 05:59:16
合計ジャッジ時間 14,259 ms
ジャッジサーバーID
(参考情報)
judge2 / judge1
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,812 KB
testcase_01 AC 8 ms
6,940 KB
testcase_02 AC 9 ms
6,940 KB
testcase_03 AC 10 ms
6,940 KB
testcase_04 AC 7 ms
6,944 KB
testcase_05 AC 6 ms
6,944 KB
testcase_06 AC 12 ms
6,944 KB
testcase_07 AC 11 ms
6,940 KB
testcase_08 AC 11 ms
6,940 KB
testcase_09 AC 4 ms
6,940 KB
testcase_10 AC 3 ms
6,944 KB
testcase_11 AC 4 ms
6,940 KB
testcase_12 AC 4 ms
6,940 KB
testcase_13 AC 4 ms
6,944 KB
testcase_14 AC 4 ms
6,944 KB
testcase_15 AC 7 ms
6,940 KB
testcase_16 AC 10 ms
6,940 KB
testcase_17 AC 4 ms
6,940 KB
testcase_18 AC 8 ms
6,940 KB
testcase_19 AC 10 ms
6,940 KB
testcase_20 AC 6 ms
6,940 KB
testcase_21 AC 6 ms
6,944 KB
testcase_22 AC 10 ms
6,944 KB
testcase_23 AC 10 ms
6,944 KB
testcase_24 AC 8 ms
6,944 KB
testcase_25 AC 8 ms
6,944 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: unused variable: `n`
  --> src/main.rs:12:13
   |
12 |             n:usize,m:i64,
   |             ^
   |
help: `n` is captured in macro and introduced a unused variable
  --> src/main.rs:65:17
   |
11 | /         inputv! {
12 | |             n:usize,m:i64,
13 | |         }
   | |_________- in this macro invocation
...
65 |               let $x: $t = buf_split_result.parse().unwrap();
   |                   ^^
   = note: `#[warn(unused_variables)]` on by default
   = note: this warning originates in the macro `input_internal` which comes from the expansion of the macro `inputv` (in Nightly builds, run with -Z macro-backtrace for more info)

warning: value assigned to `j1` is never read
  --> src/main.rs:18:21
   |
18 |             let mut j1 = 0;
   |                     ^^
   |
   = help: maybe it is overwritten before being read?
   = note: `#[warn(unused_assignments)]` on by default

ソースコード

diff #

#[allow(unused_imports)]
use std::io::{stdout, BufWriter, Write};
fn main() {
    let out = stdout();
    let mut out = BufWriter::new(out.lock());

    inputv! {
        t:usize
    }
    for _ in 0..t {
        inputv! {
            n:usize,m:i64,
        }
        let mut v = input_vector::<i64>();

        let mut solve = || {
            v.insert(0, m);
            let mut j1 = 0;
            let mut j2 = 0;
            for i in 0..v.len() - 2 {
                j1 = v[i + 1] - j2;
                j2 = v[i] - j1;

                if j1 + j2 != v[i] || j1 < 0 || j2 < 0 {
                    return false;
                }
            }
            true
        };

        writeln!(out, "{}", if solve() { "Yes" } else { "No" }).unwrap();
    }
}

//https://github.com/manta1130/competitive-template-rs

use input::*;

pub mod input {
    use std::cell::RefCell;
    use std::io;
    pub const SPLIT_DELIMITER: char = ' ';
    pub use std::io::prelude::*;

    thread_local! {
        pub static INPUT_BUFFER:RefCell<std::collections::VecDeque<String>>=RefCell::new(std::collections::VecDeque::new());
    }

    #[macro_export]
    macro_rules! input_internal {
        ($x:ident : $t:ty) => {
            INPUT_BUFFER.with(|p| {
                while p.borrow().len() == 0 {
                    let temp_str = input_line_str();
                    let mut split_result_iter = temp_str
                        .split(SPLIT_DELIMITER)
                        .map(|q| q.to_string())
                        .filter(|q| q.len() > 0)
                        .collect::<std::collections::VecDeque<_>>();
                    p.borrow_mut().append(&mut split_result_iter)
                }
            });
            let mut buf_split_result = String::new();
            INPUT_BUFFER.with(|p| buf_split_result = p.borrow_mut().pop_front().unwrap());
            let $x: $t = buf_split_result.parse().unwrap();
        };
        (mut $x:ident : $t:ty) => {
            INPUT_BUFFER.with(|p| {
                while p.borrow().len() == 0 {
                    let temp_str = input_line_str();
                    let mut split_result_iter = temp_str
                        .split(SPLIT_DELIMITER)
                        .map(|q| q.to_string())
                        .filter(|q| q.len() > 0)
                        .collect::<std::collections::VecDeque<_>>();
                    p.borrow_mut().append(&mut split_result_iter)
                }
            });
            let mut buf_split_result = String::new();
            INPUT_BUFFER.with(|p| buf_split_result = p.borrow_mut().pop_front().unwrap());
            let mut $x: $t = buf_split_result.parse().unwrap();
        };
    }

    pub fn input_buffer_is_empty() -> bool {
        let mut empty = false;
        INPUT_BUFFER.with(|p| {
            if p.borrow().len() == 0 {
                empty = true;
            }
        });
        empty
    }

    #[macro_export]
    macro_rules! inputv {
    ($i:ident : $t:ty) => {
        input_internal!{$i : $t}
    };
    (mut $i:ident : $t:ty) => {
        input_internal!{mut $i : $t}
    };
    ($i:ident : $t:ty $(,)*) => {
            input_internal!{$i : $t}
    };
    (mut $i:ident : $t:ty $(,)*) => {
            input_internal!{mut $i : $t}
    };
    (mut $i:ident : $t:ty,$($q:tt)*) => {
            input_internal!{mut $i : $t}
            inputv!{$($q)*}
    };
    ($i:ident : $t:ty,$($q:tt)*) => {
            input_internal!{$i : $t}
            inputv!{$($q)*}
    };
}

    pub fn input_all() {
        INPUT_BUFFER.with(|p| {
            if p.borrow().len() == 0 {
                let mut temp_str = String::new();
                std::io::stdin().read_to_string(&mut temp_str).unwrap();
                let mut split_result_iter = temp_str
                    .split_whitespace()
                    .map(|q| q.to_string())
                    .collect::<std::collections::VecDeque<_>>();
                p.borrow_mut().append(&mut split_result_iter)
            }
        });
    }

    pub fn input_line_str() -> String {
        let mut s = String::new();
        io::stdin().read_line(&mut s).unwrap();
        s.trim().to_string()
    }

    #[allow(clippy::match_wild_err_arm)]
    pub fn input_vector<T>() -> Vec<T>
    where
        T: std::str::FromStr,
    {
        let mut v: Vec<T> = Vec::new();

        let s = input_line_str();
        if s.is_empty() {
            return v;
        }
        let split_result = s.split(SPLIT_DELIMITER);
        for z in split_result {
            let buf = match z.parse() {
                Ok(r) => r,
                Err(_) => panic!("Parse Error",),
            };
            v.push(buf);
        }
        v
    }

    #[allow(clippy::match_wild_err_arm)]
    pub fn input_vector_row<T>(n: usize) -> Vec<T>
    where
        T: std::str::FromStr,
    {
        let mut v = Vec::with_capacity(n);
        for _ in 0..n {
            let buf = match input_line_str().parse() {
                Ok(r) => r,
                Err(_) => panic!("Parse Error",),
            };
            v.push(buf);
        }
        v
    }

    pub trait ToCharVec {
        fn to_charvec(&self) -> Vec<char>;
    }

    impl ToCharVec for String {
        fn to_charvec(&self) -> Vec<char> {
            self.to_string().chars().collect::<Vec<_>>()
        }
    }
}
0