Submission #67371107

---

Source Code Expand

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

#define ll long long
#define v vector
#define pb push_back
#define pf push_front
#define F first
#define S second
#define PI 3.14159265358979323846
#define endl '\n'

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
}
void solve() {
  // Your solution here
  int t;
  cin >> t;
  while (t--) {
    ll n;
    cin >> n;
    int neg = 0;
    int pos = 0;
    vector<ll> a(n);
    for (int i = 0; i < n; i++) {
      cin >> a[i];
      if (a[i] > 0)
        pos++;
      else
        neg++;
    }
    sort(a.begin(), a.end(), [&](ll i, ll j) { return (abs(i) < abs(j)); });
    int flag = 0;
    if (n > 2) {
      for (int i = 0; i < n - 2; i++) {
        if (a[i + 2] * a[i] != a[i + 1] * a[i + 1]) {
          flag = -1;
          break;
        }
      }
      if (pos != 0 && neg != 0) {
        for (int i = 0; i < n - 2; i++) {
          if (!((a[i] > 0 && a[i + 1] < 0 && a[i + 2] > 0) ||
                (a[i] < 0 && a[i + 1] > 0 && a[i + 2] < 0))) {
            flag = -1;
            break;
          }
        }
      }
    }
    if (flag == -1)
      cout << "No" << endl;
    else
      cout << "Yes" << endl;
  }
}

int main() {
  fastIO();

  int t = 1;
  // cin >> t;
  while (t--) {
    solve();
  }

  return 0;
}

Submission Info

Judge Result