Submission #5006626
Source Code Expand
#085-D def IL(): return list(map(int,input().split())) def SL(): return input().split() def I(): return int(input()) def S(): return list(input()) import math n,h=IL() a=0 B=[0]*n for i in range(n): ta,tb=IL() a=max(a,ta) B[i]=tb ans=0 for i in range(n): if B[-1-i]>=a and h>0: h-=B[-1-i] ans+=1 else: break if h>0: ans+=math.ceil(h/a) print(ans)
Submission Info
Submission Time | |
---|---|
Task | D - Katana Thrower |
User | IdealLife3 |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 416 Byte |
Status | WA |
Exec Time | 399 ms |
Memory | 7028 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 400 | ||||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | a01, a02, a03, a04 |
All | a01, a02, a03, a04, b05, b06, b07, b08, b09, b10, b11, b12, b13, b14, b15, b16, b17, b18, b19, b20, b21, b22, b23, b24 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
a01 | AC | 17 ms | 3064 KB |
a02 | AC | 17 ms | 3064 KB |
a03 | AC | 17 ms | 3064 KB |
a04 | WA | 17 ms | 3064 KB |
b05 | AC | 17 ms | 3060 KB |
b06 | AC | 375 ms | 7028 KB |
b07 | AC | 17 ms | 3064 KB |
b08 | AC | 356 ms | 7028 KB |
b09 | AC | 17 ms | 3064 KB |
b10 | AC | 17 ms | 3064 KB |
b11 | AC | 17 ms | 3064 KB |
b12 | AC | 17 ms | 3060 KB |
b13 | AC | 382 ms | 3828 KB |
b14 | AC | 375 ms | 3828 KB |
b15 | WA | 364 ms | 3828 KB |
b16 | AC | 384 ms | 3828 KB |
b17 | WA | 375 ms | 6912 KB |
b18 | WA | 367 ms | 6252 KB |
b19 | AC | 396 ms | 3828 KB |
b20 | WA | 344 ms | 3828 KB |
b21 | WA | 368 ms | 6832 KB |
b22 | AC | 399 ms | 7028 KB |
b23 | WA | 18 ms | 3064 KB |
b24 | WA | 25 ms | 3188 KB |