Submission #2861154

Source Code Expand

N = gets.to_i
as = N.times.map{gets.to_i}.sort
bs = N.times.map{gets.to_i}.sort
ranges = N.times.map{|i| [as[i], bs[i]].sort}.sort
MOD = 10**9+7

ans = 1
queue = []
N.times do |i|
    queue.push(ranges[i][1])
    queue.shift while ranges[i][0] > queue[0]
    ans = ans * queue.length % MOD
end
puts ans

Submission Info

Submission Time
Task A - 1D Matching
User betrue12
Language Ruby (2.3.3)
Score 500
Code Size 315 Byte
Status AC
Exec Time 450 ms
Memory 12512 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 269 ms 8220 KB
001.txt AC 97 ms 3916 KB
002.txt AC 135 ms 4888 KB
003.txt AC 153 ms 5088 KB
004.txt AC 395 ms 11260 KB
005.txt AC 450 ms 12512 KB
006.txt AC 448 ms 12488 KB
007.txt AC 448 ms 12288 KB
008.txt AC 449 ms 12488 KB
009.txt AC 449 ms 12416 KB
010.txt AC 440 ms 12488 KB
011.txt AC 446 ms 12288 KB
example0.txt AC 7 ms 1788 KB
example1.txt AC 7 ms 1788 KB