Submission #31055621

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
import bisect
n = int(input())
a = sorted(list(map(int, input().split()))) # 予めソートしておく
b = list(map(int, input().split()))
c = sorted(list(map(int, input().split()))) # 予めソートしておく
answer = 0
for i in range(n): # 中部を b[i] に決め打ち
    max_j = bisect.bisect_left(a, b[i]) - 1 # a[j] < b[i] なる最大の j
    min_k = bisect.bisect_right(c, b[i]) # c[k] > b[i] なる最小の k
    answer += (max_j + 1) * (n - min_k)
print(answer)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

import bisect
n = int(input())
a = sorted(list(map(int, input().split()))) # 予めソートしておく
b = list(map(int, input().split()))
c = sorted(list(map(int, input().split()))) # 予めソートしておく
answer = 0
for i in range(n): # 中部を b[i] に決め打ち
    max_j = bisect.bisect_left(a, b[i]) - 1 # a[j] < b[i] なる最大の j
    min_k = bisect.bisect_right(c, b[i]) # c[k] > b[i] なる最小の k
    answer += (max_j + 1) * (n - min_k)
print(answer)

Submission Info

Judge Result