— Dark mode

Datatähti Open 2021

Sorting

  • Start: N/A
  • End: N/A
Submission details
Task:Sorting
Sender:mofk
Submission time:2021-01-30 16:40:08 +0200
Language:C++ (C++17)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
Test results
testverdicttimegroup
#10.01 s1, 2details
#20.01 s2details
#30.01 s1, 2details
#40.01 s1, 2details

Code

#include <bits/stdc++.h>

using namespace std;

int main(void) {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int ntest;
    cin >> ntest;
    while (ntest--) {
        int n;
        cin >> n;
        vector<int> a(n);
        int ans = 0;
        for (int i = 0; i < n; ++i) {
            cin >> a[i];
            for (int j = 0; j < i; ++j) if (a[j] > a[i]) ++ans;
        }
        cout << (ans % 4 ? "NO" : "YES") << endl;
    }
    return 0;
}

Test details

Test 1

Group: 1, 2

Verdict:

input
153
1
1
2
1 2
...
view save

correct output
YES
YES
NO
NO
NO
...
view save

user output
YES
YES
NO
NO
NO
...
Truncated

Test 2

Group: 2

Verdict:

input
1000
59
35 29 32 50 11 15 9 21 19 45 2...
view save

correct output
YES
NO
YES
NO
YES
...
view save

user output
NO
NO
NO
NO
NO
...
Truncated

Test 3

Group: 1, 2

Verdict:

input
720
6
1 6 4 5 2 3
6
6 3 2 1 5 4
...
view save

correct output
YES
NO
NO
NO
YES
...
view save

user output
YES
NO
NO
NO
NO
...
Truncated

Test 4

Group: 1, 2

Verdict:

input
1000
8
7 4 2 8 6 3 5 1
8
3 8 2 7 5 4 6 1
...
view save

correct output
NO
NO
YES
NO
YES
...
view save

user output
NO
NO
NO
NO
YES
...
Truncated

Tasks

A Greater Integers-B Split in Three-C Sorting-D Distances-E Programmers-F Polygonal Chain-

Submissions (mofk)

0:48:00 1000:35:46 00:27:36 00:22:37 0