Submission #29757195

---

Source Code Expand

use itertools::Itertools;
use proconio::input;
use std::collections::HashMap;

fn main() {
    input! {
        n: usize,
        mut a: [usize; n],
        mut b: [usize; n],
    }
    let mut a_counter = HashMap::new();
    let mut b_counter = HashMap::new();
    for i in 0..n {
        *a_counter.entry(a[i]).or_insert(0) += 1;
        *b_counter.entry(b[i]).or_insert(0) += 1;
    }
    if a_counter != b_counter {
        println!("No");
        return;
    }

    //a = a.into_iter().rev().collect_vec();
    while b.len() > 3 {
        let left = a.pop().unwrap();
        match b.iter().position(|x| *x == left) {
            Some(e) => {
                b.remove(e);
                if b.len() % 2 == 1 {
                    let tmp = b[0];
                    b[0] = b[1];
                    b[1] = tmp;
                }
            }
            None => {
                println!("No");
                return;
            }
        };
    }

    //println!("{:?}", a);
    //println!("{:?}", b);
    match a
        .into_iter()
        .join("")
        .to_string()
        .repeat(10)
        .find(&b.into_iter().join(""))
    {
        Some(_) => {
            println!("Yes");
        }
        None => {
            println!("No");
        }
    }
}

Submission Info

Judge Result