Submission #67337743

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define f(s,e) for(long long i=s; i<e; i++)
#define rf(e,s) for(long long i=e; i>=s; i--)
#define pb push_back
#define MOD 1000000007
#define um unordered_map
#define pii pair<int,int>
#define F first
#define S second
#define si set<int>
#define all(a) (a).begin(),(a).end()
#define fora(a) for(auto &u:a)
/*********************************************/
void yes(){cout<<"Yes"<<endl;}
void no(){cout<<"No"<<endl;}
ll add(ll x, ll y){return ((x + y) % MOD + MOD) % MOD;}
ll mul(ll x, ll y){return x * 1ll * y % MOD;}
ll binpow(ll x, ll y){
    ll z = 1;
    while(y){
        if(y % 2 == 1) z = mul(z, x);
        x = mul(x, x);
        y /= 2;
    }
    return z;
}
ll inv(ll x){return binpow(x, MOD - 2);}
ll divide(ll x, ll y){return mul(x, inv(y));}
/***************************************/
static bool comp(ll &a, ll &b){
    return abs(a) < abs(b);
}
bool check(vector<ll> &a){
    unordered_set<ll> st;
    int pos = 0, neg = 0;
    fora(a){
        st.insert(abs(u));
        if(u < 0){
            neg++;
        }
        else{
            pos++;
        }
    }
    // cout << pos << " " << neg << endl;
    if(st.size() == 1 && abs(pos-neg) <= 1){
        return true;
    }
    else{
        return false;
    }
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t;
    cin>>t;
    while(t--){
        int n;
        cin >> n;
        vector<ll> a(n);
        f(0, n){
            cin >> a[i];
        }
        if(check(a)){
            yes();
            continue;
        }
        sort(all(a),comp);
        bool flag = true;
        for(int i = 1; i < n-1; i++){
            ll sqr = a[i]*a[i];
            ll othr = a[i-1]*a[i+1];
            if(sqr != othr){
                flag = false;
                break;
            }
        }
        if(flag){
            yes();
        }
        else{
            no();
        }
    }
}

Submission Info

Judge Result