| Task: | Järjestäminen |
| Sender: | jubidubi |
| Submission time: | 2021-01-23 17:32:09 +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;
using ll = long long;
const int N = 1 << 7;
int p[2*N];
int sum(int a, int b) {
a += N;
b += N;
int s = 0;
while (a <= b) {
if (a % 2 == 1) s += p[a++];
if (b % 2 == 0) s += p[b--];
a /= 2;
b /= 2;
}
return s;
}
void add(int k) {
k += N;
++p[k];
for (k /= 2; k >= 1; k /= 2) {
p[k] = p[2 * k] + p[2 * k + 1];
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
for (int i = 0; i < 2*N; ++i) p[i] = 0;
int s = 0;
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
s += sum(x + 1, N - 1);
add(x);
}
if (s % 2 != 0 || s == 2) cout << "NO\n";
else cout << "YES\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 |
|---|
| YES NO YES NO YES ... 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 |
|---|
| YES NO NO NO YES ... 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 YES NO YES ... Truncated |
