Submission #1680261
Source Code Expand
//2017-10-13
//miaomiao
//
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
using namespace std;
#define For(i, a, b) for(int i = (a); i <= (int)(b); ++i)
#define N (100000+5)
int ra[N], a[N];
int main(){
int n;
scanf("%d", &n);
For(i, 1, n) scanf("%d", &ra[i]), a[i] = ra[i];
int ans = 0;
sort(ra+1, ra+n+1);
For(i, 1, n){
a[i] = lower_bound(ra+1, ra+n+1, a[i]) - ra;
if((i&1) ^ (a[i]&1)) ++ans;
}
// printf("ans = %d\n", ans);
printf("%d\n", ans >> 1);
return 0;
}
Submission Info
Submission Time |
|
Task |
C - BBuBBBlesort! |
User |
miaomiao |
Language |
C++14 (GCC 5.4.1) |
Score |
600 |
Code Size |
588 Byte |
Status |
AC |
Exec Time |
30 ms |
Memory |
1024 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:20:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &n);
^
./Main.cpp:21:48: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
For(i, 1, n) scanf("%d", &ra[i]), a[i] = ra[i];
^
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
600 / 600 |
Status |
|
|
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 |
30 ms |
1024 KB |
02.txt |
AC |
30 ms |
1024 KB |
03.txt |
AC |
30 ms |
1024 KB |
04.txt |
AC |
30 ms |
1024 KB |
05.txt |
AC |
28 ms |
1024 KB |
06.txt |
AC |
28 ms |
1024 KB |
07.txt |
AC |
28 ms |
1024 KB |
08.txt |
AC |
17 ms |
1024 KB |
09.txt |
AC |
17 ms |
1024 KB |
10.txt |
AC |
17 ms |
1024 KB |
11.txt |
AC |
17 ms |
1024 KB |
12.txt |
AC |
17 ms |
1024 KB |
13.txt |
AC |
17 ms |
1024 KB |
14.txt |
AC |
27 ms |
1024 KB |
15.txt |
AC |
29 ms |
1024 KB |
16.txt |
AC |
28 ms |
1024 KB |
17.txt |
AC |
28 ms |
1024 KB |
18.txt |
AC |
1 ms |
256 KB |
19.txt |
AC |
1 ms |
256 KB |
20.txt |
AC |
1 ms |
256 KB |
21.txt |
AC |
1 ms |
256 KB |
22.txt |
AC |
1 ms |
256 KB |
s1.txt |
AC |
1 ms |
256 KB |
s2.txt |
AC |
1 ms |
256 KB |