-
Notifications
You must be signed in to change notification settings - Fork 6
/
Copy path1253A.cpp
73 lines (69 loc) · 1.26 KB
/
1253A.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
#include<iostream>
#include<vector>
#include<string>
#include<cstring>
#include<stack>
#include<queue>
#include<cstdio>
#include<set>
#include<unordered_set>
#include<cmath>
#include<algorithm>
#include<functional>
#include<utility>
#include<cstdlib>
using namespace std;
typedef long long int lli;
typedef size_t idx;
#define vi vector<int>
#define pb(n) push_back(n)
#define ln "\n"
#define sp ends
#define newline cout << ln
#define fastios ios_base::sync_with_stdio(false); cin.tie(0)
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t, n;
cin >> t;
while(t--){
cin >> n;
vi a(n);
vi b(n);
for(auto &i : a) cin >> i;
for(auto &i : b) cin >> i;
int dif[100001] = {};
bool flag = false;
for(int i = 0; i < n; ++i){
if(a[i] > b[i]){
flag = true;
break;
}
dif[i] = b[i] - a[i];
}
if(flag) cout << "NO\n";
else{
for(int i = 0; i < n; ++i){
if(dif[i] != 0){
int v = dif[i];
for(int j = i; dif[j] == v && j < n; ++j){
dif[j] = 0;
}
break;
}
}
bool temp = false;
for(int i = 0; i < n; ++i){
if(dif[i] != 0){
temp = true;
break;
}
}
if(temp) cout << "NO\n";
else cout << "YES\n";
}
}
return 0;
}