Submission #845229


Source Code Expand

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

const int MAX_N = 100030;    // Change as necessary

int A[MAX_N];
pair<int,int> B[MAX_N];

int main(){
  int n; cin >> n;
  for(int i=0;i<n;i++) cin >> A[i];
  for(int i=0;i<n;i++) B[i] = make_pair(A[i],i%2);
  
  sort(B,B+n);
  
  int ctr[2] = {0};
  for(int i=0;i<n;i++)
    if((i%2) != (B[i].second%2))
      ctr[i%2]++;
  
  assert(ctr[0] == ctr[1]);
  cout << ctr[0] << endl;
  
  return 0;
}

Submission Info

Submission Time
Task C - BBuBBBlesort!
User MathCrusader
Language C++14 (GCC 5.4.1)
Score 600
Code Size 471 Byte
Status AC
Exec Time 96 ms
Memory 1536 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 96 ms 1408 KB
02.txt AC 96 ms 1408 KB
03.txt AC 95 ms 1408 KB
04.txt AC 95 ms 1408 KB
05.txt AC 74 ms 1408 KB
06.txt AC 74 ms 1408 KB
07.txt AC 74 ms 1408 KB
08.txt AC 64 ms 1536 KB
09.txt AC 64 ms 1408 KB
10.txt AC 64 ms 1408 KB
11.txt AC 65 ms 1408 KB
12.txt AC 65 ms 1408 KB
13.txt AC 64 ms 1408 KB
14.txt AC 73 ms 1408 KB
15.txt AC 74 ms 1408 KB
16.txt AC 73 ms 1408 KB
17.txt AC 73 ms 1408 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