QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#369122	#6506. Chase Game 3	bigJ	WA	19ms	3636kb	C++20	687b	2024-03-27 20:50:49	2024-03-27 20:50:49

Judging History

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

[2024-03-27 20:50:49]
评测

测评结果：WA
用时：19ms
内存：3636kb

查看

[2024-03-27 20:50:49]
提交

answer

#include <bits/stdc++.h>

using i64 = int64_t;

namespace stdr = std::ranges;
namespace stdv = std::views;

void solve() {
    int n;
    std::cin >> n;

    std::vector<int> p(n);
    std::vector<int> nxt(n, -1);
    for (int i = 0; i < n; i++) {
        std::cin >> p[i];
        p[i]--;
    }

    for (int i = 0; i < n - 1; i++) {
        if (std::abs(p[i] - p[i + 1]) >= 3) {
            std::cout << "No\n";
            return;
        }
    }

    std::cout << "Yes\n";
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    int t;
    std::cin >> t;

    while (t--) {
        solve();
    }

    return 0;
}

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3608kb

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

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

memory: 3636kb

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]