QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#544336	#6506. Chase Game 3	haze^#	WA	12ms	3560kb	C++20	1.7kb	2024-09-02 15:15:02	2024-09-02 15:15:02

Judging History

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

[2024-09-02 15:15:02]
评测

测评结果：WA
用时：12ms
内存：3560kb

查看

[2024-09-02 15:15:02]
提交

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;
    b = a;
    for(int i = 0; i < n - 1; ++ i){
        if(b[i] == b[i + 1] + 1
        && (i + 2 >= n || b[i + 1] != b[i + 2] + 1)){
            swap(b[i], b[i + 1]);
        }
    }
    irep(i, 0, n - 1){
        if(b[i] != i)ok = 0;
    }
    if(ok){
        cout << "Yes\n";
        return;
    }
    reverse(a.begin(), a.end());
    ok = 1;
    b = a;
    for(int i = 0; i < n - 1; ++ i){
        if(b[i] == b[i + 1] + 1
           && (i + 2 >= n || b[i + 1] != b[i + 2] + 1)){
            swap(b[i], b[i + 1]);
        }
    }
    irep(i, 0, n - 1){
        if(b[i] != i)ok = 0;
    }
    if(ok){
        cout << "Yes\n";
        return;
    }
    cout << "No\n";

}

signed main() {
    // IOS
    int T = read();
    while (T--) {
        solve();
    }
    return 0;
}

源文件, 语言: C++20

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 3504kb

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

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

memory: 3516kb

input:

output:

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

result:

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