結果

問題 No.1935 Water Simulation
ユーザー cympfhcympfh
提出日時 2022-05-15 18:58:33
言語 Rust
(1.77.0)
結果
AC  
実行時間 1 ms / 2,000 ms
コード長 4,326 bytes
コンパイル時間 938 ms
コンパイル使用メモリ 153,204 KB
実行使用メモリ 4,372 KB
最終ジャッジ日時 2023-10-11 05:03:24
合計ジャッジ時間 3,075 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,348 KB
testcase_01 AC 1 ms
4,356 KB
testcase_02 AC 1 ms
4,348 KB
testcase_03 AC 1 ms
4,352 KB
testcase_04 AC 1 ms
4,352 KB
testcase_05 AC 1 ms
4,352 KB
testcase_06 AC 1 ms
4,352 KB
testcase_07 AC 1 ms
4,352 KB
testcase_08 AC 1 ms
4,372 KB
testcase_09 AC 1 ms
4,352 KB
testcase_10 AC 1 ms
4,352 KB
testcase_11 AC 1 ms
4,348 KB
testcase_12 AC 1 ms
4,348 KB
testcase_13 AC 1 ms
4,352 KB
testcase_14 AC 1 ms
4,348 KB
testcase_15 AC 1 ms
4,348 KB
testcase_16 AC 1 ms
4,356 KB
testcase_17 AC 1 ms
4,348 KB
testcase_18 AC 1 ms
4,352 KB
testcase_19 AC 1 ms
4,352 KB
testcase_20 AC 1 ms
4,348 KB
testcase_21 AC 1 ms
4,348 KB
testcase_22 AC 1 ms
4,348 KB
testcase_23 AC 1 ms
4,356 KB
testcase_24 AC 1 ms
4,352 KB
testcase_25 AC 1 ms
4,352 KB
testcase_26 AC 1 ms
4,348 KB
testcase_27 AC 1 ms
4,348 KB
testcase_28 AC 1 ms
4,348 KB
testcase_29 AC 1 ms
4,352 KB
testcase_30 AC 1 ms
4,352 KB
testcase_31 AC 1 ms
4,368 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#![allow(unused_imports, unused_macros, dead_code)]
use std::{cmp::*, collections::*};

fn main() {
    let mut sc = Scanner::new();
    let a: i64 = sc.cin();
    let b: i64 = sc.cin();
    let c: i64 = sc.cin();
    let d: i64 = sc.cin();
    let n: u64 = sc.cin();

    type State = ((i64, i64, i64, i64), (i64, i64, i64, i64), usize);
    let initial_state: State = ((a, b, c, d), (a, 0, 0, 0), 0);
    let step = |((a, b, c, d), (s, t, u, v), clock): State| {
        let clock2 = (clock + 1) % 4;
        if clock == 0 {
            let m = min!(s, b - t);
            ((a, b, c, d), (s - m, t + m, u, v), clock2)
        } else if clock == 1 {
            let m = min!(t, c - u);
            ((a, b, c, d), (s, t - m, u + m, v), clock2)
        } else if clock == 2 {
            let m = min!(u, d - v);
            ((a, b, c, d), (s, t, u - m, v + m), clock2)
        } else {
            let m = min!(v, a - s);
            ((a, b, c, d), (s + m, t, u, v - m), clock2)
        }
    };
    let (lambda, mu) = rho(initial_state, step);
    trace!(lambda, mu);

    let t = if n <= lambda {
        n
    } else {
        lambda + (n - lambda) % mu
    };
    let mut state = initial_state;
    for _ in 0..t {
        state = step(state);
    }
    trace!(state);

    put!(state.1 .0, state.1 .1, state.1 .2, state.1 .3);
}

// @algorithm/rho
/// Returns (lambda, mu), Steps before Loop, Length of Loop
pub fn rho<X: Eq + Copy + std::fmt::Debug, F: Fn(X) -> X>(initial_state: X, step: F) -> (u64, u64) {
    let mut x1 = initial_state;
    let mut x2 = initial_state;
    loop {
        x1 = step(x1);
        x2 = step(x2);
        x2 = step(x2);
        if x1 == x2 {
            break;
        }
    }
    let mut lambda = 0;
    let mut x2 = initial_state;
    while x1 != x2 {
        lambda += 1;
        x1 = step(x1);
        x2 = step(x2);
    }
    let mut mu = 0;
    while mu == 0 || x1 != x2 {
        mu += 1;
        x1 = step(x1);
        x2 = step(x2);
        x2 = step(x2);
    }
    (lambda, mu)
}

// {{{
use std::io::{self, Write};
use std::str::FromStr;

pub struct Scanner {
    stdin: io::Stdin,
    buffer: VecDeque<String>,
}
impl Scanner {
    pub fn new() -> Self {
        Self {
            stdin: io::stdin(),
            buffer: VecDeque::new(),
        }
    }
    pub fn cin<T: FromStr>(&mut self) -> T {
        while self.buffer.is_empty() {
            let mut line = String::new();
            let _ = self.stdin.read_line(&mut line);
            for w in line.split_whitespace() {
                self.buffer.push_back(String::from(w));
            }
        }
        self.buffer.pop_front().unwrap().parse::<T>().ok().unwrap()
    }
    pub fn usize1(&mut self) -> usize {
        self.cin::<usize>() - 1
    }
    pub fn chars(&mut self) -> Vec<char> {
        self.cin::<String>().chars().collect()
    }
    pub fn vec<T: FromStr>(&mut self, n: usize) -> Vec<T> {
        (0..n).map(|_| self.cin()).collect()
    }
}
fn flush() {
    std::io::stdout().flush().unwrap();
}
#[macro_export]
macro_rules! min {
    (.. $x:expr) => {{
        let mut it = $x.iter();
        it.next().map(|z| it.fold(z, |x, y| min!(x, y)))
    }};
    ($x:expr) => ($x);
    ($x:expr, $($ys:expr),*) => {{
        let t = min!($($ys),*);
        if $x < t { $x } else { t }
    }}
}
#[macro_export]
macro_rules! max {
    (.. $x:expr) => {{
        let mut it = $x.iter();
        it.next().map(|z| it.fold(z, |x, y| max!(x, y)))
    }};
    ($x:expr) => ($x);
    ($x:expr, $($ys:expr),*) => {{
        let t = max!($($ys),*);
        if $x > t { $x } else { t }
    }}
}
#[macro_export]
macro_rules! trace {
    ($x:expr) => {
        #[cfg(debug_assertions)]
        eprintln!(">>> {} = {:?}", stringify!($x), $x)
    };
    ($($xs:expr),*) => { trace!(($($xs),*)) }
}
#[macro_export]
macro_rules! put {
    (.. $x:expr) => {{
        let mut it = $x.iter();
        if let Some(x) = it.next() { print!("{}", x); }
        for x in it { print!(" {}", x); }
        println!("");
    }};
    ($x:expr) => { println!("{}", $x) };
    ($x:expr, $($xs:expr),*) => { print!("{} ", $x); put!($($xs),*) }
}
#[macro_export]
macro_rules! ndarray {
    ($x:expr;) => {
        $x
    };
    ($x:expr; $size:expr $( , $rest:expr )*) => {
        vec![ndarray!($x; $($rest),*); $size]
    };
}

// }}}
0