結果
問題 | No.250 atetubouのzetubou |
ユーザー | MasuqaT |
提出日時 | 2019-07-28 00:38:55 |
言語 | Rust (1.77.0 + proconio) |
結果 |
AC
|
実行時間 | 15 ms / 5,000 ms |
コード長 | 5,109 bytes |
コンパイル時間 | 11,698 ms |
コンパイル使用メモリ | 405,216 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-07-02 14:53:31 |
合計ジャッジ時間 | 12,985 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 9 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 13 ms
5,376 KB |
testcase_03 | AC | 14 ms
5,376 KB |
testcase_04 | AC | 13 ms
5,376 KB |
testcase_05 | AC | 13 ms
5,376 KB |
testcase_06 | AC | 10 ms
5,376 KB |
testcase_07 | AC | 5 ms
5,376 KB |
testcase_08 | AC | 12 ms
5,376 KB |
testcase_09 | AC | 9 ms
5,376 KB |
testcase_10 | AC | 13 ms
5,376 KB |
testcase_11 | AC | 8 ms
5,376 KB |
testcase_12 | AC | 12 ms
5,376 KB |
testcase_13 | AC | 7 ms
5,376 KB |
testcase_14 | AC | 1 ms
5,376 KB |
testcase_15 | AC | 15 ms
5,376 KB |
testcase_16 | AC | 14 ms
5,376 KB |
testcase_17 | AC | 15 ms
5,376 KB |
testcase_18 | AC | 15 ms
5,376 KB |
testcase_19 | AC | 15 ms
5,376 KB |
testcase_20 | AC | 1 ms
5,376 KB |
testcase_21 | AC | 1 ms
5,376 KB |
コンパイルメッセージ
warning: unused `Result` that must be used --> src/main.rs:201:9 | 201 | writeln!(writer, "{}", if passed { "AC" } else { "ZETUBOU" }); | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ | = note: this `Result` may be an `Err` variant, which should be handled = note: `#[warn(unused_must_use)]` on by default = note: this warning originates in the macro `writeln` (in Nightly builds, run with -Z macro-backtrace for more info)
ソースコード
// Macro by MasuqaT (occar421) // https://github.com/occar421/ProgrammingContest/tree/master/templates/src/standard_io.rs use std::io; use std::io::{BufRead, Write}; use std::ops::{Div, Mul, Rem}; macro_rules! input { (source = $s:expr, $($r:tt)*) => { let mut iter = $s.split_whitespace(); input_inner!{iter, $($r)*} }; (stdin = $s:expr, $($r:tt)*) => { let s = { let mut s = String::new(); $s.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") }; } #[allow(unused_macros)] macro_rules! assert_judge { ($method:ident, $input:expr, $expected:expr) => {{ let input = $input.as_bytes(); let mut output = Vec::new(); $method(&input[..], &mut output); let output = String::from_utf8(output).expect("Not UTF-8"); assert_eq!($expected, output); }}; } #[allow(unused_macros)] macro_rules! assert_judge_with_output { ($method:ident, $input:expr) => {{ let input = $input.as_bytes(); let mut output = Vec::new(); $method(&input[..], &mut output); String::from_utf8(output).expect("Not UTF-8") }}; } #[allow(unused_macros)] macro_rules! assert_eq_with_error { ($left:expr, $right:expr, $precision:expr) => {{ match (&$left, &$right, &$precision) { (left_val, right_val, precision_val) => { if !(*left_val - *precision_val < *right_val && *right_val < *left_val + *precision_val) { // The reborrows below are intentional. Without them, the stack slot for the // borrow is initialized even before the values are compared, leading to a // noticeable slow down. panic!( r#"assertion failed: `(left == right) +- precision` left: `{:?}`, right: `{:?}`, precision: `{:?}`"#, &*left_val, &*right_val, &*precision_val ) } } } }}; } trait GenericInteger: Copy + PartialEq + Rem<Output = Self> + Div<Output = Self> + Mul<Output = Self> { fn zero() -> Self; } macro_rules! dec_gi { () => {}; ($t:ty $(, $r:ty)*) => { impl GenericInteger for $t { #[inline] fn zero() -> Self { 0 } } dec_gi![ $( $r ),* ]; }; } dec_gi![u8, u16, u32, u64, u128, usize, i8, i16, i32, i64, i128, isize]; #[allow(dead_code)] fn gcd<T>(a: T, b: T) -> T where T: GenericInteger, { if b == T::zero() { a } else { gcd(b, a % b) } } #[allow(dead_code)] fn lcm<T>(a: T, b: T) -> T where T: GenericInteger, { a / gcd(a, b) * b } #[allow(unused_macros)] macro_rules! swap { ($v1:expr, $v2:expr) => { let buf = $v1; $v1 = $v2; $v2 = buf; }; } fn main() { let stdio = io::stdin(); let input = stdio.lock(); let output = io::stdout(); process(input, output); } fn process<R, W>(mut reader: R, mut writer: W) -> () where R: BufRead, W: Write, { input! { stdin = reader, q: usize, dxt: [(usize, usize, usize); q] } fn le_combinations2(n: u128, k: u128, max: u128) -> bool { if k > n { return 1 <= max; } let k = if n - k < k { n - k } else { k }; let mut value = 1u128; // from small numbers for d in (0..k).rev() { value *= n - d; value /= k - d; if value > max { return false; } } return value <= max; } for (d, x, t) in dxt { let n = x + d - 1; // (x+1 d-1 -1) let k = d - 1; let passed = le_combinations2(n as u128, k as u128, t as u128); writeln!(writer, "{}", if passed { "AC" } else { "ZETUBOU" }); } } #[cfg(test)] mod tests { use super::*; #[test] fn sample1() { assert_judge!( process, " 3 1 3 1 2 4 50 3 3 9 ", "\ AC AC ZETUBOU " ); } #[test] fn sample2() { assert_judge!( process, " 3 58 62 1000 12 34 56 987 65 1234 ", "\ ZETUBOU ZETUBOU ZETUBOU " ); } }