-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path1656C_MakeEqualWithMod.cpp
More file actions
57 lines (45 loc) · 1.11 KB
/
1656C_MakeEqualWithMod.cpp
File metadata and controls
57 lines (45 loc) · 1.11 KB
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
//* 211323942 Jun/28/2023 16:37UTC+7 Minh4893IT C - Make Equal With Mod GNU C++17 Accepted 77 ms 800 KB
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ss stringstream
#define uset unordered_set
#define umap unordered_map
#define mmap multimap
#define mset multiset
#define pq priority_queue
#define endl "\n"
#define LLMAX INT64_MAX
#define GET(var) getline(cin, var)
#define EACH(x, a) for (auto &x : a)
#define IF(cond, t, f) (cond ? t : f)
#define OFILE(finp, fout) freopen(finp, "r", stdin), freopen(fout, "w", stdout)
#define FAST_IO ios_base::sync_with_stdio(false), cin.tie()
void solve()
{
int n;
cin >> n;
vector<int> arr(n);
for (int i = 0; i < n; ++i)
cin >> arr[i];
sort(arr.begin(), arr.end());
if (binary_search(arr.begin(), arr.end(), 1))
{
for (int i = 1; i < n; ++i)
if (arr[i] == arr[i - 1] + 1)
{
cout << "NO" << endl;
return;
}
}
cout << "YES" << endl;
}
signed main()
{
FAST_IO;
int t;
cin >> t;
while (t--)
solve();
return 0;
}