Submission #1499576
Source Code Expand
#include<bits/stdc++.h>
using namespace std;
#define FOR(i, s, e) for(int i = (s); i < (e); i++)
#define FOE(i, s, e) for(int i = (s); i <= (e); i++)
#define FOD(i, s, e) for(int i = (s); i >= (e); i--)
#define ll long long
int A[100005], B[100005], n;
map<int, int> M;
int main ()
{
scanf("%d", &n);
FOR(i, 0, n) { scanf("%d", &A[i]); B[i] = A[i]; }
sort(B, B + n);
FOR(i, 0, n) M.insert(make_pair(A[i], i % 2));
int ans = 0;
FOR(i, 0, n)
{
if (i % 2 != M.find(B[i]) -> second) ans++;
}
printf("%d\n", ans / 2);
return 0;
}
Submission Info
Submission Time |
|
Task |
C - BBuBBBlesort! |
User |
vjudge1 |
Language |
C++14 (GCC 5.4.1) |
Score |
600 |
Code Size |
547 Byte |
Status |
AC |
Exec Time |
56 ms |
Memory |
5760 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:14:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &n);
^
./Main.cpp:15:35: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
FOR(i, 0, n) { scanf("%d", &A[i]); B[i] = A[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 |
55 ms |
5760 KB |
02.txt |
AC |
55 ms |
5760 KB |
03.txt |
AC |
56 ms |
5760 KB |
04.txt |
AC |
55 ms |
5760 KB |
05.txt |
AC |
54 ms |
5760 KB |
06.txt |
AC |
53 ms |
5760 KB |
07.txt |
AC |
54 ms |
5760 KB |
08.txt |
AC |
43 ms |
5760 KB |
09.txt |
AC |
44 ms |
5760 KB |
10.txt |
AC |
44 ms |
5760 KB |
11.txt |
AC |
43 ms |
5760 KB |
12.txt |
AC |
42 ms |
5760 KB |
13.txt |
AC |
42 ms |
5760 KB |
14.txt |
AC |
54 ms |
5760 KB |
15.txt |
AC |
53 ms |
5760 KB |
16.txt |
AC |
54 ms |
5760 KB |
17.txt |
AC |
53 ms |
5760 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 |