Submission #1380778
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pll> P;
const ll INF = 1ll<<30;
const ll MOD = 1000000007;
const double EPS = 1e-10;
int N;
int a[112345];
int main() {
cin >> N;
REP(i, N) scanf("%d", a + i);
vector<int> cx;
REP(i, N) cx.push_back(a[i]);
sort(ALL(cx));
REP(i, N) a[i] = lower_bound(ALL(cx), a[i]) - cx.begin();
vector<int> v[2];
REP(i, N) {
if (i & 1) v[1].push_back(a[i]);
else v[0].push_back(a[i]);
}
int even = 0, odd = 0;
REP(i, v[0].size()) if (v[0][i] & 1) even++;
REP(i, v[1].size()) if (v[1][i] & 1 == 0) odd++;
cout << abs(even - odd) << endl;
return 0;
}
Submission Info
Submission Time
2017-06-25 16:19:13+0900
Task
C - BBuBBBlesort!
User
tkmst201
Language
C++14 (GCC 5.4.1)
Score
600
Code Size
1107 Byte
Status
AC
Exec Time
30 ms
Memory
1784 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:27:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
REP(i, N) scanf("%d", 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
30 ms
1784 KB
02.txt
AC
30 ms
1784 KB
03.txt
AC
30 ms
1784 KB
04.txt
AC
30 ms
1784 KB
05.txt
AC
28 ms
1784 KB
06.txt
AC
28 ms
1784 KB
07.txt
AC
28 ms
1784 KB
08.txt
AC
18 ms
1784 KB
09.txt
AC
18 ms
1784 KB
10.txt
AC
17 ms
1784 KB
11.txt
AC
17 ms
1784 KB
12.txt
AC
18 ms
1784 KB
13.txt
AC
18 ms
1784 KB
14.txt
AC
28 ms
1784 KB
15.txt
AC
28 ms
1784 KB
16.txt
AC
28 ms
1784 KB
17.txt
AC
28 ms
1784 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