Submission #1681189
Source Code Expand
#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define svec(v) cout<<#v<<":";rep(kbrni,v.size())cout<<" "<<v[kbrni];cout<<endl
#define sset(s) cout<<#s<<":";each(kbrni,s)cout<<" "<<kbrni;cout<<endl
#define smap(m) cout<<#m<<":";each(kbrni,m)cout<<" {"<<kbrni.first<<":"<<kbrni.second<<"}";cout<<endl
using namespace std;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<double> vd;
typedef vector<P> vp;
const int MAX_N = 100005;
template<typename V> class BIT {
private:
int n; vector<V> bit;
public:
void add(int i,V x){ i++; while(i < n) bit[i] += x, i += i & -i;}
V sum(int i){i++; V s = 0; while(i>0) s += bit[i], i -= i & -i; return s;}
BIT(int sz){ n = sz + 1, bit.resize(n,0);} //初期値がすべて0の場合
BIT(vector<V> v){n = (int)v.size()+1; bit.resize(n); rep(i,n-1) add(i,v[i]);}
void print(){ rep(i,n-1)cout<<sum(i)-sum(i-1)<< " ";cout<<endl;}
void print_sum(){ rep(i,n)cout<<sum(i-1)<<" ";cout<<endl;} //-1スタート
};
map<int,int> mp;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vi vec(n);
vi ev((n+1)/2),od(n/2);
rep(i,n){
cin >> vec[i];
if(i % 2 == 0){
ev[i/2] = vec[i];
}else{
od[i/2] = vec[i];
}
}
sort(all(ev)),sort(all(od));
sort(all(vec));
rep(i,n){
mp[vec[i]] = i;
}
rep(i,n){
if(i % 2 == 0){
vec[i] = mp[ev[i/2]];
}else{
vec[i] = mp[od[i/2]];
}
}
BIT<int> bt(n);
ll ans = 0;
rep(i,n){
int sm = bt.sum(vec[i]);
ans += i - sm;
bt.add(vec[i],1);
}
cout << ans << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
C - BBuBBBlesort! |
User |
kopricky |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
2344 Byte |
Status |
WA |
Exec Time |
60 ms |
Memory |
6144 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
0 / 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 |
WA |
60 ms |
6144 KB |
02.txt |
WA |
60 ms |
6144 KB |
03.txt |
WA |
60 ms |
6144 KB |
04.txt |
WA |
60 ms |
6144 KB |
05.txt |
WA |
57 ms |
6144 KB |
06.txt |
WA |
58 ms |
6144 KB |
07.txt |
WA |
58 ms |
6144 KB |
08.txt |
AC |
47 ms |
6144 KB |
09.txt |
AC |
47 ms |
6144 KB |
10.txt |
AC |
46 ms |
6144 KB |
11.txt |
AC |
46 ms |
6144 KB |
12.txt |
AC |
47 ms |
6144 KB |
13.txt |
AC |
46 ms |
6144 KB |
14.txt |
AC |
56 ms |
6144 KB |
15.txt |
AC |
56 ms |
6144 KB |
16.txt |
AC |
57 ms |
6144 KB |
17.txt |
AC |
56 ms |
6144 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 |