zoukankan      html  css  js  c++  java
  • 二分法:CF371C-Hamburgers(二分法+字符串的处理)

                                                                                                                         Hamburgers
    Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u 
     
    Description
    Polycarpus loves hamburgers very much. He especially adores the hamburgers he makes with his own hands. Polycarpus thinks that there are only three decent ingredients to make hamburgers from: a bread, sausage and cheese. He writes down the recipe of his favorite "Le Hamburger de Polycarpus" as a string of letters 'B' (bread), 'S' (sausage) и 'C' (cheese). The ingredients in the recipe Go from bottom to top, for example, recipe "ВSCBS" represents the hamburger where the ingredients go from bottom to top as bread, sausage, cheese, bread and sausage again.
    Polycarpus has nb pieces of bread, ns pieces of sausage and nc pieces of cheese in the kitchen. Besides, the shop nearby has all three ingredients, the prices are pb rubles for a piece of bread, ps for a piece of sausage and pc for a piece of cheese.
    Polycarpus has r rubles and he is ready to shop on them. What maximum number of hamburgers can he cook? You can assume that Polycarpus cannot break or slice any of the pieces of bread, sausage or cheese. Besides, the shop has an unlimited number of pieces of each ingredient.
    Input
    The first line of the input contains a non-empty string that describes the recipe of "Le Hamburger de Polycarpus". The length of the string doesn't exceed 100, the string contains only letters 'B' (uppercase English B), 'S' (uppercase English S) and 'C' (uppercase English C).
    The second line contains three integers nb, ns, nc (1 ≤ nb, ns, nc ≤ 100) — the number of the pieces of bread, sausage and cheese on Polycarpus' kitchen. The third line contains three integers pb, ps, pc (1 ≤ pb, ps, pc ≤ 100) — the price of one piece of bread, sausage and cheese in the shop. Finally, the fourth line contains integer r (1 ≤ r ≤ 1012) — the number of rubles Polycarpus has.
    Please, do not write the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64dspecifier.
    Output
    Print the maximum number of hamburgers Polycarpus can make. If he can't make any hamburger, print 0.
    Sample Input
    Input
    BBBSSC
    6 4 1
    1 2 3
    4
    Output
    2
    Input
    BBC
    1 10 1
    1 10 1
    21
    Output
    7
    Input
    BSC
    1 1 1
    1 1 3
    1000000000000
    Output

    200000000001



    解题心得:

    和二分答案差不多,就不多说了,只是多了一个字符串的处理

    详情看点击打开链接


    #include<bits/stdc++.h>
    using namespace std;
    const int maxn = 110;
    typedef long long ll;
    char H[maxn];
    ll B,S,C;
    ll nb,nc,ns;
    ll pb,ps,pc;
    ll sum1;
    ll Start,End;
    
    bool check(ll Mid)
    {
        ll sum = 0;
        ll v1,v2,v3;
        v1 = (Mid*B - nb)*pb;
        v2 = (Mid*S - ns)*ps;
        v3 = (Mid*C - nc)*pc;
        if(v1 > 0)
            sum += v1;
        if(v2 > 0)
            sum += v2;
        if(v3 > 0)
            sum += v3;
        if(sum > sum1)
            return false;
        else
            return true;
    }
    
    void get_Start()
    {
        ll Min = 0x7f7f7f7f;
        if(B != 0 && nb / B < Min)
            Min = nb / B;
        if(S != 0 && ns / S < Min)
            Min = ns / S;
        if(C != 0 && nc / C < Min)
            Min = nc / C;
        Start = Min;
    }
    void get_End()
    {
        ll sum = 0;
        sum = sum + sum1 + nb*pb + ns*ps + nc*pc;
        End = sum / (B*pb + S*ps + C*pc);
    }
    
    void div()
    {
        ll Mid;
        while(1)
        {
            Mid = (Start + End) / 2;
            if(!check(Mid))
                End = Mid - 1;
            else
                Start = Mid + 1;
            if(check(Mid) && !check(Mid+1))
                break;
        }
        printf("%lld
    ",Mid);
    }
    int main()
    {
        while(scanf("%s",H)!=EOF)
        {
            scanf("%lld%lld%lld%lld%lld%lld%lld",&nb,&ns,&nc,&pb,&ps,&pc,&sum1);
            B = S = C = 0;
            int len = strlen(H);
            for(int i=0; i<len; i++)
            {
                if(H[i] == 'B')
                    B++;
                else if(H[i] == 'S')
                    S++;
                else if(H[i] == 'C')
                    C++;
            }
            get_Start();
            get_End();
            if(Start  == 0 && End == 0)
            {
                printf("0
    ");
                continue;
            }
            div();
        }
    }



  • 相关阅读:
    android控件
    解决C#项目出现“此项目引用这台计算机上缺少的 NuGet 程序包。使用 NuGet 程序包还原可下载这些程序包。有关详细信息,请参阅 http://go.microsoft.com/fwlink/?LinkID=322105。缺少的文件是 ..packagesMicrosoft.Net.Compilers.1.0.0uildMicrosoft.Net.Compilers.props”
    C#解密退款req_info结果通知
    解决C#中调用WCF方法报错:远程服务器返回错误 (404) 未找到
    解决网页出现 net::ERR_ABORTED 404 (Not Found)问题
    winform执行程序报错:已停止工作,windows正在检查该问题的解决方案
    C#操作数据表中XML格式的数据
    为了开篇
    iOS隐私政策
    在Android中调用KSOAP2库访问webservice服务出现的服务端传入参数为null的问题解决
  • 原文地址:https://www.cnblogs.com/GoldenFingers/p/9107351.html
Copyright © 2011-2022 走看看