提出 #67324535

---

ソースコード 拡げる

// Author: vrintle (Rahul Verma)

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;

template <typename T> using pbds = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define int int64_t
#define endl '\n'
#define sz(v) ((int) v.size())
#define all(v) v.begin(), v.end()
#define vi vector<int>
#define pii pair<int, int>
#define inf 2e18
#define rep(n) for(int _ = 0; _ < n; _++)
#define loop(n, i) for(int i = 0; i < n; i++)
#define ff first
#define ss second
#define pb push_back
#define pc __builtin_popcountll

// Debug Template, copied from Mikel_Arteta_8 (https://codeforces.com/blog/entry/68809)
void __print(int x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef VRINTLE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
// End of debugging template

int max(int x, int y) { return x > y ? x : y; }
int min(int x, int y) { return x < y ? x : y; }

void solve() {
	int n;
	cin >> n;
	vi a(n);
	loop(n, i) {
		cin >> a[i];
	}
	sort(all(a), [&](auto& x, auto& y) {
		return abs(x) < abs(y);
	});
	if(abs(a[0]) == abs(a[n - 1])) {
		int pos = 0, neg = 0;
		loop(n, i) {
			if(a[i] > 0) pos++;
			else neg++;
		}
		return void(cout << (abs(pos - neg) < 2 || !pos || !neg ? "Yes" : "No"));
	}
	set<pii> s;
	for(int i = 0; i + 1 < n; i++) {
		int x = a[i + 1], y = a[i];
		int g = __gcd(x, y);
		x /= g;
		y /= g;
		if(x < 0) x *= -1, y *= -1;
		s.insert({x, y});
	}
	cout << (sz(s) == 1 ? "Yes" : "No");
}

int32_t main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int t = 1;
	cin >> t;
	while(t--) {
		solve();
		cout << endl;
	}
	return 0;
}

提出情報

ジャッジ結果