CodeForces 371C-Hamburgers(二分搜索)

A - 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 EnglishC).

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 cincout 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
 
    
 
    
 
    
AC代码:
 
    
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>

using namespace std;

typedef long long ll;

ll num[3],nb,ns,nc,pb,ps,pc,val;

//取非负整数
ll f(ll x){if(x>0)return x;return 0;}

ll ER(ll L,ll R)
//根据(B*i-nb)*pb+(C*i-nc)*pc+(S*i-ns)*ps二分结果
{
	ll mid;
	while(L+1<R)
	{
		mid = (L+R)/2;
		ll tmp = f((num[0]*mid-nb)*pb)+
			f((num[1]*mid-ns)*ps)
			+f((num[2]*mid-nc)*pc);
		if(tmp>val){
			R = mid;
		}
		else {
			L = mid;
		}
	}
	return L;
}

int main()
{
#ifdef zsc
	freopen("input.txt","r",stdin);
#endif

	char s[1000];
	int i,j,k;
	while(~scanf("%s",s))
	{
		scanf("%I64d%I64d%I64d",&nb,&ns,&nc);
		scanf("%I64d%I64d%I64d",&pb,&ps,&pc);
		scanf("%I64d",&val);
		num[0] = num[1] = num[2] = 0;
		for(i=0;s[i];++i){
			if(s[i]=='B')num[0]++;
			else if(s[i]=='S')num[1]++;
			else num[2]++;
		}
		ll v = ER(0,300000000000000);
		printf("%I64d\n",v);
	}

	return 0;
}


  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值