QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#368064#6506. Chase Game 3HuLiangyu#WA 17ms3684kbC++141.1kb2024-03-26 19:31:582024-03-26 19:32:00

Judging History

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

  • [2024-03-26 19:32:00]
  • 评测
  • 测评结果:WA
  • 用时:17ms
  • 内存:3684kb
  • [2024-03-26 19:31:58]
  • 提交

answer

#include <iostream>

using namespace std;

const int N = 4e5+100;
int a[N], n;

void sol() {
    cin >> n;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
    }
    int l = 1, r = n;
    int num = n;
    if (a[l] == 1) {
        int p = 2;
        while (l + 1 <= r && a[l + 1] == p) {
            l++;
            p++;
            num --;
        }
    } else if (a[l] == n) {
        int p = n - 1;
        while (l + 1 <= r && a[l + 1] == p) {
            l++;
            p--;
            num --;

        }
    }
    if (a[r] == n) {
        int p = n - 1;
        while (l <= r - 1 && a[r - 1] == p) {
            r--;
            p--;
            num --;

        }
    } else if (a[r] == 1) {
        int p = 2;
        while (l <= r - 1 && a[r - 1] == p) {
            r--;
            p++;
            num --;

        }
    }
    if (num > 3) {
        cout << "No\n";
    } else {
        cout << "Yes\n";
    }
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int T;
    cin >> T;
    while (T --) {
        sol();
    }
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3684kb

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

input:

8
2
1 2
2
2 1
3
1 2 3
3
3 1 2
3
2 1 3
3
2 3 1
3
3 2 1
3
1 3 2

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: 17ms
memory: 3644kb

input:

100000
4
4 1 3 2
4
3 2 4 1
4
3 2 1 4
4
2 4 3 1
4
1 2 3 4
4
2 3 1 4
4
1 3 4 2
4
3 4 1 2
4
1 3 2 4
4
1 4 3 2
4
3 4 2 1
4
3 2 4 1
4
4 2 3 1
4
3 2 4 1
4
4 1 2 3
4
3 2 1 4
4
4 1 3 2
4
1 3 4 2
4
1 4 2 3
4
2 4 3 1
4
2 3 1 4
4
4 2 3 1
4
2 1 3 4
4
3 1 2 4
4
1 2 3 4
4
4 3 2 1
4
3 4 1 2
4
1 3 2 4
4
4 2 1 3
4
3...

output:

No
No
No
No
Yes
No
No
No
No
No
Yes
No
No
No
No
No
No
No
No
No
No
No
Yes
No
Yes
Yes
No
No
No
No
No
Yes
No
No
Yes
No
No
No
No
No
No
No
No
No
Yes
No
No
No
No
No
No
No
Yes
Yes
No
Yes
No
Yes
Yes
No
No
No
Yes
No
No
No
Yes
Yes
Yes
Yes
Yes
Yes
No
No
Yes
Yes
No
No
Yes
No
Yes
No
Yes
No
No
No
Yes
No
No
No
No
N...

result:

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