Codeforces/Increasing.cpp at main · Shourov735/Codeforces · GitHub

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
/*#include <bits/stdc++.h>
using namespace std;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t;
    cin >> t;

    vector<int> a;
    a.reserve(100);

    while (t--)
    {
        int n, duplicate = 0;
        cin >> n;
        a.resize(n);
        for (int i = 0; i < n; i++)
        {
            cin >> a[i];
        }
        sort(a.begin(), a.end());
        for (int i = 0; i < n - 1; i++)
        {
            if (a[i] == a[i + 1])
            {
                duplicate = 1;
                break;
            }
        }
        cout << (duplicate ? "NO\n" : "YES\n");
    }
    return 0;
}*/

#include <bits/stdc++.h>
using namespace std;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t;
    cin >> t;

    while (t--)
    {
        int n, a, duplicate = 0;
        cin >> n;
        map<int, int> mp;
        for (int i = 0; i < n; i++)
        {
            cin >> a;
            mp[a]++;
            if (mp[a] > 1)
                duplicate = 1;
        }
        cout << (duplicate ? "NO\n" : "YES\n");
    }
    return 0;
}
/*#include <bits/stdc++.h>
using namespace std;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t;
    cin >> t;

    while (t--)
    {
        int n, a, duplicate = 0;
        cin >> n;
        set<int> s;
        for (int i = 0; i < n; i++)
        {
            cin >> a;
            s.insert(a);
        }
        if(s.size()!=n) duplicate = 1;
        cout << (duplicate ? "NO\n" : "YES\n");
    }
    return 0;
}*/