QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#382816	#6506. Chase Game 3	paoxiaomo^#	WA	20ms	3872kb	C++20	971b	2024-04-08 19:22:50	2024-04-08 19:22:51

Judging History

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

[2024-04-08 19:22:51]
评测

测评结果：WA
用时：20ms
内存：3872kb

查看

[2024-04-08 19:22:50]
提交

answer

#include <bits/stdc++.h>
#define int long long
using namespace std;
using vi = vector<int>;
#define endl '\n'

void solve()
{
    int n;
    cin >> n;
    vector<int> v(n + 1);
    bool is1 = 1, is2 = 1, is3 = 1;
    for (int i = 1; i <= n; i++)
    {
        cin >> v[i];
    }
    for (int i = 1; i <= n; i++)
    {

        if (v[i] != i)
            is1 = 0;
        if (v[i] != n - i + 1)
            is2 = 0;
    }
    for (int i = 1; i <= n; i++)
    {
        if (v[i] != i)
        {
            if (i != n && v[i - 1] == i)
                swap(v[i - 1], v[i]), i++;
            else
                is3 = 0;
        }
    }
    if (n == 2 || n == 3 || is1 || is2 || is3)
    {
        cout << "Yes" << endl;
    }
    else
    {
        cout << "No" << endl;
    }
}
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int T;
    cin >> T;
    while (T--)
        solve();
}

源文件, 语言: C++20

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 3552kb

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

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

memory: 3872kb

input:

output:

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

result:

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