zoukankan      html  css  js  c++  java
  • 暑假练习赛 006 A Vanya and Food Processor(模拟)

    Description

    Vanya smashes potato in a vertical food processor. At each moment of time the height of the potato in the processor doesn't exceed h and the processor smashes k centimeters of potato each second. If there are less than k centimeters remaining, than during this second processor smashes all the remaining potato.

    Vanya has n pieces of potato, the height of the i-th piece is equal to ai. He puts them in the food processor one by one starting from the piece number 1 and finishing with piece number n. Formally, each second the following happens:

    1. If there is at least one piece of potato remaining, Vanya puts them in the processor one by one, until there is not enough space for the next piece.
    2. Processor smashes k centimeters of potato (or just everything that is inside).

    Provided the information about the parameter of the food processor and the size of each potato in a row, compute how long will it take for all the potato to become smashed.

    Input

    The first line of the input contains integers n, h and k (1 ≤ n ≤ 100 000, 1 ≤ k ≤ h ≤ 109) — the number of pieces of potato, the height of the food processor and the amount of potato being smashed each second, respectively.

    The second line contains n integers ai (1 ≤ ai ≤ h) — the heights of the pieces.

    Output

    Print a single integer — the number of seconds required to smash all the potatoes following the process described in the problem statement.

    Sample Input

     
    Input
    5 6 3
    5 4 3 2 1
    Output
    5
    Input
    5 6 3
    5 5 5 5 5
    Output
    10
    Input
    5 6 3
    1 2 1 1 1
    Output
    2

    Sample Output

     

    Hint

    Consider the first sample.

    1. First Vanya puts the piece of potato of height 5 into processor. At the end of the second there is only amount of height 2 remaining inside.
    2. Now Vanya puts the piece of potato of height 4. At the end of the second there is amount of height 3 remaining.
    3. Vanya puts the piece of height 3 inside and again there are only 3 centimeters remaining at the end of this second.
    4. Vanya finally puts the pieces of height 2 and 1 inside. At the end of the second the height of potato in the processor is equal to 3.
    5. During this second processor finally smashes all the remaining potato and the process finishes.

    In the second sample, Vanya puts the piece of height 5 inside and waits for 2 seconds while it is completely smashed. Then he repeats the same process for 4 other pieces. The total time is equal to 2·5 = 10 seconds.

    In the third sample, Vanya simply puts all the potato inside the processor and waits 2 seconds.

    /*
    切土豆机,每秒切k,最多能盛h
    都是泪,连for循环里的i都得用long long
    */
    #include <string.h>
    #include <iostream>
    #include <algorithm>
    #include <stdio.h>
    #define INF 0x3f3f3f3f
    #define N 100010
    using namespace std;
    /*bool comp(long long a,long long b)
    {
        return a>b;
    }*/
    int main()
    {
        //freopen("in.txt","r",stdin);
        long long n,h,k,cur[N];
        scanf("%lld%lld%lld",&n,&h,&k);
        //cout<<n<<" "<<h<<" "<<k<<endl; 
        bool flag=false;
        for(long long i=0;i<n;i++)
        {
            scanf("%lld",&cur[i]);
            if(cur[i]>0)
                flag=true;
        }    
        if(!flag)
        {
            printf("0
    ");
            return 0;
        }
        long long cut=0;
        long long sum=0;//表示当前机器中有多少土豆
        //sort(cur,cur+n);
        //for(long long i=0;i<n;i++)
        //    cout<<cur[i]<<" ";
        //cout<<endl;
        for(long long i=0;i<n;i++)
        {
            if(sum+cur[i]>h)
            {
                sum=cur[i];
                cut++;
            }
            else
                sum+=cur[i];
            cut+=sum/k;
            sum%=k;//每一秒都少了k;
        }
        //cout<<"sum="<<sum<<endl;
        if(sum>0)
            cut++;
        //cout<<sum<<endl;
        printf("%lld
    ",cut);
        //cout<<endl;S
        return 0;
    }
  • 相关阅读:
    jmeter之如何减负-实现稳定超高并发测试(性能调优)之正确添加监听器
    正则表达式批量处理数据
    Jmeter计数器实现自增功能
    Python自动化 unittest生成测试报告(HTMLTestRunner)03
    [leetcode 14]Longest Common Prfix
    [leetcode 13]Roman to integer
    [leetcode 12] Inter to Roman
    [leetcode 11]Container With Most Water
    [eetcode 10]Regular Expression Matching
    [leetcode 9]Palindrome Number
  • 原文地址:https://www.cnblogs.com/wuwangchuxin0924/p/5785431.html
Copyright © 2011-2022 走看看