Problem:
Score : 600 points

Problem Statement

Given are two sequences A and B, both of length N.
A and B are each sorted in the ascending order.
Check if it is possible to reorder the terms of B so that for each i (1 \leq i \leq N) A_i \neq B_i holds, and if it is possible, output any of the reorderings that achieve it.

Constraints

1\leq N \leq 2 \times 10^5

1\leq A_i,B_i \leq N

A and B are each sorted in the ascending order.

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
A_1 A_2 \cdots A_N
B_1 B_2 \cdots B_N

Output

If there exist no reorderings that satisfy the condition, print No.

If there exists a reordering that satisfies the condition, print Yes on the first line.
After that, print a reordering of B on the second line, separating terms with a whitespace.

If there are multiple reorderings that satisfy the condition, you can print any of them.

Sample Input 1

6
1 1 1 2 2 3
1 1 1 2 2 3

Sample Output 1

Yes
2 2 3 1 1 1

Sample Input 2

3
1 1 2
1 1 3

Sample Output 2

No

Sample Input 3

4
1 1 2 3
1 2 3 3

Sample Output 3

Yes
3 3 1 2

Solution in Rust (1.42.0) (judge verdict: Wrong Answer)

use input_mcr::*;
use std::cmp::*;

use group::*;
use std::collections::BinaryHeap;
use std::collections::VecDeque;

fn main() {
    input! {
        n: usize,
        xs: [i64; n],
        ys: [i64; n],
    }

    let mut xs_g = group(&xs);
    let mut ys_g = group(&ys);

    let mut min = n as i64 - 1;
    let mut max = -(n as i64) + 1;

    let mut i = 0;
    let mut k = 0;
    loop {
        if i >= n {
            break;
        }
        if k >= n {
            break;
        }
        if xs[i] == ys[k] {
            let i_l = i;
            let k_l = k;
            while i + 1 < n && xs[i] == xs[i + 1] {
                i += 1;
            }
            while k + 1 < n && ys[k] == ys[k + 1] {
                k += 1;
            }
            let i_u = i;
            let k_u = k;
            max = std::cmp::max(max, i_u as i64 - k_l as i64);
            min = std::cmp::min(min, i_l as i64 - k_u as i64);
            i += 1;
            k += 1;
        } else if xs[i] > ys[k] {
            k += 1;
        } else if xs[i] < ys[k] {
            i += 1;
        }
    }
    // eprintln!("min = {}, max = {}", min, max);
    let shift = -min + 1;
    let shift = std::cmp::max(0, shift);
    if shift >= n as i64 {
        println!("No");
    }
    let mut res = vec![];
    for &y in &ys[shift as usize..] {
        res.push(y);
    }
    for &y in &ys[..shift as usize] {
        res.push(y);
    }
    let mut ok = true;
    for i in 0..n {
        if xs[i] == res[i] {
            ok = false;
        }
    }
    if !ok {
        println!("No");
        return;
    }

    println!("Yes");
    for &r in &res {
        print!("{} ", r);
    }
    println!();
}
pub mod input_mcr {
    // ref: tanakh <https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8>
    #[macro_export(local_inner_macros)]
    macro_rules! input {
        (source = $s:expr, $($r:tt)*) => {
            let mut parser = Parser::from_str($s);
            input_inner!{parser, $($r)*}
        };
        (parser = $parser:ident, $($r:tt)*) => {
            input_inner!{$parser, $($r)*}
        };
        (new_stdin_parser = $parser:ident, $($r:tt)*) => {
            let stdin = std::io::stdin();
            let reader = std::io::BufReader::new(stdin.lock());
            let mut $parser = Parser::new(reader);
            input_inner!{$parser, $($r)*}
        };
        ($($r:tt)*) => {
            input!{new_stdin_parser = parser, $($r)*}
        };
    }

    #[macro_export(local_inner_macros)]
    macro_rules! input_inner {
        ($parser:ident) => {};
        ($parser:ident, ) => {};
        ($parser:ident, $var:ident : $t:tt $($r:tt)*) => {
            let $var = read_value!($parser, $t);
            input_inner!{$parser $($r)*}
        };
    }

