Submission #3336044

Source Code Expand

N, K = gets.split.map(&:to_i)
ws, ds = [], []
N.times do |i|
    ws[i], ds[i] = gets.split.map(&:to_i)
end

puts (1..(2*10**18)).bsearch{|n|
    sum = 0
    N.times do |i|
        sum += (n - ws[i])/ds[i] + 1 if n >= ws[i]
    end
    sum >= K
}

Submission Info

Submission Time
Task C - Garden
User betrue12
Language Ruby (2.3.3)
Score 100
Code Size 257 Byte
Status AC
Exec Time 1024 ms
Memory 3540 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 23
Set Name Test Cases
Sample a01, a02, a03
All a01, a02, a03, b04, b05, b06, b07, b08, b09, b10, b11, b12, b13, b14, b15, b16, b17, b18, b19, b20, b21, b22, b23
Case Name Status Exec Time Memory
a01 AC 7 ms 1788 KB
a02 AC 7 ms 1788 KB
a03 AC 7 ms 1788 KB
b04 AC 7 ms 1788 KB
b05 AC 1006 ms 3432 KB
b06 AC 1005 ms 3536 KB
b07 AC 1010 ms 3484 KB
b08 AC 1002 ms 3484 KB
b09 AC 1023 ms 3484 KB
b10 AC 1024 ms 3484 KB
b11 AC 631 ms 3484 KB
b12 AC 559 ms 3432 KB
b13 AC 643 ms 3484 KB
b14 AC 627 ms 3492 KB
b15 AC 614 ms 3484 KB
b16 AC 568 ms 3432 KB
b17 AC 579 ms 3484 KB
b18 AC 658 ms 3492 KB
b19 AC 535 ms 3484 KB
b20 AC 557 ms 3484 KB
b21 AC 582 ms 3488 KB
b22 AC 622 ms 3488 KB
b23 AC 746 ms 3540 KB