Submission #1983093


Source Code Expand

import numpy as np
import pdb

def main():
    '''
    N: number of monsters
    A: point blank
    B: spread damage
    '''
    [N, A, B] = map(int, raw_input().split(' '))
    HPs = np.zeros(N)
    for k in range(N):
        HPs[k] = int(raw_input())

    answer = strategy(HPs, A, B)
    print answer

def strategy(HPs, A, B):
    turn = 0
    while max(HPs) > 0:
        HPs = np.sort(HPs)[::-1]
        HPs[0]= HPs[0] - (A - B)
        HPs = HPs - B
        turn += 1
    return turn


if __name__ == '__main__':
    main()

Submission Info

Submission Time
Task D - Widespread
User masomatics
Language Python (2.7.6)
Score 0
Code Size 558 Byte
Status TLE
Exec Time 2108 ms
Memory 17168 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 2
TLE × 1
AC × 4
TLE × 9
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 95 ms 10544 KB
a02 AC 93 ms 10544 KB
a03 TLE 2108 ms 10544 KB
b04 AC 96 ms 10544 KB
b05 AC 258 ms 15120 KB
b06 TLE 2108 ms 15120 KB
b07 TLE 2108 ms 15120 KB
b08 TLE 2108 ms 15120 KB
b09 TLE 2108 ms 17168 KB
b10 TLE 2108 ms 15120 KB
b11 TLE 2108 ms 15120 KB
b12 TLE 2108 ms 15120 KB
b13 TLE 2108 ms 17168 KB