    #[macro_export(local_inner_macros)]
    macro_rules! read_value {
        ($parser:ident, ( $($t:tt),* )) => {
            ( $(read_value!($parser, $t)),* )
        };
        ($parser:ident, [ $t:tt ; $len:expr ]) => {
            (0..$len).map(|_| read_value!($parser, $t)).collect::<Vec<_>>()
        };
        ($parser:ident, chars) => {
            read_value!($parser, String).chars().collect::<Vec<char>>()
        };
        ($parser:ident, char_) => {
            read_value!($parser, String).chars().collect::<Vec<char>>()[0]
        };
        ($parser:ident, usize1) => {
            read_value!($parser, usize) - 1
        };
        ($parser:ident, line) => {
            $parser.next_line()
        };
        ($parser:ident, line_) => {
            $parser.next_line().chars().collect::<Vec<char>>()
        };
        ($parser:ident, $t:ty) => {
            $parser.next::<$t>().expect("Parse error")
        };
    }

    use std::collections::VecDeque;
    use std::io;
    use std::io::BufRead;
    use std::str;

    pub struct Parser<R> {
        pub reader: R,
        buf: VecDeque<u8>,
        parse_buf: Vec<u8>,
    }

    impl Parser<io::Empty> {
        pub fn from_str(s: &str) -> Parser<io::Empty> {
            Parser {
                reader: io::empty(),
                buf: VecDeque::from(s.as_bytes().to_vec()),
                parse_buf: vec![],
            }
        }
    }

    impl<R: BufRead> Parser<R> {
        pub fn new(reader: R) -> Parser<R> {
            Parser {
                reader: reader,
                buf: VecDeque::new(),
                parse_buf: vec![],
            }
        }
        pub fn update_buf(&mut self) {
            loop {
                let (len, complete) = {
                    let buf2 = self.reader.fill_buf().unwrap();
                    self.buf.extend(buf2.iter());
                    let len = buf2.len();
                    (len, buf2.last() < Some(&0x20))
                };
                self.reader.consume(len);
                if complete {
                    break;
                }
            }
        }
        pub fn next<T: str::FromStr>(&mut self) -> Result<T, T::Err> {
            loop {
                while let Some(c) = self.buf.pop_front() {
                    if c > 0x20 {
                        self.buf.push_front(c);
                        break;
                    }
                }
                self.parse_buf.clear();
                while let Some(c) = self.buf.pop_front() {
                    if c <= 0x20 {
                        self.buf.push_front(c);
                        break;
                    } else {
                        self.parse_buf.push(c);
                    }
                }
                if self.parse_buf.is_empty() {
                    self.update_buf();
                } else {
                    return unsafe { str::from_utf8_unchecked(&self.parse_buf) }.parse::<T>();
                }
            }
        }
        pub fn next_line(&mut self) -> String {
            loop {
                while let Some(c) = self.buf.pop_front() {
                    if c >= 0x20 {
                        self.buf.push_front(c);
                        break;
                    }
                }
                self.parse_buf.clear();
                while let Some(c) = self.buf.pop_front() {
                    if c < 0x20 {
                        self.buf.push_front(c);
                        break;
                    } else {
                        self.parse_buf.push(c);
                    }
                }
                if self.parse_buf.is_empty() {
                    self.update_buf();
                } else {
                    return unsafe { str::from_utf8_unchecked(&self.parse_buf) }.to_string();
                }
            }
        }
    }
}
pub mod group {
    pub fn group<T: PartialEq + Eq + Clone + Copy>(xs: &[T]) -> Vec<(T, usize)> {
        let mut res = vec![];
        let n = xs.len();
        for i in 0..n {
            if i == 0 || xs[i - 1] != xs[i] {
                res.push((xs[i], 1));
            } else {
                let m = res.len();
                res[m - 1].1 += 1;
            }
        }
        res
    }

    #[test]
    fn test_group_1() {
        let xs = [1, 2, 2, 3, 3];
        let res = group(&xs);
        assert_eq!(res, [(1, 1), (2, 2), (3, 2)]);
    }

    #[test]
    fn test_split_continuity_2() {
        let xs = [1, 1, 2, 2, 3];
        let res = group(&xs);
        assert_eq!(res, [(1, 2), (2, 2), (3, 1)]);
    }
}