Submission #3000074


Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>

typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair


ll solve(int N, vi& a) {
    set<int> _s;
    rep(i,N) _s.insert(a[i]);
    map<int,int> _m;
    int id = 0;
    for (int si: _s) {
        _m[si] = id++;
    }
    int k = 0;
    rep(i,N) {
        int bi = _m[a[i]] % 2;
        if (bi != i%2) ++k;
    }
    k /= 2;
    return k;
}

int main() {
    int N;  cin >> N;
    vi a(N);
    rep(i,N) cin >> a[i];
    cout << solve(N,a) << endl;
    return 0;
}

Submission Info

Submission Time
Task C - BBuBBBlesort!
User naoya_t
Language C++14 (GCC 5.4.1)
Score 600
Code Size 1650 Byte
Status
Exec Time 124 ms
Memory 9984 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 s1.txt, s2.txt
All 600 / 600 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 123 ms 9984 KB
02.txt 123 ms 9984 KB
03.txt 124 ms 9984 KB
04.txt 123 ms 9984 KB
05.txt 112 ms 9984 KB
06.txt 111 ms 9984 KB
07.txt 112 ms 9984 KB
08.txt 83 ms 9984 KB
09.txt 83 ms 9984 KB
10.txt 85 ms 9984 KB
11.txt 83 ms 9984 KB
12.txt 85 ms 9984 KB
13.txt 80 ms 9984 KB
14.txt 116 ms 9984 KB
15.txt 112 ms 9984 KB
16.txt 111 ms 9984 KB
17.txt 112 ms 9984 KB
18.txt 1 ms 256 KB
19.txt 1 ms 256 KB
20.txt 1 ms 256 KB
21.txt 1 ms 256 KB
22.txt 1 ms 256 KB
s1.txt 1 ms 256 KB
s2.txt 1 ms 256 KB