Submission #9807304
Source Code Expand
import sys input = sys.stdin.readline N, A, B = map(int, input().split()) hs = [int(input()) for _ in range(N)] def f(k): r = 0 for h in hs: r += -(-max(0, (h-B*k)) // (A-B)) return k>=r mx,mn=10**18,0 idx=mx//2 while mx-mn>1: if f(idx): mx,idx=idx,(idx+mn)//2 continue idx,mn=(idx+mx)//2,idx print(idx+1)
Submission Info
Submission Time | |
---|---|
Task | D - Widespread |
User | nehan_der_thal |
Language | PyPy3 (2.4.0) |
Score | 400 |
Code Size | 369 Byte |
Status | AC |
Exec Time | 414 ms |
Memory | 44764 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | a01, a02, a03 |
All | a01, a02, a03, b04, b05, b06, b07, b08, b09, b10, b11, b12, b13 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
a01 | AC | 161 ms | 38256 KB |
a02 | AC | 160 ms | 38256 KB |
a03 | AC | 161 ms | 38256 KB |
b04 | AC | 162 ms | 38256 KB |
b05 | AC | 414 ms | 44508 KB |
b06 | AC | 266 ms | 44252 KB |
b07 | AC | 384 ms | 44764 KB |
b08 | AC | 385 ms | 44764 KB |
b09 | AC | 249 ms | 43996 KB |
b10 | AC | 342 ms | 43996 KB |
b11 | AC | 346 ms | 43996 KB |
b12 | AC | 367 ms | 43996 KB |
b13 | AC | 386 ms | 43996 KB |