Submission #844998


Source Code Expand

Copy
#include <bits/stdc++.h>

using namespace std;
#define mp make_pair
#define pb push_back
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
typedef long long LL;
typedef pair<int, int> PII;

int n;
int a[100005], ord[100005];

inline bool cmp(const int &lhs, const int &rhs) {
    return a[lhs] < a[rhs];
}

int main() {
    scanf("%d", &n);
    forn(i, n) scanf("%d", a + i);
    forn(i, n) ord[i] = i;
    sort(ord, ord + n, cmp);
    int cnt = 0;
    forn(i, n) if (ord[i] % 2 != i % 2) {
        ++cnt;
    }
    cout << cnt / 2 << endl;
    return 0;
}

Submission Info

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

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:18:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
                    ^
./Main.cpp:19:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     forn(i, n) scanf("%d", a + i);
                                  ^

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 48 ms 1024 KB
02.txt AC 46 ms 1024 KB
03.txt AC 47 ms 1024 KB
04.txt AC 47 ms 1024 KB
05.txt AC 42 ms 1024 KB
06.txt AC 42 ms 1024 KB
07.txt AC 44 ms 1024 KB
08.txt AC 31 ms 1024 KB
09.txt AC 31 ms 1024 KB
10.txt AC 29 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 42 ms 1024 KB
15.txt AC 42 ms 1024 KB
16.txt AC 42 ms 1024 KB
17.txt AC 42 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