QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #800709 | #8813. Records in Chichén Itzá | NotNotToday# | WA | 12ms | 3972kb | C++23 | 1.1kb | 2024-12-06 14:53:04 | 2024-12-06 14:53:05 |
Judging History
answer
#include <iostream>
#include <cmath>
#include <vector>
#include <cctype>
#include <cassert>
#include <random>
#include <map>
#define ld long double
#define pb push_back
#define all(a) a.begin(), a.end()
using namespace std;
int main() {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
map<int, int> cnt;
int non_one = 0;
for (int i = 0; i < n; i++) {
if (a[i] != 1) {
cnt[a[i]]++;
non_one++;
}
}
if (non_one <= 2) {
cout << "No\n";
continue;
}
if (cnt.size() == 1) {
if ((cnt.begin()->first == 2) || (cnt.begin()->first == 3 && non_one == 3)) {
cout << "No\n";
continue;
}
}
cout << "Yes\n";
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3528kb
input:
3 6 1 1 1 1 3 3 5 1 1 2 2 2 10 1 1 1 1 2 2 2 2 3 3
output:
No No Yes
result:
ok 3 tokens
Test #2:
score: 0
Accepted
time: 0ms
memory: 3808kb
input:
1 2 1 1
output:
No
result:
ok "No"
Test #3:
score: 0
Accepted
time: 12ms
memory: 3640kb
input:
100000 2 1 1 2 1 1 2 1 1 2 1 1 2 1 1 2 1 1 2 1 1 2 1 1 2 1 1 2 1 1 2 1 1 2 1 1 2 1 1 2 1 1 2 1 1 2 1 1 2 1 1 2 1 1 2 1 1 2 1 1 2 1 1 2 1 1 2 1 1 2 1 1 2 1 1 2 1 1 2 1 1 2 1 1 2 1 1 2 1 1 2 1 1 2 1 1 2 1 1 2 1 1 2 1 1 2 1 1 2 1 1 2 1 1 2 1 1 2 1 1 2 1 1 2 1 1 2 1 1 2 1 1 2 1 1 2 1 1 2 1 1 2 1 1 2 1 1...
output:
No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No ...
result:
ok 100000 tokens
Test #4:
score: 0
Accepted
time: 11ms
memory: 3876kb
input:
50000 3 1 1 2 3 1 1 2 2 1 1 4 1 1 2 2 5 1 1 1 2 3 2 1 1 4 1 1 2 2 4 1 1 2 2 3 1 1 2 3 1 1 2 3 1 1 2 4 1 1 2 2 2 1 1 4 1 1 2 2 3 1 1 2 2 1 1 4 1 1 2 2 3 1 1 2 6 1 1 1 2 2 3 5 1 1 1 2 3 5 1 1 1 1 4 4 1 1 1 3 8 1 1 1 1 1 2 3 4 3 1 1 2 4 1 1 2 2 6 1 1 2 2 2 2 4 1 1 2 2 2 1 1 4 1 1 1 3 4 1 1 1 3 4 1 1 1 ...
output:
No No No No No No No No No No No No No No No No No No Yes No No No Yes No No No No No No No No No No No No No Yes No No No No No No No No No No No No Yes No No No No No No No No No No No No No No No No No No No No No No No No No No No No Yes No No No No No No No Yes No No No No No No No No No No No ...
result:
ok 50000 tokens
Test #5:
score: 0
Accepted
time: 11ms
memory: 3592kb
input:
40000 5 1 1 1 2 3 3 1 1 2 5 1 1 1 2 3 6 1 1 2 2 2 2 6 1 1 1 2 2 3 6 1 1 2 2 2 2 6 1 1 1 2 2 3 3 1 1 2 2 1 1 5 1 1 1 2 3 5 1 1 1 2 3 2 1 1 7 1 1 1 2 2 2 3 5 1 1 2 2 2 3 1 1 2 6 1 1 1 2 2 3 6 1 1 1 2 2 3 2 1 1 5 1 1 2 2 2 4 1 1 1 3 7 1 1 1 1 2 3 3 5 1 1 2 2 2 3 1 1 2 6 1 1 1 1 2 4 10 1 1 1 1 1 2 2 3 3...
output:
No No No No Yes No Yes No No No No No Yes No No Yes Yes No No No Yes No No No Yes Yes No Yes No No No No No No Yes Yes No No No No No Yes Yes Yes No No No No No No No No No Yes No No No No No No No No Yes No No No No Yes No No Yes Yes No Yes Yes Yes No No No No No No Yes No Yes No Yes No No No No No...
result:
ok 40000 tokens
Test #6:
score: 0
Accepted
time: 9ms
memory: 3592kb
input:
20000 8 1 1 1 1 2 2 3 3 9 1 1 1 1 2 2 2 3 3 12 1 1 1 1 1 2 2 2 2 3 3 3 15 1 1 1 1 1 1 1 2 2 2 2 3 3 3 4 10 1 1 1 2 2 2 2 2 2 3 16 1 1 1 1 1 1 1 1 1 2 3 3 3 3 3 4 11 1 1 1 1 2 2 2 2 2 2 4 9 1 1 1 1 1 2 2 3 4 13 1 1 1 1 1 2 2 2 2 2 3 3 3 9 1 1 1 1 2 2 2 2 4 14 1 1 1 1 2 2 2 2 2 2 2 2 3 3 8 1 1 1 2 2 2...
output:
Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes No Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes No Yes No Yes Yes Yes Yes No Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes No Yes Yes Yes Yes Yes Yes Yes Yes No Ye...
result:
ok 20000 tokens
Test #7:
score: 0
Accepted
time: 3ms
memory: 3816kb
input:
200 1017 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1...
output:
Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes ...
result:
ok 200 tokens
Test #8:
score: 0
Accepted
time: 6ms
memory: 3972kb
input:
2 100000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1...
output:
Yes Yes
result:
ok 2 tokens
Test #9:
score: -100
Wrong Answer
time: 4ms
memory: 3584kb
input:
5000 2 1 1 3 1 1 2 4 1 1 1 3 4 1 1 2 2 5 1 1 1 1 4 5 1 1 1 2 3 5 1 1 2 2 2 6 1 1 1 1 1 5 6 1 1 1 1 2 4 6 1 1 1 1 3 3 6 1 1 1 2 2 3 6 1 1 2 2 2 2 7 1 1 1 1 1 1 6 7 1 1 1 1 1 2 5 7 1 1 1 1 1 3 4 7 1 1 1 1 2 2 4 7 1 1 1 1 2 3 3 7 1 1 1 2 2 2 3 7 1 1 2 2 2 2 2 8 1 1 1 1 1 1 1 7 8 1 1 1 1 1 1 2 6 8 1 1 1...
output:
No No No No No No No No No No Yes No No No No Yes Yes Yes No No No No No Yes Yes No Yes Yes Yes No No No No No Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes No No No No No No Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes No No No No No No Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Y...
result:
wrong answer 79th words differ - expected: 'No', found: 'Yes'