QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#646950#8813. Records in Chichén Itzáplanckconstant#WA 39ms3820kbC++14647b2024-10-17 10:27:322024-10-17 10:27:33

Judging History

你现在查看的是最新测评结果

  • [2024-10-17 10:27:33]
  • 评测
  • 测评结果:WA
  • 用时:39ms
  • 内存:3820kb
  • [2024-10-17 10:27:32]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define double long double
#define INF 1e15
void slove()
{
    int n;
    cin>>n;
    set<int>a;
    int ans=0;
    for(int i=0;i<n;i++){
        int x;
        cin>>x;
        a.insert(x);
        if(x>1){
            ans++;
        }
    }
    if((ans>=3&&a.size()>=3)||(ans>=4)){
        cout<<"Yes"<<endl;
    }
    else{
        cout<<"No"<<endl;
    }   
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t=1;
    cin >> t;
    while (t--) {
        slove();
    }
    return 0;
}

詳細信息

Test #1:

score: 100
Accepted
time: 0ms
memory: 3504kb

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: 3820kb

input:

1
2
1 1

output:

No

result:

ok "No"

Test #3:

score: 0
Accepted
time: 39ms
memory: 3560kb

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: 15ms
memory: 3556kb

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
Yes
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
Yes
Yes
No
No
No
No
Yes
No
No
No
No
No
No
No
No
No
No
...

result:

wrong answer 26th words differ - expected: 'No', found: 'Yes'