結果
| 問題 | No.365 ジェンガソート | 
| コンテスト | |
| ユーザー |  | 
| 提出日時 | 2019-05-02 22:02:01 | 
| 言語 | Rust (1.83.0 + proconio) | 
| 結果 | 
                                WA
                                 
                             | 
| 実行時間 | - | 
| コード長 | 3,146 bytes | 
| コンパイル時間 | 13,422 ms | 
| コンパイル使用メモリ | 403,172 KB | 
| 実行使用メモリ | 6,824 KB | 
| 最終ジャッジ日時 | 2024-12-31 13:42:32 | 
| 合計ジャッジ時間 | 14,245 ms | 
| ジャッジサーバーID (参考情報) | judge2 / judge1 | 
(要ログイン)
| ファイルパターン | 結果 | 
|---|---|
| other | WA * 41 | 
コンパイルメッセージ
warning: unused `Result` that must be used
   --> src/main.rs:127:5
    |
127 |     write!(writer, "{}", n_retrogrades);
    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
    |
    = 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 `write` (in Nightly builds, run with -Z macro-backtrace for more info)
            
            ソースコード
use std::io;
use std::io::{BufRead, Write};
use std::cmp::max;
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")
        }
    };
}
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,
        n: usize,
        a: [usize; n]
    }
    let mut max_retrograde = 0;
    let mut milestone = 0;
    for i in 0..n {
        if milestone >= a[i] {
            max_retrograde = max(max_retrograde, a[i])
        } else {
            milestone = a[i];
        }
    }
    println!("{}", max_retrograde);
    let mut n_retrogrades = 0;
    let mut milestone = 0;
    for i in 0..n {
        if milestone >= a[i] {
            n_retrogrades += 1;
        } else {
            milestone = a[i];
            if a[i] < max_retrograde {
                n_retrogrades += 1;
            }
        }
    }
    write!(writer, "{}", n_retrogrades);
}
#[cfg(test)]
mod tests {
    use super::*;
    #[test]
    fn sample1() {
        assert_judge!(process,
"
5
3 1 4 2 5
"
, "2");
    }
    #[test]
    fn sample2() {
        assert_judge!(process,
"
4
4 3 2 1
"
, "3");
    }
    #[test]
    fn sample3() {
        assert_judge!(process,
"
4
1 2 3 4
"
, "0");
    }
}
            
            
            
        