pSort

#### 题目描述 给定一个长度为 $n$ 的数列 $\{a_n\}$，初始时 $\{a_n\} = \{1, 2, \dots, n\}$。位置 $i$ 上的数可以和位置 $i \pm d_i$ 上的数交换。给定一个 $1 \sim n$ 的全排列，问初始的数列可否交换成给定的形式。 #### 输入格式 第一行一个整数 $n$。 第二行 $n$ 个互不相同的整数表示目标数列。 第三行 $n$ 个整数表示 $d_1, d_2, \dots, d_n$。 #### 输出格式 如果能交换到给定样式，输出 `YES`，否则输出 `NO`。 #### 数据范围 $1 \le n \le 100$

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.

5
5 4 3 2 1
1 1 1 1 1

YES

7
4 3 5 1 2 7 6
4 6 6 1 6 6 1

NO

7
4 2 5 1 3 7 6
4 6 6 1 6 6 1

YES