— Dark mode

Datatähti Open 2021

Sorting

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

Code

#include <bits/stdc++.h>
using namespace std;
const int MAXN = 105;
using lint = long long;

void solve(){
	int n; cin >> n;
	vector<int> a(n);
	for(auto &i : a) cin >> i;
	int ret = 0;
	for(int i=0; i<n; i++){
		for(int j=i+1; j<n; j++){
			if(a[j] < a[i]) ret++;
		}
	}
	if(ret % 4 == 0) puts("YES");
	else puts("NO");
}

int main(){
	int t; cin >> t;
	while(t--) solve();
}

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 (koosaga)

1:21:37 1000:19:10 0