Submission #2851303


Source Code Expand

from bisect import *

n = int(input())
a = [0]*n
b = [0]*n
for i in range(n):
    a[i] = int(input())
for i in range(n):
    b[i] = int(input())

a.sort()
b.sort()

ans = 1
mod = 1000000007

for x,y in zip(a,b):
    if x > y:
        x, y = y, x
    ans *= (bisect_right(a, y)-bisect_left(a, x))
    ans %= mod

print(ans)

Submission Info

Submission Time
Task A - 1D Matching
User deoxy
Language Python (3.4.3)
Score 500
Code Size 346 Byte
Status AC
Exec Time 539 ms
Memory 11440 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 2
AC × 14
Set Name Test Cases
Sample example0.txt, example1.txt
All 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, example0.txt, example1.txt
Case Name Status Exec Time Memory
000.txt AC 329 ms 8180 KB
001.txt AC 125 ms 4852 KB
002.txt AC 171 ms 5492 KB
003.txt AC 188 ms 5876 KB
004.txt AC 473 ms 10432 KB
005.txt AC 527 ms 11440 KB
006.txt AC 539 ms 11436 KB
007.txt AC 521 ms 11440 KB
008.txt AC 533 ms 11436 KB
009.txt AC 520 ms 11436 KB
010.txt AC 538 ms 11436 KB
011.txt AC 530 ms 11436 KB
example0.txt AC 17 ms 3064 KB
example1.txt AC 17 ms 3064 KB