Submission #3276596

---

Source Code Expand

from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,datetime
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())

N = int(input())
points = []
for i in range(N):
    a = int(input())
    points.append([a,True])
for i in range(N):
    b = int(input())
    points.append([b,False])
points.sort()

fac = [1]*(10**5+3)
for i in range(2,10**5+3):
    fac[i] = fac[i-1]*i%mod

tmp = MAX = 0
ans = 1
for x,c in points:
    if c:
        tmp += 1
    else:
        tmp -= 1
    MAX = max(MAX,abs(tmp))
    if tmp == 0:
        ans *= fac[MAX]
        ans %= mod
        MAX = 0

print(ans)

Submission Info

Judge Result