結果
問題 | No.1701 half price |
ユーザー | manta1130 |
提出日時 | 2021-11-04 14:18:28 |
言語 | Rust (1.77.0 + proconio) |
結果 |
AC
|
実行時間 | 109 ms / 3,000 ms |
コード長 | 5,307 bytes |
コンパイル時間 | 12,410 ms |
コンパイル使用メモリ | 377,028 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-10-14 12:24:38 |
合計ジャッジ時間 | 13,809 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 0 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,248 KB |
testcase_02 | AC | 13 ms
5,248 KB |
testcase_03 | AC | 0 ms
5,248 KB |
testcase_04 | AC | 12 ms
5,248 KB |
testcase_05 | AC | 1 ms
5,248 KB |
testcase_06 | AC | 106 ms
5,248 KB |
testcase_07 | AC | 109 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 | 1 ms
5,248 KB |
testcase_13 | AC | 1 ms
5,248 KB |
testcase_14 | AC | 1 ms
5,248 KB |
testcase_15 | AC | 1 ms
5,248 KB |
testcase_16 | AC | 0 ms
5,248 KB |
testcase_17 | AC | 42 ms
5,248 KB |
testcase_18 | AC | 1 ms
5,248 KB |
testcase_19 | AC | 2 ms
5,248 KB |
testcase_20 | AC | 1 ms
5,248 KB |
testcase_21 | AC | 109 ms
5,248 KB |
コンパイルメッセージ
warning: unused variable: `n` --> src/main.rs:11:9 | 11 | n:usize,w:i64 | ^ | help: `n` is captured in macro and introduced a unused variable --> src/main.rs:69:17 | 10 | / inputv! { 11 | | n:usize,w:i64 12 | | } | |_____- in this macro invocation ... 69 | 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)
ソースコード
#[allow(unused_imports)] use std::io::{stdout, BufWriter, Write}; use std::collections::HashSet; fn main() { let out = stdout(); let mut out = BufWriter::new(out.lock()); inputv! { n:usize,w:i64 } let a = input_vector::<i64>(); let mut set = HashSet::new(); let mut ans = 0; for mut i in 0..3_usize.pow(a.len() as u32) { let mut buf = 0; let mut k = 0; for j in 0..a.len() { if i % 3 == 1 { buf += a[j]; k = (k << 1) + 1; } else if i % 3 == 2 { buf += a[j] / 2; k = (k << 1) + 1; } else { k <<= 1; } i /= 3; } if buf == w && !set.contains(&k) && k != 0 { ans += 1; set.insert(k); } } writeln!(out, "{}", ans).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| { 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(); }; } 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(); 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<_>>() } } }