QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#360365	#6784. Problem Preparation	Xiangmy^#	AC ✓	7ms	3944kb	C++20	733b	2024-03-21 18:11:08	2024-03-21 18:11:10

Judging History

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

[2024-03-21 18:11:10]
评测

测评结果：AC
用时：7ms
内存：3944kb

查看

[2024-03-21 18:11:08]
提交

answer

#include <bits/stdc++.h>
using namespace std;
int main(){
    int t,n,s[10010];
    scanf("%d",&t);
    while(t--){
        int num=0,sign1=0,sign2=1,sum[10010];
        scanf("%d",&n);
        for(int i=1;i<=n;i++){
            scanf("%d",&s[i]);
            if(s[i]==1){num++;}
            if(s[i]<1){sign1=1;}
        }
        if(n<10||n>13){printf("No\n");continue;}
        if(num<2){printf("No\n");continue;}
        if(sign1){printf("No\n");continue;}
        sort(s+1,s+n+1);
        for(int i=2;i<=n;i++){
            sum[i]=abs(s[i]-s[i-1]);
            if(i==n){sum[i]=1;}
            if(sum[i]>2){printf("No\n");sign2=0;break;}
        }
        if(sign2){printf("Yes\n");}
    }
    return 0;
}

Source code, Language: C++20

这程序好像有点Bug，我给组数据试试？

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3944kb

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: 0

Accepted

time: 7ms

memory: 3896kb

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

result:

ok 10000 lines