Submission #1308014
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define DUMP(x) cerr << #x << "=" << x << endl
#define DUMP2(x, y) cerr<<"("<<#x<<", "<<#y<<") = ("<<x<<", "<<y<<")"<< endl
#define BINARY(x) static_cast<bitset<16> >(x)
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define REP(i,m,n) for (int i=m;i<(int)(n);i++)
#define in_range(x, y, w, h) (0<=(int)(x) && (int)(x)<(int)(w) && 0<=(int)(y) && (int)(y)<(int)(h))
#define ALL(a) (a).begin(),(a).end()
typedef long long ll;
const int INF = 1e9;
const ll INFLL = 1e18;
typedef pair<int, int> PII;
int dx[4]={0, -1, 1, 0}, dy[4]={-1, 0, 0, 1};
class BIT {
int n;
vector<int> dat;
public:
BIT(int _n) : n(_n), dat(vector<int>(_n+1)) {}
void add(int i, int x)
{
while (i <= n) {
dat[i] += x;
i += i & -i;
}
}
int sum(int i)
{
int res = 0;
while (i > 0) {
res += dat[i];
i -= i & -i;
}
return res;
}
// [l, r]
int sum(int l, int r)
{
return sum(r) - sum(l-1);
}
};
int main()
{
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<PII> A(N);
rep(i, N) {
cin >> A[i].first;
A[i].second = i;
}
sort(ALL(A));
int ans = 0;
rep(i, N) {
if (i%2 != A[i].second%2) ans++;
}
cout << ans/2 << endl;
}
Submission Info
Submission Time |
|
Task |
C - BBuBBBlesort! |
User |
OUDON |
Language |
C++14 (GCC 5.4.1) |
Score |
600 |
Code Size |
1443 Byte |
Status |
AC |
Exec Time |
19 ms |
Memory |
1024 KB |
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 |
19 ms |
1024 KB |
02.txt |
AC |
19 ms |
1024 KB |
03.txt |
AC |
19 ms |
1024 KB |
04.txt |
AC |
19 ms |
1024 KB |
05.txt |
AC |
17 ms |
1024 KB |
06.txt |
AC |
17 ms |
1024 KB |
07.txt |
AC |
16 ms |
1024 KB |
08.txt |
AC |
12 ms |
1024 KB |
09.txt |
AC |
11 ms |
1024 KB |
10.txt |
AC |
11 ms |
1024 KB |
11.txt |
AC |
11 ms |
1024 KB |
12.txt |
AC |
11 ms |
1024 KB |
13.txt |
AC |
11 ms |
1024 KB |
14.txt |
AC |
17 ms |
1024 KB |
15.txt |
AC |
17 ms |
1024 KB |
16.txt |
AC |
16 ms |
1024 KB |
17.txt |
AC |
17 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 |