Submission #845427


Source Code Expand

Copy
#include <cstdio>
#include <algorithm>
using namespace std;

int main()
{
  int n;
  scanf("%d",&n);
  static int a[100000],A[100000];
  for(int i=0;i<n;i++){
    scanf("%d",a+i);
    A[i]=a[i];
  }
  sort(A,A+n);
  int b=0,c=0;
  for(int i=0;i<n;i++){
    int k=lower_bound(A,A+n,a[i])-A;
    if(i%2==0&&k%2==1){
      b++;
    }
    if(i%2==1&&k%2==0){
      c++;
    }
  }
  printf("%d\n",min(b,c));
  return 0;
}

Submission Info

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

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:8:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&n);
                 ^
./Main.cpp:11:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     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 54 ms 896 KB
02.txt AC 54 ms 896 KB
03.txt AC 53 ms 896 KB
04.txt AC 54 ms 896 KB
05.txt AC 49 ms 896 KB
06.txt AC 51 ms 896 KB
07.txt AC 49 ms 896 KB
08.txt AC 31 ms 896 KB
09.txt AC 31 ms 896 KB
10.txt AC 31 ms 896 KB
11.txt AC 31 ms 896 KB
12.txt AC 31 ms 896 KB
13.txt AC 31 ms 896 KB
14.txt AC 50 ms 896 KB
15.txt AC 50 ms 896 KB
16.txt AC 49 ms 896 KB
17.txt AC 50 ms 896 KB
18.txt AC 2 ms 128 KB
19.txt AC 2 ms 128 KB
20.txt AC 2 ms 128 KB
21.txt AC 2 ms 128 KB
22.txt AC 2 ms 128 KB
s1.txt AC 2 ms 128 KB
s2.txt AC 2 ms 128 KB