QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#369618	#6506. Chase Game 3	Nanani^#	WA	37ms	3852kb	C++20	1.6kb	2024-03-28 15:28:12	2024-03-28 15:28:13

Judging History

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

[2024-03-28 15:28:13]
评测

测评结果：WA
用时：37ms
内存：3852kb

查看

[2024-03-28 15:28:12]
提交

answer

//by 72
#include<bits/stdc++.h>
#define F(i, a, b) for(int i = a; i <= b; i ++)
#define Fd(i, a, b) for(int i = a; i >= b; i --)
#define pb push_back
#define pii pair<int, int>
#define fi first
#define se second
#define int long long
using namespace std;

const int mod = 998244353;
const int N = 4e5 + 10;
const int inf = 1e18;
typedef array<int, 3> a3; 
typedef long long ll;

int n, m, p[N];

void sol() {
    cin >> n;
    F(i, 1, n) cin >> p[i];
    // if(n <= 3) {
    //     cout << "Yes\n";
    //     return;
    // }
    int vst1 = 0, vst2 = 0;
    vector<vector<int>> rc(n + 1);
    F(i, 1, n) {
        rc[i].pb(p[i]);
        if(i != 1) rc[i].pb(p[i - 1]);
        if(i != n) rc[i].pb(p[i + 1]);
        sort(rc[i].begin(), rc[i].end());
        int ok1 = 0, ok2 = 0;
        int cnt1 = 0, cnt2 = 0, flag1 = 3, flag2 = 3;
        if(p[1] == 1 || p[1] == n) flag1 = 2;
        if(p[n] == 1 || p[n] == n) flag2 = 2;
        for(auto x : rc[i]) {
            if(p[1] == x) cnt1 ++;
            if(p[n] == x) cnt2 ++;
            if(p[1] != 1 && p[1] - 1 == x) cnt1 ++;    
            if(p[n] != 1 && p[n] - 1 == x) cnt2 ++;    
            if(p[1] != n && p[1] + 1 == x) cnt1 ++;    
            if(p[n] != n && p[n] + 1 == x) cnt2 ++;    
        }
        ok1 = (cnt1 == flag1), ok2 = (cnt2 == flag2);
        vst1 |= ok1, vst2 |= ok2;
    }

    if(vst1 && vst2) cout << "Yes\n";
    else cout << "No\n";
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t; cin >> t;
    F(i, 1, t) sol();
    return 0;
}
//sldl

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3544kb

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

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: 0

Accepted

time: 37ms

memory: 3848kb

input:

output:

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

result:

ok 100000 token(s): yes count is 49924, no count is 50076

Test #4:

score: -100

Wrong Answer

time: 32ms

memory: 3852kb

input:

40320
8
6 4 5 1 7 2 8 3
8
6 4 5 1 8 2 7 3
8
7 4 5 1 6 2 8 3
8
7 4 5 1 8 2 6 3
8
8 4 5 1 6 2 7 3
8
8 4 5 1 7 2 6 3
8
5 4 6 1 7 2 8 3
8
5 4 6 1 8 2 7 3
8
7 4 6 1 5 2 8 3
8
7 4 6 1 8 2 5 3
8
8 4 6 1 5 2 7 3
8
8 4 6 1 7 2 5 3
8
5 4 7 1 6 2 8 3
8
5 4 7 1 8 2 6 3
8
6 4 7 1 5 2 8 3
8
6 4 7 1 8 2 5 3
8
8 4 ...

output:

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

result:

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