-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathC.cpp
106 lines (91 loc) · 2.14 KB
/
C.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
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
//#pragma GCC optimize "trapv"
#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3", "unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
#define ll long long int
#define fab(a,b,i) for(int i=a;i<b;i++)
#define pb push_back
#define db double
#define mp make_pair
#define endl "\n"
#define f first
#define se second
#define all(x) x.begin(),x.end()
#define MOD 1000000007
#define vll vector<ll>
#define vi vector<int>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define quick ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
using namespace std;
ll add(ll x, ll y) {ll res = x + y; return (res >= MOD ? res - MOD : res);}
ll mul(ll x, ll y) {ll res = x * y; return (res >= MOD ? res % MOD : res);}
ll sub(ll x, ll y) {ll res = x - y; return (res < 0 ? res + MOD : res);}
ll power(ll x, ll y) {ll res = 1; x %= MOD; while (y) {if (y & 1)res = mul(res, x); y >>= 1; x = mul(x, x);} return res;}
ll mod_inv(ll x) {return power(x, MOD - 2);}
ll lcm(ll x, ll y) { ll res = x / __gcd(x, y); return (res * y);}
int main()
{ quick;
#ifndef ONLINE_JUDGE
freopen("D:/sublime/input.txt", "r", stdin);
freopen("D:/sublime/output.txt", "w", stdout);
#endif
int t = 1;
cin >> t;
while (t--)
{
int n;
cin >> n;
vector<ll> a(2 * n);
map<ll, ll> m;
fab(0, 2 * n, i)
{
cin >> a[i];
m[a[i]]++;
}
bool ok = 1;
vector<ll> v;
for (auto i : m)
{
ok &= (i.se % 2 == 0);
v.pb(i.f / 2);
ok &= (i.f % 2 == 0);
}
ok &= (m.size() == n);
if (!ok or v.back() % n > 0)
{
cout << "NO" << endl;
continue;
}
reverse(all(v));
ll val = v[0] / n;
vector<ll> ans;
ans.pb(v[0] / n);
fab(1, n, i)
{
//cout << "v:" << v[i] << endl;
//cout << ans.back() << endl;
ll op = v[i] - val ;
//cout << "op:" << op << endl;
ll ex = op % (n - i );
ll pp = op / (n - i );
if (ex > 0 or op < 0 )
{
ok = 0;
break;
}
val += pp;
ans.pb(pp);
}
set<ll> s;
for (auto i : ans)
{ s.insert(i);
s.insert(-i);
}
ok &= (s.size() == 2 * n);
cout << (ok ? "YES" : "NO") << endl;
}
cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs" << endl;
return 0;
}