-
Notifications
You must be signed in to change notification settings - Fork 0
/
C.cpp
65 lines (55 loc) · 1.17 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
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define vi vector<int>
#define pi pair<int,int>
#define floop(i,n,c) for(ll i=0;i<n;i=i+c)
//const double e = 1e-9; //Check not exact 1, Use with abs() for floating point numbers instead of ==
const int MAX_N = 1e5 + 5; //Check use?
const ll MOD = 1e9 + 7;
void solve()
{
ll n;
cin >> n;
ll A[n];
ll evens, odds, least_even, least_odd;
evens = 0;
odds = 0;
least_even = 1e11;
least_odd = 1e11;
floop(i,n,1){
cin >> A[i];
if(A[i]%2==0){
evens++;
if(least_even>A[i])
least_even = A[i];
}
else{
odds++;
if(least_odd>A[i])
least_odd = A[i];
}
}
if(evens == n || odds == n){
cout << "YES" << endl;
return;
}
ll check;
//check = all_odd_test()
if(least_even<least_odd){
cout<< "NO" << endl;
return;
}
//ll occur = count(A,A+n,least_odd);
cout << "YES" << endl;
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
while (t--)
solve();
}