Submission #3225948
Source Code Expand
import numpy as np N, A, B = [int(n) for n in input().split()] h = [] for n in range(N): h.append(int(input())) h = np.array(h) count = 0 while True: if np.max(h) <= 0: break idx = np.argmax(h) h = h - B h[idx] = h[idx] - A + B count += 1 print(count)
Submission Info
Submission Time | |
---|---|
Task | D - Widespread |
User | ENDRANCE |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 275 Byte |
Status | TLE |
Exec Time | 2112 ms |
Memory | 17060 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 151 ms | 12700 KB |
a02 | AC | 147 ms | 12424 KB |
a03 | TLE | 2112 ms | 12428 KB |
b04 | AC | 148 ms | 12428 KB |
b05 | AC | 313 ms | 17060 KB |
b06 | TLE | 2108 ms | 17016 KB |
b07 | TLE | 2108 ms | 17020 KB |
b08 | TLE | 2109 ms | 17020 KB |
b09 | TLE | 2109 ms | 17020 KB |
b10 | TLE | 2108 ms | 17016 KB |
b11 | TLE | 2108 ms | 17020 KB |
b12 | TLE | 2109 ms | 17020 KB |
b13 | TLE | 2108 ms | 17020 KB |