• 2113 Speed Reading

    时间限制 : 2000/1000 MS(Java/Others) | 内存限制 : 131072/65536 KB(Java/Others)

    提交数 : 12 | 通过数 : 10

    题目描述

    All K (1 ≤ K ≤ 1,000) of the cows are participating in Farmer John's annual reading contest. The competition consists of reading a single book with N (1 ≤ N ≤ 100,000) pages as fast as possible while understanding it.
    
    Cow i has a reading speed Si (1 ≤ Si ≤ 100) pages per minute, a maximum consecutive reading time Ti (1 ≤ Ti ≤ 100) minutes, and a minimum rest time Ri (1 ≤ Ri ≤ 100) minutes. The cow can read at a rate of Si pages per minute, but only for Ti minutes at a time. After she stops reading to rest, she must rest for Ri minutes before commencing reading again.
    
    Determine the number of minutes (rounded up to the nearest full minute) that it will take for each cow to read the book.

    输入要求

    * Line 1: Two space-separated integers: N and K
    * Lines 2..K+1: Line i+1 contains three space-separated integers: Si , Ti , and Ri

    输出要求

    * Lines 1..K: Line i should indicate how many minutes (rounded up to the nearest full minute) are required for cow i to read the whole book.

    输入样例

    10 3
    2 4 1
    6 1 5
    3 3 3
    

    输出样例

    6
    7
    7
    

    提示


    来源

    USACO 2007 November Bronze

    [ 返回顶端 ] | [ 代码提交 ] | [ 统计数据 ] | [ 历史提交 ]