QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#109567	#6506. Chase Game 3	2811928366	TL	2ms	3372kb	C++14	590b	2023-05-29 19:16:42	2023-05-29 19:16:44

Judging History

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

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2023-05-29 19:16:44]
评测

测评结果：TL
用时：2ms
内存：3372kb

查看

[2023-05-29 19:16:42]
提交

answer

#include<bits/stdc++.h>
using namespace std;
const int MAXN = 4e5 + 10;
int main() {
    long long T;
    cin >> T;
    for (long long i = 0; i < T; i++) {
        long long n;
        bool go = true;
        cin >> n;
        vector<int>str(n);
        for (int j = 0; j < n; j++) {
            cin >> str[j];
            if (j != 0 && abs(str[j - 1] - str[j]) >= 3) {
                go = false;
            }
        }
        if (go) {
            cout << "Yes" << endl;
        }
        else {
            cout << "No" << endl;
        }
    }
    return 0;
}

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 2ms

memory: 3372kb

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

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

Time Limit Exceeded

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