QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#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
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();
}
Details
Tip: Click on the bar to expand more detailed information
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:
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: 20ms
memory: 3872kb
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 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]