zoukankan      html  css  js  c++  java
  • Codeforces Round #218 (Div. 2) C. Hamburgers【二分】

    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    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 thecin, cout streams or the %I64d specifier.

    Output

    Print the maximum number of hamburgers Polycarpus can make. If he can't make any hamburger, print 0.

    Examples
    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 <cstdio>
    #include <iostream>
    #include <cstring>
    #include <algorithm>
    using namespace std;
    
    __int64 ma[4], st[4], p[4], mon;
    char s[1000];
    bool judge(__int64 x) {
        __int64 res = mon;
        for (__int64 i = 0; i < 3; i++) {
            if (st[i] < x*ma[i]) {
                if (res < (x*ma[i] - st[i])*p[i]) return false;
                else res -= (x*ma[i] - st[i])*p[i];
            }
        }
        return true;
    }
    int main() {
        while (scanf("%s", s) != EOF) {
            cin>>st[0]>>st[1]>>st[2];
            cin>>p[0]>>p[1]>>p[2];
            cin>>mon;
            ma[0] = 0, ma[1] = 0, ma[2] = 0;
            __int64 len = strlen(s);
            for (__int64 i = 0; i < len; i++) {
                if (s[i] == 'B') ma[0]++;
                else if (s[i] == 'S') ma[1]++;
                else ma[2]++;
            }
            __int64 lb = 0, ub = 2e13, ans;
            while (ub >= lb) {
                __int64 mid = (ub + lb)>>1;
                if (judge(mid)) {
                   ans = mid; lb = mid + 1;
                }
                else ub = mid - 1;
            }
            cout<<ans<<endl;
        }
        return 0;
    }



  • 相关阅读:
    [Swift]LeetCode374. 猜数字大小 | Guess Number Higher or Lower
    [Swift]LeetCode371. 两整数之和 | Sum of Two Integers
    [Swift]LeetCode367. 有效的完全平方数 | Valid Perfect Square
    [Swift]LeetCode350. 两个数组的交集 II | Intersection of Two Arrays II
    [Swift]LeetCode349. 两个数组的交集 | Intersection of Two Arrays
    [Swift实际操作]七、常见概念-(9)使用定时组件Timer执行定时任务
    [Swift实际操作]七、常见概念-(8)日历Calendar和时区TimerZone
    浅谈广告交易系统
    浅谈广告交易系统
    6种排序算法的简洁实现:冒泡、选择、插入、归并、快速、堆
  • 原文地址:https://www.cnblogs.com/cniwoq/p/6770907.html
Copyright © 2011-2022 走看看