CSES - Datatähti Open 2021 - Results
Submission details
Task:Sorting
Sender:socho
Submission time:2021-01-30 18:32:34 +0200
Language:C++ (C++17)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
Test results
testverdicttimegroup
#10.01 s1, 2details
#20.02 s2details
#3ACCEPTED0.01 s1, 2details
#4ACCEPTED0.01 s1, 2details

Compiler report

input/code.cpp: In function 'void usaco()':
input/code.cpp:15:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  freopen("problem.in", "r", stdin);
  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp:16:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  freopen("problem.out", "w", stdout);
  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Code

#include <bits/stdc++.h>
using namespace std;
void fast() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
}
void ran() {
srand(chrono::steady_clock::now().time_since_epoch().count());
}
long long get_rand() {
long long a = rand();
long long b = rand();
return a * (RAND_MAX + 1ll) + b;
}
void usaco() {
freopen("problem.in", "r", stdin);
freopen("problem.out", "w", stdout);
}
template<typename T>
using min_pq = priority_queue<T, vector<T>, greater<T>>;
// #define endl '\n'
// #define double long double
// #define int long long
// const int MOD = 1000 * 1000 * 1000 + 7;
// const int MOD = 998244353;
void solve() {
int n;
cin >> n;
vector<int> tr(n);
for (int i=0; i<n; i++) {
cin >> tr[i];
}
int a = 0;
for (int i=0; i<n; i++) {
for (int j=i+1; j<n; j++) {
if (tr[i] > tr[j]) a++;
}
}
cout << (a % 2 == 0 ? "YES" : "NO") << endl;
}
signed main() {
/*int n = 8;
vector<int> vc;
queue<vector<int>> tr;
for (int i=1; i<=n; i++) {
vc.push_back(i);
check[vc] = true;
tr.push(vc);
}
while (!tr.empty()) {
vector<int> vc = tr.front(); tr.pop();
int x = vc.size();
for (int i=0; i<x; i++) {
for (int j=i+2; j<x-1; j++) {
swap(vc[i], vc[j]);
swap(vc[i+1], vc[j+1]);
if (!check[vc]) {
check[vc] = true;
tr.push(vc);
}
swap(vc[i], vc[j]);
swap(vc[i+1], vc[j+1]);
}
}
}
for (auto x: check) {
work(x.first);
}*/
int t;
cin >> t;
while (t--) solve();
}

Test details

Test 1

Group: 1, 2

Verdict:

input
153
1
1
2
1 2
...

correct output
YES
YES
NO
NO
NO
...

user output
YES
YES
NO
NO
YES
...
Truncated

Test 2

Group: 2

Verdict:

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

correct output
YES
NO
YES
NO
YES
...

user output
YES
NO
YES
NO
YES
...
Truncated

Test 3

Group: 1, 2

Verdict: ACCEPTED

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
YES
NO
NO
NO
YES
...
Truncated

Test 4

Group: 1, 2

Verdict: ACCEPTED

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
YES
NO
YES
...
Truncated