結果

問題 No.675 ドットちゃんたち
ユーザー hatoohatoo
提出日時 2018-04-26 17:43:49
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 40 ms / 2,000 ms
コード長 6,441 bytes
コンパイル時間 14,637 ms
コンパイル使用メモリ 377,300 KB
実行使用メモリ 9,728 KB
最終ジャッジ日時 2024-06-27 21:12:27
合計ジャッジ時間 16,832 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 1 ms
5,248 KB
testcase_02 AC 1 ms
5,248 KB
testcase_03 AC 1 ms
5,376 KB
testcase_04 AC 1 ms
5,376 KB
testcase_05 AC 29 ms
9,728 KB
testcase_06 AC 38 ms
9,728 KB
testcase_07 AC 34 ms
8,960 KB
testcase_08 AC 36 ms
9,728 KB
testcase_09 AC 39 ms
9,728 KB
testcase_10 AC 40 ms
9,728 KB
testcase_11 AC 37 ms
9,728 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

/**
*  _           _                 __                            _   _ _   _                                 _                    _                  _
* | |         | |               / /                           | | (_) | (_)                               | |                  (_)                | |
* | |__   __ _| |_ ___   ___   / /__ ___  _ __ ___  _ __   ___| |_ _| |_ ___   _____ ______ _ __ _   _ ___| |_ ______ ___ _ __  _ _ __  _ __   ___| |_ ___
* | '_ \ / _` | __/ _ \ / _ \ / / __/ _ \| '_ ` _ \| '_ \ / _ \ __| | __| \ \ / / _ \______| '__| | | / __| __|______/ __| '_ \| | '_ \| '_ \ / _ \ __/ __|
* | | | | (_| | || (_) | (_) / / (_| (_) | | | | | | |_) |  __/ |_| | |_| |\ V /  __/      | |  | |_| \__ \ |_       \__ \ | | | | |_) | |_) |  __/ |_\__ \
* |_| |_|\__,_|\__\___/ \___/_/ \___\___/|_| |_| |_| .__/ \___|\__|_|\__|_| \_/ \___|      |_|   \__,_|___/\__|      |___/_| |_|_| .__/| .__/ \___|\__|___/
*                                                  | |                                                                           | |   | |
*                                                  |_|                                                                           |_|   |_|
*
* https://github.com/hatoo/competitive-rust-snippets
*/
#[allow(unused_imports)]
use std::cmp::{max, min, Ordering};
#[allow(unused_imports)]
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};
#[allow(unused_imports)]
use std::io::{stdin, stdout, BufWriter, Write};
#[allow(unused_imports)]
use std::iter::FromIterator;
mod util {
    use std::fmt::Debug;
    use std::io::{stdin, stdout, BufWriter, StdoutLock};
    use std::str::FromStr;
    #[allow(dead_code)]
    pub fn line() -> String {
        let mut line: String = String::new();
        stdin().read_line(&mut line).unwrap();
        line.trim().to_string()
    }
    #[allow(dead_code)]
    pub fn chars() -> Vec<char> {
        line().chars().collect()
    }
    #[allow(dead_code)]
    pub fn gets<T: FromStr>() -> Vec<T>
    where
        <T as FromStr>::Err: Debug,
    {
        let mut line: String = String::new();
        stdin().read_line(&mut line).unwrap();
        line.split_whitespace()
            .map(|t| t.parse().unwrap())
            .collect()
    }
    #[allow(dead_code)]
    pub fn with_bufwriter<F: FnOnce(BufWriter<StdoutLock>) -> ()>(f: F) {
        let out = stdout();
        let writer = BufWriter::new(out.lock());
        f(writer)
    }
}
#[allow(unused_macros)]
macro_rules ! get { ( $ t : ty ) => { { let mut line : String = String :: new ( ) ; stdin ( ) . read_line ( & mut line ) . unwrap ( ) ; line . trim ( ) . parse ::<$ t > ( ) . unwrap ( ) } } ; ( $ ( $ t : ty ) ,* ) => { { let mut line : String = String :: new ( ) ; stdin ( ) . read_line ( & mut line ) . unwrap ( ) ; let mut iter = line . split_whitespace ( ) ; ( $ ( iter . next ( ) . unwrap ( ) . parse ::<$ t > ( ) . unwrap ( ) , ) * ) } } ; ( $ t : ty ; $ n : expr ) => { ( 0 ..$ n ) . map ( | _ | get ! ( $ t ) ) . collect ::< Vec < _ >> ( ) } ; ( $ ( $ t : ty ) ,*; $ n : expr ) => { ( 0 ..$ n ) . map ( | _ | get ! ( $ ( $ t ) ,* ) ) . collect ::< Vec < _ >> ( ) } ; ( $ t : ty ;; ) => { { let mut line : String = String :: new ( ) ; stdin ( ) . read_line ( & mut line ) . unwrap ( ) ; line . split_whitespace ( ) . map ( | t | t . parse ::<$ t > ( ) . unwrap ( ) ) . collect ::< Vec < _ >> ( ) } } ; ( $ t : ty ;; $ n : expr ) => { ( 0 ..$ n ) . map ( | _ | get ! ( $ t ;; ) ) . collect ::< Vec < _ >> ( ) } ; }
#[allow(unused_macros)]
macro_rules ! debug { ( $ ( $ a : expr ) ,* ) => { eprintln ! ( concat ! ( $ ( stringify ! ( $ a ) , " = {:?}, " ) ,* ) , $ ( $ a ) ,* ) ; } }
const BIG_STACK_SIZE: bool = true;
#[allow(dead_code)]
fn main() {
    use std::thread;
    if BIG_STACK_SIZE {
        thread::Builder::new()
            .stack_size(32 * 1024 * 1024)
            .name("solve".into())
            .spawn(solve)
            .unwrap()
            .join()
            .unwrap();
    } else {
        solve();
    }
}
fn solve() {
    let (n, px, py) = get!(usize, i64, i64);
    let commands: Vec<String> = (0..n).map(|_| util::line()).collect();
    let mut ans = Vec::new();

    let mut x = 0;
    let mut y = 0;
    let mut r = 0;
    for com in &commands {
        let mut iter = com.split_whitespace();

        match iter.next() {
            Some("1") => {
                let dx: i64 = iter.next().unwrap().parse().unwrap();
                x += dx;
            }
            Some("2") => {
                let dy: i64 = iter.next().unwrap().parse().unwrap();
                y += dy;
            }
            Some("3") => {
                let t = x;
                x = y;
                y = -t;
                r = (r + 1) % 4;
            }
            _ => unreachable!(),
        }
    }

    for com in &commands {
        let mut iter = com.split_whitespace();
        ans.push((x, y, r));

        match iter.next() {
            Some("1") => {
                let dx: i64 = iter.next().unwrap().parse().unwrap();
                match r {
                    0 => {
                        x -= dx;
                    }
                    1 => {
                        y += dx;
                    }
                    2 => {
                        x += dx;
                    }
                    3 => {
                        y -= dx;
                    }
                    _ => unreachable!(),
                }
            }
            Some("2") => {
                let dy: i64 = iter.next().unwrap().parse().unwrap();
                match r {
                    0 => {
                        y -= dy;
                    }
                    1 => {
                        x -= dy;
                    }
                    2 => {
                        y += dy;
                    }
                    3 => {
                        x += dy;
                    }
                    _ => unreachable!(),
                }
            }
            Some("3") => {
                r = (r + 4 - 1) % 4;
            }
            _ => unreachable!(),
        }
    }

    util::with_bufwriter(|mut out| {
        for (x, y, r) in ans {
            let (mut xx, mut yy) = (px, py);
            for _ in 0..r {
                let t = xx;
                xx = yy;
                yy = -t;
            }
            writeln!(out, "{} {}", x + xx, y + yy).unwrap();
        }
    });
}
0