QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#456042 | #8813. Records in Chichén Itzá | 233L | WA | 11ms | 3624kb | C++14 | 975b | 2024-06-27 08:46:51 | 2024-06-27 08:46:51 |
Judging History
answer
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define ldb long double
#define pii pair<int,int>
#define mkp make_pair
#define mkt make_tuple
#define fr first
#define se second
#define uset unordered_set
#define umap unordered_map
#define pqueue priority_queue
#define all(_box) _box.begin(),_box.end()
#define ppc __builtin_popcount
#define ctz __builtin_ctz
#define clz __builtin_clz
#define lbd lower_bound
#define ubd upper_bound
#define deb(x) cerr<<#x<<'='<<(x)<<' '
using namespace std;
bool solve(){
int n;
cin>>n;
map<int,int>mp;
for(int i=1;i<=n;i++){
int x;
cin>>x;
mp[x]++;
}
if(n-mp[1]<=2)return 1;
return mp.size()-1<=1;
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
int T;
cin>>T;
while(T--){
if(!solve())cout<<"Yes\n";
else cout<<"No\n";
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3536kb
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: 3584kb
input:
1 2 1 1
output:
No
result:
ok "No"
Test #3:
score: 0
Accepted
time: 8ms
memory: 3576kb
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: -100
Wrong Answer
time: 11ms
memory: 3624kb
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:
wrong answer 550th words differ - expected: 'Yes', found: 'No'