QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#544370	#6506. Chase Game 3	haze^#	WA	14ms	3764kb	C++20	2.0kb	2024-09-02 15:45:57	2024-09-02 15:45:57

Judging History

This is the latest submission verdict.

[2024-09-02 15:45:57]
Judged

Verdict: WA
Time: 14ms
Memory: 3764kb

Show

[2024-09-02 15:45:57]
Submitted

answer

/*

Author: Haze

2024/9/2

*/

#include <bits/stdc++.h>

#define irep(i, l, r) for(int i = (l); i <= (r); ++ i)
#define drep(i, r, l) for(int i = (r); i >= (l); -- i)
#define IOS ios::sync_with_stdio(false), cin.tie(nullptr);
using namespace std;
typedef long long ll;
#define int long long
inline ll readL() {
    ll s = 0;
    bool fl = false;
    char ch = (char) getchar();
    while (!isdigit(ch)) {
        if (ch == '-')fl = true;
        ch = (char) getchar();
    }
    while (isdigit(ch)) {
        s = s * 10 + (ch ^ 48);
        ch = (char) getchar();
    }
    return fl ? -s : s;
}

inline int read() {
    return (int) (readL());
}

const int mod = 1000000000 + 7;
const int itinf = 1000000999;
const ll llinf = 2e18;
const int N = 500099;

void solve() {
    int n = read();
    vector<int>a(n);
    irep(i, 0, n - 1){
        a[i] = read() - 1;
    }

//    int ok = 1;
    vector<int>b;
    for(int i = 0; i < n - 1; ++ i){
        int d = a[i + 1] - a[i];
        b.push_back(d);
    }
    int S = -1000000000;
    int sp = -1000000000;
    int last = S;
    auto nxt = [](int x){
        if(x > 0)return -(x + 1);
        return -x + 1;
    };
    auto fr = [](int x){
        if(x > 0)return -x + 1;
        return -(x + 1);
    };
    for(int i = 0; i < b.size(); ){
        if(last == b[i] and b[i] == 2){
            last = S;
            ++ i;
        }
        last = b[i];
        if(b[i] == 1 || b[i] == -1){
            while(i + 1 < b.size() && b[i + 1] == nxt(b[i]))
                ++ i;
            ++ i;
        }
        else{
            while(i + 1 < b.size() && b[i + 1] == fr(b[i]))
                ++ i;
            if(b[i] != 1 and b[i] != -1){
                cout << "No\n";
                return;
            }
            ++ i;
        }
    }
    cout << "Yes\n";
}

signed main() {
    // IOS
    int T = read();
    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: 3464kb

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

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

memory: 3764kb

input:

output:

Yes
Yes
No
No
Yes
Yes
No
No
No
No
Yes
Yes
No
Yes
No
No
Yes
No
Yes
No
Yes
No
Yes
No
Yes
Yes
No
No
No
Yes
No
Yes
No
No
Yes
No
No
No
No
Yes
No
No
No
No
Yes
Yes
No
Yes
No
No
No
No
Yes
Yes
No
Yes
No
Yes
Yes
No
No
No
Yes
Yes
No
Yes
Yes
Yes
Yes
Yes
Yes
Yes
No
Yes
Yes
Yes
No
No
Yes
No
Yes
No
Yes
No
No
No
Ye...

result:

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