Submission #845544


Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;

const int N = (int) 1e5;
int a[N], b[N], n;

int main() {
    ios::sync_with_stdio(false);
    cin >> n;
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
        b[i] = a[i];
    }
    sort(b, b + n);
    for (int i = 0; i < n; ++i) a[i] = lower_bound(b, b + n, a[i]) - b;
    int res = 0;
    for (int i = 0; i < n; ++i) if (a[i] % 2 != i % 2) ++res;
    cout << res / 2 << '\n';
    return 0;
}

Submission Info

Submission Time
Task C - BBuBBBlesort!
User dnk
Language C++14 (GCC 5.4.1)
Score 600
Code Size 470 Byte
Status AC
Exec Time 54 ms
Memory 1024 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 600 / 600
Status
AC × 2
AC × 24
Set Name Test Cases
Sample s1.txt, s2.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, s1.txt, s2.txt
Case Name Status Exec Time Memory
01.txt AC 53 ms 1024 KB
02.txt AC 54 ms 1024 KB
03.txt AC 52 ms 1024 KB
04.txt AC 54 ms 1024 KB
05.txt AC 48 ms 1024 KB
06.txt AC 49 ms 1024 KB
07.txt AC 48 ms 1024 KB
08.txt AC 30 ms 1024 KB
09.txt AC 30 ms 1024 KB
10.txt AC 30 ms 1024 KB
11.txt AC 29 ms 1024 KB
12.txt AC 30 ms 1024 KB
13.txt AC 30 ms 1024 KB
14.txt AC 50 ms 1024 KB
15.txt AC 50 ms 1024 KB
16.txt AC 50 ms 1024 KB
17.txt AC 50 ms 1024 KB
18.txt AC 4 ms 256 KB
19.txt AC 4 ms 256 KB
20.txt AC 4 ms 256 KB
21.txt AC 4 ms 256 KB
22.txt AC 4 ms 256 KB
s1.txt AC 4 ms 256 KB
s2.txt AC 4 ms 256 KB