QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#665169	#6506. Chase Game 3	Ryan123	WA	18ms	3756kb	C++14	408b	2024-10-22 08:28:34	2024-10-22 08:28:34

Judging History

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

[2024-10-22 08:28:34]
评测

测评结果：WA
用时：18ms
内存：3756kb

查看

[2024-10-22 08:28:34]
提交

answer

#include<bits/stdc++.h>
using namespace std;

const int N = 1e6 + 5;

int w[N];

void solve(){
    int n;
    scanf("%d", &n);

    for(int i = 1; i <= n; i ++)scanf("%d", &w[i]);

    bool flg = 1;
    for(int i = 1; i < n; i ++)flg &= (abs(w[i] - w[i + 1]) <= 2);

    if(flg)puts("Yes");
    else puts("No");
}

int main(){
    int T;
    scanf("%d", &T);
    while(T --)solve();
}

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3600kb

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

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: 18ms

memory: 3624kb

input:

output:

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

result:

wrong answer expected YES, found NO [1st token]