CF28B.pSort

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

One day $n$ cells of some array decided to play the following game. Initially each cell contains a number which is equal to it's ordinal number (starting from $1$ ). Also each cell determined it's favourite number. On it's move $i$ -th cell can exchange it's value with the value of some other $j$ -th cell, if $|i-j|=d_{i}$ , where $d_{i}$ is a favourite number of $i$ -th cell. Cells make moves in any order, the number of moves is unlimited.

The favourite number of each cell will be given to you. You will also be given a permutation of numbers from $1$ to $n$ . You are to determine whether the game could move to this state.

输入格式

The first line contains positive integer $n$ ( $1<=n<=100$ ) — the number of cells in the array. The second line contains $n$ distinct integers from $1$ to $n$ — permutation. The last line contains $n$ integers from $1$ to $n$ — favourite numbers of the cells.

输出格式

If the given state is reachable in the described game, output YES, otherwise NO.

输入输出样例

输入#1
```
5
5 4 3 2 1
1 1 1 1 1
```
输出#1
```
YES
```
输入#2
```
7
4 3 5 1 2 7 6
4 6 6 1 6 6 1
```
输出#2
```
NO
```
输入#3
```
7
4 2 5 1 3 7 6
4 6 6 1 6 6 1
```
输出#3
```
YES
```

首页