QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#184109	#6506. Chase Game 3	CSU2023^#	WA	21ms	3836kb	C++14	441b	2023-09-20 12:57:07	2023-09-20 12:57:08

Judging History

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

[2023-09-20 12:57:08]
评测

测评结果：WA
用时：21ms
内存：3836kb

查看

[2023-09-20 12:57:07]
提交

answer

#include <bits/stdc++.h>
const int N = 1e6 + 3;
int n;
int p[N];
int main()
{
//freopen("a.txt","r",stdin);
    int T;
    scanf("%d",&T);
    while(T--){
        scanf("%d",&n);
        for(int i = 1;i <= n;++i) scanf("%d",&p[i]);
        bool flag = 0;
        for(int i = 2;i <= n;++i) flag |= (p[i] - p[i - 1]) > 2;
        if(!flag) puts("Yes");
        else puts("No");
    }
   // system("pause");
    return 0;
}

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3836kb

input:

5
2
1 2
3
2 3 1
4
1 4 3 2
5
1 5 2 3 4
6
1 2 3 4 5 6

output:

Yes
Yes
No
No
Yes

result:

ok 5 token(s): yes count is 3, no count is 2

Test #2:

score: 0

Accepted

time: 0ms

memory: 3776kb

input:

output:

Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes

result:

ok 8 token(s): yes count is 8, no count is 0

Test #3:

score: -100

Wrong Answer

time: 21ms

memory: 3828kb

input:

output:

Yes
Yes
No
Yes
Yes
No
Yes
Yes
Yes
No
Yes
Yes
Yes
Yes
Yes
No
Yes
Yes
No
Yes
No
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
No
Yes
Yes
Yes
Yes
No
Yes
Yes
Yes
Yes
Yes
No
Yes
No
Yes
No
Yes
Yes
Yes
No
Yes
Yes
Yes
Yes
Yes
No
Yes
Yes
Yes
No
No
Yes
Yes
Yes
Yes
Yes
Yes
Yes
No
Yes
Yes
No
No
Yes
No...

result:

wrong answer expected NO, found YES [4th token]