308850: CF1584C. Two Arrays
Memory Limit:256 MB
Time Limit:1 S
Judge Style:Text Compare
Creator:
Submit:0
Solved:0
Description
Two Arrays
题意翻译
有 $2$ 个大小为 $n$ 数组 $A,B$。 定义一次操作如下: * 在 $A$ 数组里选择 $k$ 个数,并把它们加 $1$。 * 随意打乱 $A$ 数组。 问:能否在做完 **正好一次** 操作后,把 $A$ 数组变为 $B$。题目描述
You are given two arrays of integers $ a_1, a_2, \ldots, a_n $ and $ b_1, b_2, \ldots, b_n $ . Let's define a transformation of the array $ a $ : 1. Choose any non-negative integer $ k $ such that $ 0 \le k \le n $ . 2. Choose $ k $ distinct array indices $ 1 \le i_1 < i_2 < \ldots < i_k \le n $ . 3. Add $ 1 $ to each of $ a_{i_1}, a_{i_2}, \ldots, a_{i_k} $ , all other elements of array $ a $ remain unchanged. 4. Permute the elements of array $ a $ in any order. Is it possible to perform some transformation of the array $ a $ exactly once, so that the resulting array is equal to $ b $ ?输入输出格式
输入格式
The first line contains a single integer $ t $ ( $ 1 \le t \le 100 $ ) — the number of test cases. Descriptions of test cases follow. The first line of each test case contains a single integer $ n $ ( $ 1 \le n \le 100 $ ) — the size of arrays $ a $ and $ b $ . The second line of each test case contains $ n $ integers $ a_1, a_2, \ldots, a_n $ ( $ -100 \le a_i \le 100 $ ). The third line of each test case contains $ n $ integers $ b_1, b_2, \ldots, b_n $ ( $ -100 \le b_i \le 100 $ ).
输出格式
For each test case, print "YES" (without quotes) if it is possible to perform a transformation of the array $ a $ , so that the resulting array is equal to $ b $ . Print "NO" (without quotes) otherwise. You can print each letter in any case (upper or lower).
输入输出样例
输入样例 #1
3
3
-1 1 0
0 0 2
1
0
2
5
1 2 3 4 5
1 2 3 4 5
输出样例 #1
YES
NO
YES