zoukankan      html  css  js  c++  java
  • Hamburgers

    Hamburgers

    http://codeforces.com/problemset/problem/371/C

    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 nbnsnc (1 ≤ nb, ns, nc ≤ 100) — the number of the pieces of bread, sausage and cheese on Polycarpus' kitchen. The third line contains three integers pbpspc (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.

    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
     1 #include<iostream>
     2 #include<cmath>
     3 #include<cstring>
     4 #include<string>
     5 #include<algorithm>
     6 #include<vector>
     7 #include<cstdio>
     8 #include<queue>
     9 #include<map>
    10 #include<stack>
    11 typedef long long ll;
    12 using namespace std;
    13 
    14 ll a,b,c,d,e,f;
    15 ll S,B,C;
    16 ll num;
    17 bool erfen(ll mid){
    18     ll SS=mid*S-b;
    19     if(SS<0) SS=0;
    20     ll BB=mid*B-a;
    21     if(BB<0) BB=0;
    22     ll CC=mid*C-c;
    23     if(CC<0) CC=0;
    24     ll tmp=SS*e+BB*d+CC*f;
    25     if(tmp>num) return false;
    26     return true;
    27 }
    28 
    29 int main(){
    30     
    31     string str;
    32     cin>>str;
    33 
    34     for(int i=0;i<str.length();i++){
    35         if(str[i]=='S') S++;
    36         else if(str[i]=='B') B++;
    37         else C++;
    38     }
    39     cin>>a>>b>>c>>d>>e>>f>>num;
    40     ll L=0,R=1e15,mid;
    41     while(L<=R){
    42         mid=L+R>>1;
    43         if(erfen(mid)){
    44             L=mid+1;
    45         }
    46         else{
    47             R=mid-1;
    48         }
    49     }
    50     cout<<R<<endl;
    51 
    52 }
    View Code
  • 相关阅读:
    《JavaScript 源码分析》之 jquery.unobtrusive-ajax.js
    《JavaScript高级程序设计》读书笔记 2
    《JS设计模式笔记》构造函数和工厂模式创建对象
    《ES6基础教程》之 map、forEach、filter indexOf 用法
    《JS设计模式笔记》 5,适配器模式
    51Nod 1058 N的阶乘的长度
    ACM总结——2017区域赛网络赛总结
    ACM-ICPC国际大学生程序设计竞赛北京赛区(2017)网络赛 题目9 : Minimum
    hiho一下 第168周
    Fast Matrix Calculation HDU
  • 原文地址:https://www.cnblogs.com/Fighting-sh/p/10102277.html
Copyright © 2011-2022 走看看