In [110]:
import math
import sys
In [111]:
inversion_count = 0
In [112]:
def merge(a,b):
global inversion_count
""" Function to merge two arrays """
c = []
while len(a) != 0 and len(b) != 0:
if a[0] <= b[0]:
c.append(a[0])
a.remove(a[0])
else:
inversion_count += len(a)
c.append(b[0])
b.remove(b[0])
if len(a) == 0:
c += b
else:
c += a
return c
In [113]:
def merge_sort(arr):
len_arr = len(arr)
out_arr = []
if len_arr > 1:
mid = len_arr/2
left = merge_sort(arr[:mid])
right = merge_sort(arr[mid:])
out_arr = merge(left,right)
return out_arr
else:
return arr
In [114]:
def find_inv_count(arr):
global inversion_count
inversion_count = 0
sorted_arr = merge_sort(arr)
print inversion_count
In [115]:
find_inv_count([2, 3, 8, 6, 1])
find_inv_count([2])
find_inv_count([])
find_inv_count([2, 2])
In [121]:
all = sys.stdin.readlines()
start = True
skip = False
next_start = False
input_ongoing = False
current_input_count = 0
current_i = 0
arr = []
for line in all:
if skip:
if (len(arr) > 0):
print arr
find_inv_count(arr)
arr = []
current_input_count = 0
current_i = 0
input_ongoing = False
skip = False
next_start = True
continue
elif start:
no_test_cases = int(line)
skip = True
start = False
elif next_start:
current_input_count = int(line)
print "current input", current_input_count
next_start = False
input_ongoing = True
continue
elif input_ongoing:
if current_i < current_input_count:
if current_i == current_input_count - 1:
skip = True
arr.append(int(line))
current_i += 1
In [ ]: