Technocup 2019 - Elimination Round 2
B
Curiosity Has No Limits
Codeforces
1500
原题
← AC →
翻译中…

When Masha came to math classes today, she saw two integer sequences of length $n - 1$ on the blackboard. Let's denote the elements of the first sequence as $a_i$ ($0 \le a_i \le 3$), and the elements of the second sequence as $b_i$ ($0 \le b_i \le 3$).

翻译中…

Masha became interested if or not there is an integer sequence of length $n$, which elements we will denote as $t_i$ ($0 \le t_i \le 3$), so that for every $i$ ($1 \le i \le n - 1$) the following is true:

翻译中…
翻译中…

The question appeared to be too difficult for Masha, so now she asked you to check whether such a sequence $t_i$ of length $n$ exists. If it exists, find such a sequence. If there are multiple such sequences, find any of them.

翻译中…

Input

翻译中…

The first line contains a single integer $n$ ($2 \le n \le 10^5$) — the length of the sequence $t_i$.

翻译中…

The second line contains $n - 1$ integers $a_1, a_2, \ldots, a_{n-1}$ ($0 \le a_i \le 3$) — the first sequence on the blackboard.

翻译中…

The third line contains $n - 1$ integers $b_1, b_2, \ldots, b_{n-1}$ ($0 \le b_i \le 3$) — the second sequence on the blackboard.

翻译中…

Output

翻译中…

In the first line print "YES" (without quotes), if there is a sequence $t_i$ that satisfies the conditions from the statements, and "NO" (without quotes), if there is no such sequence.

翻译中…

If there is such a sequence, on the second line print $n$ integers $t_1, t_2, \ldots, t_n$ ($0 \le t_i \le 3$) — the sequence that satisfies the statements conditions.

翻译中…

If there are multiple answers, print any of them.

翻译中…

Note

翻译中…

In the first example it's easy to see that the sequence from output satisfies the given conditions:

翻译中…
  • $t_1 | t_2 = (01_2) | (11_2) = (11_2) = 3 = a_1$ and $t_1 \& t_2 = (01_2) \& (11_2) = (01_2) = 1 = b_1$;
  • $t_2 | t_3 = (11_2) | (10_2) = (11_2) = 3 = a_2$ and $t_2 \& t_3 = (11_2) \& (10_2) = (10_2) = 2 = b_2$;
  • $t_3 | t_4 = (10_2) | (00_2) = (10_2) = 2 = a_3$ and $t_3 \& t_4 = (10_2) \& (00_2) = (00_2) = 0 = b_3$.
翻译中…

In the second example there is no such sequence.

翻译中…

样例

Input #1
4
3 3 2
1 2 0
Output #1
YES
1 3 2 0
InputCopy OutputCopy
Input #2
3
1 3
3 2
Output #2
NO
InputCopy OutputCopy
题目信息
题号
1031B
时间限制
1 s
内存限制
256 MB

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。