Submission #3225944
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 | A - Restricted |
User | ENDRANCE |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 275 Byte |
Status | RE |
Exec Time | 291 ms |
Memory | 19684 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | a01, a02 |
All | a01, a02, b03, b04, b05, b06, b07, b08 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
a01 | RE | 291 ms | 19684 KB |
a02 | RE | 148 ms | 12424 KB |
b03 | RE | 147 ms | 12428 KB |
b04 | RE | 148 ms | 12424 KB |
b05 | RE | 148 ms | 12428 KB |
b06 | RE | 148 ms | 12424 KB |
b07 | RE | 148 ms | 12424 KB |
b08 | RE | 148 ms | 12424 KB |