Task: | Sorting |
Sender: | ritul_kr_singh |
Submission time: | 2021-01-30 18:22:31 +0200 |
Language: | C++ (C++11) |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | WRONG ANSWER | 0 |
#2 | WRONG ANSWER | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | WRONG ANSWER | 0.01 s | 1, 2 | details |
#2 | WRONG ANSWER | 0.01 s | 2 | details |
#3 | WRONG ANSWER | 0.01 s | 1, 2 | details |
#4 | WRONG ANSWER | 0.01 s | 1, 2 | details |
Code
#include <bits/stdc++.h>using namespace std;//#define int long longint a[100], pos[100], n, ok;void exchange(int i, int j){if(i<0 || j<0 || i+1>=n || j+1>=n){ok = 0;return;}swap(a[i], a[j]);swap(pos[a[i]], pos[a[j]]);++i; ++j;swap(a[i], a[j]);swap(pos[a[i]], pos[a[j]]);}signed main(){ios_base::sync_with_stdio(false); cin.tie(nullptr);int t; cin >> t;while(t--){cin >> n;ok=1;for(int i=0; i<n; ++i) cin >> a[i];for(int i=0; i<n; ++i) --a[i];for(int i=0; i<n; ++i){pos[a[i]] = i;}for(int i=0; i<n && ok; ++i){int ind = pos[i];if(ind==i) continue;if(ind==n-1){if(n-4<i) ok = 0;else{exchange(n-4, n-2);}}else if(ind==i+1){if(i+4>=n) ok = 0;else{exchange(i+1, i+3);}}else{exchange(i, ind);}}if(ok) cout << "YES\n";else cout << "NO\n";}}
Test details
Test 1
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
153 1 1 2 1 2 ... |
correct output |
---|
YES YES NO NO NO ... |
user output |
---|
YES YES NO NO NO ... Truncated |
Test 2
Group: 2
Verdict: WRONG ANSWER
input |
---|
1000 59 35 29 32 50 11 15 9 21 19 45 2... |
correct output |
---|
YES NO YES NO YES ... |
user output |
---|
NO NO NO NO NO ... Truncated |
Test 3
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
720 6 1 6 4 5 2 3 6 6 3 2 1 5 4 ... |
correct output |
---|
YES NO NO NO YES ... |
user output |
---|
NO NO NO YES NO ... Truncated |
Test 4
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 8 7 4 2 8 6 3 5 1 8 3 8 2 7 5 4 6 1 ... |
correct output |
---|
NO NO YES NO YES ... |
user output |
---|
NO NO NO NO NO ... Truncated |