Ultra-QuickSort
Time Limit: 7000MS | Memory Limit: 65536K | |
Total Submissions: 37604 | Accepted: 13518 |
Description
In this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacent sequence elements until the sequence is sorted in ascending order. For the input sequence
9 1 0 5 4 ,
Ultra-QuickSort produces the output
0 1 4 5 9 .
Your task is to determine how many swap operations Ultra-QuickSort needs to perform in order to sort a given input sequence.
Ultra-QuickSort produces the output
Your task is to determine how many swap operations Ultra-QuickSort needs to perform in order to sort a given input sequence.
Input
The input contains several test cases. Every test case begins with a line that contains a single integer n < 500,000 -- the length of the input sequence. Each of the the following n lines contains a single integer 0 ≤ a[i] ≤ 999,999,999, the i-th input sequence element. Input is terminated by a sequence of length n = 0. This sequence must not be processed.
Output
For every input sequence, your program prints a single line containing an integer number op, the minimum number of swap operations necessary to sort the given input sequence.
Sample Input
5 9 1 0 5 4 3 1 2 3 0
Sample Output
6 0
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <queue>
#include <algorithm>
#include <map>
#include <cmath>
#include <iomanip>
#define INF 99999999
typedef long long LL;
using namespace std;
const int MAX=500000+10;
int n;
int hash[MAX],a[MAX],c[MAX];
int lowbit(int x){
return x&(-x);
}
void Update(int x){
while(x<=n){
c[x]+=1;
x+=lowbit(x);
}
}
int Query(int x){
int sum=0;
while(x>0){
sum+=c[x];
x-=lowbit(x);
}
return sum;
}
int search(int x){
int left=1,right=n;
while(left<=right){
int mid=left+right>>1;
if(hash[mid] == x)return mid;
if(hash[mid]<x)left=mid+1;
else right=mid-1;
}
}
int main(){
while(~scanf("%d",&n),n){
for(int i=1;i<=n;++i)scanf("%d",a+i),hash[i]=a[i];
for(int i=1;i<=n;++i)c[i]=0;
sort(hash+1,hash+1+n);
LL sum=0;
for(int i=1;i<=n;++i){
int x=search(a[i]);
sum+=i-1-Query(x);
Update(x);
}
printf("%lld\n",sum);
}
return 0;
}