CF371C Hamburgers

最新推荐文章于 2025-04-30 16:36:16 发布

yamaes

最新推荐文章于 2025-04-30 16:36:16 发布

阅读量704

点赞数 14

文章标签：算法 c++

本文链接：https://blog.csdn.net/2301_80683422/article/details/146426746

版权

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.

输入格式

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 %I64d specifier.

输出格式

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

题意翻译

做汉堡包，需要的材料用字符串给出了。

已有的材料数在第二行。（顺序：B,S,C）

商店卖的材料的需要的钱数在第三行。（顺序：B,S,C）

第四行是你有的钱数。

问最多做多少汉堡。

输入输出样例

输入 #1复制

BBBSSC
6 4 1
1 2 3
4

输出 #1复制

输入 #2复制

输出 #2复制

输入 #3复制

BSC
1 1 1
1 1 3
1000000000000

输出 #3复制

200000000001

#include<bits/stdc++.h>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define int long long
#define N 1000005
#define INF 0x3f3f3f3f
using namespace std;
int a[N],b[N];
string s;
int a1,a2,a3;
int b1,b2,b3;
int x=0,y=0,z=0;
int v;
int r,l;
int ans,mid;
bool check(int k)
{
  int sum=0;
  if(k*x>=b1) sum+=(k*x-b1)*a1;  //计算扣除厨房种已经有的材料以后，做k个汉堡所需要花的钱
  if(k*y>=b2) sum+=(k*y-b2)*a2;
  if(k*z>=b3) sum+=(k*z-b3)*a3;
  return sum<=v; //如果最后花的钱没到预算，那就是做得太少了，l=mid+1
}
signed main()
 {
    ios::sync_with_stdio(false);
    cin>>s;
    for(int i=0;i<s.size();i++)  //记录三个部分所需数量
    {
        if(s[i]=='B') x++;
        if(s[i]=='S') y++;
        if(s[i]=='C') z++;
    }

   cin>>b1>>b2>>b3>>a1>>a2>>a3;  //a为每个部分需要的价格，b为厨房里现有的
   cin>>v;
 l=0,r=a1+a2+a3+v;
  while(l<=r)
  {
     mid=l+r>>1;
    if(check(mid)) {ans=mid,l=mid+1;}
    else r=mid-1;
  }
cout<<ans<<endl;
    return 0; 
 }