QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#521838#6784. Problem Preparationucup-team3474WA 8ms5856kbC++23770b2024-08-16 15:41:112024-08-16 15:41:11

Judging History

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

  • [2024-08-16 15:41:11]
  • 评测
  • 测评结果:WA
  • 用时:8ms
  • 内存:5856kb
  • [2024-08-16 15:41:11]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
const int N=1919810;
typedef long long ll;
typedef pair<ll,ll> PII;
ll n,m,k;
ll a[N],b[N];
char s[N];

void __(){
    scanf("%d",&n);
    for(int i=1;i<=n;i++) scanf("%d",&a[i]);
    sort(a+1,a+1+n);
    if(n<10||n>13){
        puts("No");
        return;
    }
    // if(a[1]!=1||a[2]!=1){
    //     puts("No");
    //     return;
    // }
    int cnt=0;
    for(int i=2;i<n;i++){
        // if(a[i]==1) cnt++;
        if(abs(a[i]-a[i-1])>2){
            puts("No");
            return;
        }
    }
    for(int i=1;i<=n;i++) if(a[i]==1) cnt++;
    if(cnt<2) puts("No");
    else
    puts("Yes");
}


int main(){
    int _=1;
    cin>>_;
    while(_--){
        __();
    }
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 5856kb

input:

8
9
1 2 3 4 5 6 7 8 9
10
1 2 3 4 5 6 7 8 9 10
11
999 1 1 2 3 4 5 6 7 8 9
11
999 1 3 5 7 9 11 13 17 19 21
10
15 1 13 17 1 7 9 5 3 11
13
1 1 1 1 1 1 1 1 1 1 1 1 2
10
2 3 4 5 6 7 8 9 10 11
10
15 1 13 3 6 5 4 7 1 14

output:

No
No
Yes
No
Yes
Yes
No
No

result:

ok 8 lines

Test #2:

score: -100
Wrong Answer
time: 8ms
memory: 5856kb

input:

10000
9
1 1 1 1 1 1 1 1 2
10
1 1 1 1 1 1 1 1 1 2
10
0 1 1 1 1 1 1 1000 1 1
11
1 2 3 4 5 6 7 8 9 10 11
11
1 1 2 3 4 5 6 7 8 9 10
11
-1 1 1 1 1 1 1 1 2 1 1
11
1 1 3 5 7 9 11 13 15 17 19
12
1 1 3 5 7 9 11 13 15 17 19 1000
12
1 2 3 5 7 9 11 13 15 17 19 1000
11
1 1 2 3 4 5 6 9 11 17 22
13
10 1 5 9 10 5 7...

output:

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

result:

wrong answer 3rd lines differ - expected: 'No', found: 'Yes'