CF1253A Single Push

You're given two arrays $ a[1 \dots n] $ and $ b[1 \dots n] $ , both of the same length $ n $ . In order to perform a push operation, you have to choose three integers $ l, r, k $ satisfying $ 1 \le l \le r \le n $ and $ k > 0 $ . Then, you will add $ k $ to elements $ a_l, a_{l+1}, \ldots, a_r $ . For example, if $ a = [3, 7, 1, 4, 1, 2] $ and you choose $ (l = 3, r = 5, k = 2) $ , the array $ a $ will become $ [3, 7, \underline{3, 6, 3}, 2] $ . You can do this operation at most once. Can you make array $ a $ equal to array $ b $ ? (We consider that $ a = b $ if and only if, for every $ 1 \le i \le n $ , $ a_i = b_i $ )

The first line contains a single integer $ t $ ( $ 1 \le t \le 20 $ ) — the number of test cases in the input. The first line of each test case contains a single integer $ n $ ( $ 1 \le n \le 100\ 000 $ ) — the number of elements in each array. The second line of each test case contains $ n $ integers $ a_1, a_2, \ldots, a_n $ ( $ 1 \le a_i \le 1000 $ ). The third line of each test case contains $ n $ integers $ b_1, b_2, \ldots, b_n $ ( $ 1 \le b_i \le 1000 $ ). It is guaranteed that the sum of $ n $ over all test cases doesn't exceed $ 10^5 $ .

For each test case, output one line containing "YES" if it's possible to make arrays $ a $ and $ b $ equal by performing at most once the described operation or "NO" if it's impossible. You can print each letter in any case (upper or lower).

The first test case is described in the statement: we can perform a push operation with parameters $ (l=3, r=5, k=2) $ to make $ a $ equal to $ b $ . In the second test case, we would need at least two operations to make $ a $ equal to $ b $ . In the third test case, arrays $ a $ and $ b $ are already equal. In the fourth test case, it's impossible to make $ a $ equal to $ b $ , because the integer $ k $ has to be positive.