跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F2499. pSort

  • ID: 2505
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:进阶
  • 上传者:
  • 搜索
  • 并查集
  • 图论
  • 数据结构
  • 进阶
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

pSort

题目描述

B. pSort
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

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|=di, where di 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.

Input

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.

Output

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

Examples
Input
5
5 4 3 2 1
1 1 1 1 1
Output
YES
Input
7
4 3 5 1 2 7 6
4 6 6 1 6 6 1
Output
NO
Input
7
4 2 5 1 3 7 6
4 6 6 1 6 6 1
Output
YES

题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 2136 题。保留原作者与原赛事署名。