Cp-Codes/A_Doremy_s_Paint_3.cpp at master · TheVidz/Cp-Codes · 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
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define pb push_back
#define f first
#define s second
#define min3(a, b, c) min(min(a, b), c)
#define max3(a, b, c) max(max(a, b), c)
#define all(v) v.begin(), v.end()


typedef long long ll;
typedef double ld;
typedef long double lld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;

const int INF = 1e9;
//const ll INF = 1e18;
const ll mod = 1000000007;
// const ll mod = 998244353;


void solve(){

	int n;
    cin>>n;
    vi vec;
    for (int i = 0; i < n; i++)
    {
       int temp;
       cin >>temp;
       vec.push_back(temp);
    }

 map<int, int> M;

    // Traverse vector vec check if
    // current element is present
    // or not
    for (int i = 0; i<n; i++) {

        // If the current element
        // is not found then insert
        // current element with
        // frequency 1
        if (M.find(vec[i]) == M.end()) {
            M[vec[i]] = 1;
        }

        // Else update the frequency
        else {
            M[vec[i]]++;
        }
    }

    // Traverse the map to print the
    // frequency
    if(M.size()<=2){
        int x=0,y=0;
        for(auto& it:M){
            if(x==0){x= it.second;}else{y=it.second;}

        }
        if(n%2==0){
            if(y==0){
                cout<<"Yes"<<endl;
            }else if(x==y){
                cout<<"Yes"<<endl;
            }else{
                cout<<"No"<<endl;
            }

        }else{
            if(y==0){
                cout<<"Yes"<<endl;
            }else if(abs(x-y)==1){
                cout<<"Yes"<<endl;
            }else{
                cout<<"No"<<endl;
            }
        }
    }else{
        cout << "No"<<endl;
    }


}

int main()
{
    ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);


    int t=1;
    cin>>t;

    while(t--)
    	solve();


    return 0;
}