#852990 (Rust) No.2254 Reverse Only

• 問題: No.2254 Reverse Only
• ユーザー: koba-e964
• 提出日時: 2023-03-25 10:21:47
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 62 ms / 2,000 ms
• コード長: 3,078 bytes
• コンパイル時間: 14,134 ms
• コンパイル使用メモリ: 380,268 KB
• 実行使用メモリ: 7,392 KB
• 最終ジャッジ日時: 2024-09-18 18:00:21
• 合計ジャッジ時間: 15,742 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	0 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	1 ms; 5,376 KB
testcase_06	AC	1 ms; 5,376 KB
testcase_07	AC	0 ms; 5,376 KB
testcase_08	AC	60 ms; 5,376 KB
testcase_09	AC	35 ms; 7,392 KB
testcase_10	AC	27 ms; 5,376 KB
testcase_11	AC	59 ms; 5,376 KB
testcase_12	AC	60 ms; 5,376 KB
testcase_13	AC	31 ms; 5,376 KB
testcase_14	AC	30 ms; 5,376 KB
testcase_15	AC	31 ms; 5,376 KB
testcase_16	AC	34 ms; 7,296 KB
testcase_17	AC	34 ms; 7,296 KB
testcase_18	AC	62 ms; 5,376 KB
testcase_19	AC	60 ms; 5,376 KB
testcase_20	AC	32 ms; 7,388 KB
testcase_21	AC	32 ms; 7,388 KB
testcase_22	AC	27 ms; 7,392 KB
testcase_23	AC	33 ms; 7,388 KB
testcase_24	AC	29 ms; 7,296 KB
testcase_25	AC	31 ms; 7,296 KB
testcase_26	AC	30 ms; 7,296 KB
testcase_27	AC	2 ms; 5,376 KB
testcase_28	AC	13 ms; 5,376 KB
testcase_29	AC	14 ms; 5,376 KB
testcase_30	AC	25 ms; 5,376 KB
testcase_31	AC	8 ms; 5,376 KB
testcase_32	AC	9 ms; 5,376 KB
testcase_33	AC	4 ms; 5,376 KB
testcase_34	AC	19 ms; 5,376 KB
testcase_35	AC	13 ms; 5,376 KB
testcase_36	AC	52 ms; 5,376 KB
testcase_37	AC	53 ms; 5,376 KB
testcase_38	AC	6 ms; 5,376 KB
testcase_39	AC	47 ms; 5,376 KB
testcase_40	AC	2 ms; 5,376 KB
testcase_41	AC	12 ms; 5,376 KB
testcase_42	AC	7 ms; 5,376 KB
testcase_43	AC	21 ms; 5,376 KB
testcase_44	AC	30 ms; 5,376 KB
testcase_45	AC	36 ms; 5,376 KB
testcase_46	AC	1 ms; 5,376 KB

ソースコード

use std::cmp::*;
// https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    ($($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)*}
    };
}

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)*}
    };
}

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, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };
    ($next:expr, usize1) => (read_value!($next, usize) - 1);
    ($next:expr, [ $t:tt ]) => {{
        let len = read_value!($next, usize);
        read_value!($next, [$t; len])
    }};
    ($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error"));
}

// Ref: https://codeforces.com/contest/1200/submission/58594933
// Verified by: https://codeforces.com/contest/1200/submission/58692231
fn kmp_ff<T: PartialEq>(pat: &[T]) -> Vec<usize> {
    let n = pat.len();
    let mut pi = vec![0; n];
    let mut j = 0;
    for i in 1..n {
        while j > 0 && pat[i] != pat[j] {
            j = pi[j - 1];
        }
        j += usize::from(pat[i] == pat[j]);
        pi[i] = j;
    }
    pi
}

fn calc(k: usize, mut a: Vec<i32>, mut b: Vec<i32>) -> bool {
    let n = a.len();
    if k > n {
        return a == b;
    }
    if k <= n - 2 {
        a.sort();
        b.sort();
        return a == b;
    }
    if k == n {
        let mut brev = b.clone();
        brev.reverse();
        return a == b || a == brev;
    }
    let mut brev = b.clone();
    brev.reverse();
    let mut p = a.clone();
    p.extend_from_slice(&a);
    let ok = |s: &[_], pat: &[_]| {
        let ff = kmp_ff(pat);
        let mut pos = 0;
        for i in 0..s.len() {
            let c = s[i];
            while pos > 0 && (pos >= pat.len() || pat[pos] != c) {
                pos = ff[pos - 1];
            }
            if pat[pos] == c {
                pos += 1;
            }
            if pos == pat.len() {
                return true;
            }
        }
        false
    };
    ok(&p, &b) || ok(&p, &brev)
}

fn main() {
    // In order to avoid potential stack overflow, spawn a new thread.
    let stack_size = 104_857_600; // 100 MB
    let thd = std::thread::Builder::new().stack_size(stack_size);
    thd.spawn(|| solve()).unwrap().join().unwrap();
}

fn solve() {
    input! {
        n: usize, k: usize,
        a: [i32; n],
        b: [i32; n],
    }
    println!("{}", if calc(k, a, b) { "Yes" } else { "No" });
}