結果
問題 | No.627 ランダムウォークの軌跡 |
ユーザー | manta1130 |
提出日時 | 2021-03-17 20:12:11 |
言語 | Rust (1.77.0 + proconio) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,052 bytes |
コンパイル時間 | 15,627 ms |
コンパイル使用メモリ | 399,600 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-04-27 12:37:43 |
合計ジャッジ時間 | 14,450 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,812 KB |
testcase_01 | WA | - |
testcase_02 | AC | 1 ms
6,944 KB |
testcase_03 | AC | 1 ms
6,944 KB |
testcase_04 | AC | 1 ms
6,944 KB |
testcase_05 | AC | 1 ms
6,944 KB |
testcase_06 | AC | 1 ms
6,940 KB |
testcase_07 | AC | 1 ms
6,940 KB |
testcase_08 | AC | 1 ms
6,940 KB |
testcase_09 | WA | - |
testcase_10 | AC | 1 ms
6,944 KB |
testcase_11 | AC | 1 ms
6,940 KB |
testcase_12 | AC | 0 ms
6,940 KB |
testcase_13 | WA | - |
testcase_14 | AC | 1 ms
6,940 KB |
testcase_15 | WA | - |
testcase_16 | AC | 1 ms
6,940 KB |
testcase_17 | AC | 1 ms
6,940 KB |
testcase_18 | AC | 1 ms
6,940 KB |
testcase_19 | WA | - |
testcase_20 | AC | 1 ms
6,940 KB |
testcase_21 | AC | 0 ms
6,940 KB |
testcase_22 | AC | 1 ms
6,944 KB |
testcase_23 | WA | - |
testcase_24 | AC | 1 ms
6,940 KB |
testcase_25 | AC | 1 ms
6,940 KB |
testcase_26 | AC | 1 ms
6,940 KB |
testcase_27 | WA | - |
testcase_28 | AC | 1 ms
6,940 KB |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | AC | 1 ms
6,940 KB |
testcase_32 | WA | - |
コンパイルメッセージ
warning: unused attribute `macro_export` --> src/main.rs:52:5 | 52 | #[macro_export] | ^^^^^^^^^^^^^^^ | note: the built-in attribute `macro_export` will be ignored, since it's applied to the macro invocation `thread_local` --> src/main.rs:53:5 | 53 | thread_local! { | ^^^^^^^^^^^^ = note: `#[warn(unused_attributes)]` on by default warning: function `func` is never used --> src/main.rs:6:4 | 6 | fn func(two: usize, five: usize, now: usize, res: &mut BTreeSet<usize>) { | ^^^^ | = note: `#[warn(dead_code)]` on by default
ソースコード
#[allow(unused_imports)] use std::io::{stdout, BufWriter, Write}; use std::collections::BTreeSet; fn func(two: usize, five: usize, now: usize, res: &mut BTreeSet<usize>) { if res.contains(&now) { return; } res.insert(now); if two == 0 && five == 0 { return; } if two != 0 { func(two - 1, five, now * 2, res); } if five != 0 { func(two, five - 1, now * 5, res); } } fn main() { let out = stdout(); let mut out = BufWriter::new(out.lock()); inputv! { n:usize, } let mut t = input_vector_row::<isize>(n); t.insert(0, 0); for i in 0..n - 1 { if (t[i] - t[i + 1]).abs() == 0 && (t[i] - t[i + 1]).abs() >= 2 { writeln!(out, "F").unwrap(); return; } } writeln!(out, "T").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::*; #[macro_export] 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| { if 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()) .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| { if 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()) .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(); }; } #[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(); 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<_>>() } } }