Submission #67353562
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
bool solve() {
int N;
cin >> N;
vector<ll> A(N);
for(auto& x : A) cin >> x;
if(N == 1) return true;
sort(A.begin(), A.end());
vector<vector<ll>> cs = {
{A[0], A[1]},
{A[0], A.back()},
{A.back(), A[0]}
};
for(auto& pair : cs) {
ll a1 = pair[0], a2 = pair[1];
if(a1 == 0 || a2 == 0) continue;
ll num = a2;
ll den = a1;
ll g = __gcd(abs(num), abs(den));
num /= g;
den /= g;
vector<ll> B = A;
bool valid = true;
vector<ll> se;
se.push_back(a1);
unordered_map<ll, int> count;
for(auto x : B) count[x]++;
count[a1]--;
for(int i = 1; i < N; ++i) {
ll next = se.back() * num / den;
if(count[next] == 0) {
valid = false;
break;
}
count[next]--;
se.push_back(next);
}
if(valid) return true;
}
return false;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int T;
cin >> T;
while(T--) {
cout << (solve() ? "Yes" : "No") << "\n";
}
return 0;
}
Submission Info
| Submission Time | |
|---|---|
| Task | D - Make Geometric Sequence |
| User | a_little_cat |
| Language | C++ 20 (gcc 12.2) |
| Score | 0 |
| Code Size | 1302 Byte |
| Status | WA |
| Exec Time | 104 ms |
| Memory | 15500 KiB |
Judge Result
| Set Name | Sample | All | ||||||
|---|---|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 0 / 425 | ||||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | 00_sample_00.txt |
| All | 00_sample_00.txt, 01_random_01.txt, 01_random_02.txt, 01_random_03.txt, 01_random_04.txt, 01_random_05.txt, 01_random_06.txt, 01_random_07.txt, 01_random_08.txt, 01_random_09.txt, 01_random_10.txt, 01_random_11.txt, 01_random_12.txt, 01_random_13.txt, 01_random_14.txt, 01_random_15.txt, 01_random_16.txt, 01_random_17.txt, 01_random_18.txt, 01_random_19.txt, 01_random_20.txt, 01_random_21.txt, 01_random_22.txt, 01_random_23.txt, 01_random_24.txt, 01_random_25.txt, 01_random_26.txt, 01_random_27.txt, 01_random_28.txt, 01_random_29.txt, 01_random_30.txt, 02_handmade_31.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| 00_sample_00.txt | AC | 1 ms | 3356 KiB |
| 01_random_01.txt | WA | 26 ms | 3424 KiB |
| 01_random_02.txt | WA | 79 ms | 10152 KiB |
| 01_random_03.txt | WA | 88 ms | 12412 KiB |
| 01_random_04.txt | WA | 54 ms | 3504 KiB |
| 01_random_05.txt | WA | 62 ms | 6564 KiB |
| 01_random_06.txt | WA | 14 ms | 3508 KiB |
| 01_random_07.txt | AC | 19 ms | 8352 KiB |
| 01_random_08.txt | WA | 54 ms | 3512 KiB |
| 01_random_09.txt | WA | 54 ms | 3480 KiB |
| 01_random_10.txt | WA | 31 ms | 3408 KiB |
| 01_random_11.txt | WA | 77 ms | 9664 KiB |
| 01_random_12.txt | WA | 54 ms | 3628 KiB |
| 01_random_13.txt | WA | 54 ms | 3568 KiB |
| 01_random_14.txt | WA | 54 ms | 3500 KiB |
| 01_random_15.txt | WA | 56 ms | 4800 KiB |
| 01_random_16.txt | WA | 54 ms | 3460 KiB |
| 01_random_17.txt | WA | 54 ms | 3628 KiB |
| 01_random_18.txt | WA | 39 ms | 3452 KiB |
| 01_random_19.txt | AC | 29 ms | 9996 KiB |
| 01_random_20.txt | WA | 24 ms | 3484 KiB |
| 01_random_21.txt | WA | 78 ms | 10144 KiB |
| 01_random_22.txt | WA | 55 ms | 3504 KiB |
| 01_random_23.txt | WA | 32 ms | 3576 KiB |
| 01_random_24.txt | WA | 104 ms | 15500 KiB |
| 01_random_25.txt | WA | 53 ms | 3504 KiB |
| 01_random_26.txt | WA | 54 ms | 3372 KiB |
| 01_random_27.txt | WA | 47 ms | 4916 KiB |
| 01_random_28.txt | WA | 79 ms | 10220 KiB |
| 01_random_29.txt | WA | 54 ms | 3448 KiB |
| 01_random_30.txt | WA | 29 ms | 4816 KiB |
| 02_handmade_31.txt | AC | 1 ms | 3476 KiB |