#361599 (Rust) No.429 CupShuffle

• 問題: No.429 CupShuffle
• ユーザー: guricerin
• 提出日時: 2019-07-24 13:31:39
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 40 ms / 2,000 ms
• コード長: 3,663 bytes
• コンパイル時間: 13,628 ms
• コンパイル使用メモリ: 379,068 KB
• 実行使用メモリ: 14,464 KB
• 最終ジャッジ日時: 2024-06-28 01:44:01
• 合計ジャッジ時間: 13,826 ms
• ジャッジサーバーID （参考情報）: judge5 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	1 ms; 5,248 KB
testcase_02	AC	1 ms; 5,376 KB
testcase_03	AC	1 ms; 5,376 KB
testcase_04	AC	1 ms; 5,376 KB
testcase_05	AC	0 ms; 5,376 KB
testcase_06	AC	1 ms; 5,376 KB
testcase_07	AC	1 ms; 5,376 KB
testcase_08	AC	1 ms; 5,376 KB
testcase_09	AC	1 ms; 5,376 KB
testcase_10	AC	4 ms; 5,376 KB
testcase_11	AC	40 ms; 14,208 KB
testcase_12	AC	37 ms; 14,336 KB
testcase_13	AC	39 ms; 14,464 KB
testcase_14	AC	38 ms; 14,336 KB
testcase_15	AC	1 ms; 5,376 KB

ソースコード

// Original: https://github.com/tanakh/competitive-rs
#[allow(unused_macros)]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        let mut next = || { iter.next().unwrap() };
        input_inner!{next, $($r)*}
    };
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes
                .by_ref()
                .map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };

    ($next:expr, mut $var:ident : $t:tt $($r:tt)*) => {
        let mut $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, [ $t:tt ]) => {
        {
            let len = read_value!($next, usize);
            (0..len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
        }
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, bytes) => {
        read_value!($next, String).into_bytes()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}

mod util {
    #[allow(dead_code)]
    pub fn chmin<T>(x: &mut T, y: T) -> bool
    where
        T: PartialOrd + Copy,
    {
        *x > y && {
            *x = y;
            true
        }
    }

    #[allow(dead_code)]
    pub fn chmax<T>(x: &mut T, y: T) -> bool
    where
        T: PartialOrd + Copy,
    {
        *x < y && {
            *x = y;
            true
        }
    }

    /// 整数除算切り上げ
    #[allow(dead_code)]
    pub fn roundup(a: i64, b: i64) -> i64 {
        (a + b - 1) / b
    }

    #[allow(dead_code)]
    pub fn ctoi(c: char) -> i64 {
        c as i64 - 48
    }
}

#[allow(unused_imports)]
use util::*;

#[allow(unused_imports)]
use std::cmp::{max, min};
#[allow(unused_imports)]
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, VecDeque};

fn main() {
    input! {
        n:usize,
        k:usize,
        x:usize1,
        ab:[(String,String);k],
        mut cs:[usize;n]
    }

    let f = |x:&str| -> i64 {x.parse().unwrap()};

    let mut ls = (1..n + 1).collect::<Vec<usize>>();
    for (a, b) in ab[0..x].iter() {
        let a = f(a) - 1;
        let b = f(b) - 1;
        ls.swap(a as usize, b as usize);
    }

    for (a, b) in ab[x + 1..].iter().rev() {
        let a = f(a) - 1;
        let b = f(b) - 1;
        cs.swap(a as usize, b as usize);
    }

    let mut ans = vec![0usize; 2];
    let mut ptr = 0;
    for i in 0..n {
        if ptr > 2 {
            panic!();
        }
        if ls[i] != cs[i] {
            ans[ptr] = i + 1;
            ptr += 1;
        }
    }

    // for (i, &v) in ls.iter().enumerate() {
    //     print!("{}", v);
    //     if i < ls.len() - 1 {
    //         print!(" ");
    //     }
    // }
    println!("{} {}", ans[0], ans[1]);
}