CodeForces 635B Island Puzzle（小岛放雕塑，思维）

http://codeforces.com/problemset/problem/635/B

B. Island Puzzle

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

A remote island chain contains n islands, labeled 1 through n. Bidirectional bridges connect the islands to form a simple cycle — a bridge connects islands 1 and 2, islands 2 and 3, and so on, and additionally a bridge connects islands n and 1. The center of each island contains an identical pedestal, and all but one of the islands has a fragile, uniquely colored statue currently held on the pedestal. The remaining island holds only an empty pedestal.

The islanders want to rearrange the statues in a new order. To do this, they repeat the following process: First, they choose an island directly adjacent to the island containing an empty pedestal. Then, they painstakingly carry the statue on this island across the adjoining bridge and place it on the empty pedestal.

Determine if it is possible for the islanders to arrange the statues in the desired order.

Input

The first line contains a single integer n (2 ≤ n ≤ 200 000) — the total number of islands.

The second line contains n space-separated integers ai (0 ≤ ai ≤ n - 1) — the statue currently placed on the i-th island. If ai = 0, then the island has no statue. It is guaranteed that the ai are distinct.

The third line contains n space-separated integers bi (0 ≤ bi ≤ n - 1) — the desired statues of the ith island. Once again, bi = 0indicates the island desires no statue. It is guaranteed that the bi are distinct.

Output

Print "YES" (without quotes) if the rearrangement can be done in the existing network, and "NO" otherwise.

Examples

input

3
1 0 2
2 0 1

output

YES

input

2
1 0
0 1

output

YES

input

4
1 2 3 0
0 3 2 1

output

NO

Note

In the first sample, the islanders can first move statue 1 from island 1 to island 2, then move statue 2 from island 3 to island 1, and finally move statue 1 from island 2 to island 3.

In the second sample, the islanders can simply move statue 1 from island 1 to island 2.

In the third sample, no sequence of movements results in the desired position.

题意：

给定一些雕像，需要把雕像移动到相对应的小岛，第二行是目前雕像所在岛屿，第三行是目标岛屿对应的雕像序号。

思路：

把两个序列的 0 取出后，判断两个序列的排序是不是相同即可。

问题是找 bug 耽误了很长时间，以后再不用EOF 了！！

AC Code：

#include<stdio.h>
#include<cstring>
const int MYDD=1103+2E5;

int main() {
	int n;
	scanf("%d",&n);
	int a[MYDD],b[MYDD];
	for(int j=0; j<n-1; j++) {
		scanf("%d",&a[j]);// 目前第 j 个的岛雕像编号 a[j]
		if(!a[j])	j--;//除去 0
	}

	for(int j=0; j<n-1; j++) {
		scanf("%d",&b[j]);// 第 j 个岛需要放置的雕像 b[j]
		if(!b[j])	j--;//除去 0
	}

	int frist=0;//查找第一个小岛匹配雕像所在位置
	while(a[0]!=b[frist])	frist++;
	bool flag=true;
	for(int j=0;  flag&&j<n-1; j++) {//遍历
		if(a[j]!=b[frist++])
			flag=false;	//存在不匹配
		if(frist>=n-1)	frist=0;//frist之前的还未匹配
	}

	if(flag)	puts("YES");
	else		puts("NO");

	return 0;
}

/*
3
0 2 1
1 2 0

*/

Bug Code：

卡在第十组测试数据：竟然打印出两个YES！！

Input
3
0 2 1
1 2 0
Output
YES
YES
Answer
YES
Checker Log
wrong output format Extra information in the output file

代码如下：

#include<stdio.h>
#include<cstring>
const int MYDD=1103+2E5;

int a[MYDD],b[MYDD];

int main() {
	int n;
	while(scanf("%d",&n)!=EOF) {
		for(int j=0; j<n-1; j++) {
			scanf("%d",&a[j]);// 目前第 j 个的岛雕像编号 a[j]
			if(!a[j])	j--;//除去 0
		}

		for(int j=0; j<n-1; j++) {
			scanf("%d",&b[j]);// 第 j 个岛需要放置的雕像 b[j]
			if(!b[j])	j--;//除去 0
		}

		int frist=0;//查找第一个小岛匹配雕像所在位置
		while(a[0]!=b[frist])	frist++;
		bool flag=true;
		for(int j=0; j<n-1; j++) {//遍历
			if(a[j]!=b[frist]) {
				flag=false;//存在不匹配
				break;
			}
			frist++;
			if(frist>=n-1)	frist=0;//frist之前的还未匹配
		}

		if(flag)	puts("YES");
		else		puts("NO");
	}
	return 0;
}