Hamburgers CodeForces - 371C

 

 

题解：给定bsc的初始数量，然后给价格和配料要求，求最多做多少个汉堡包 

题解：直接二分

#include<iostream>
#include<cstdio>
#include<map>
#include<algorithm>
#include<cstdio>
#include<vector>
#include<stack>
#include<queue>
#include<deque>
#include<cstring>
#include<vector>
#include<set>
#include<cmath>
#include<cstring>
#include<cstdlib>
#define fi first
#define se second
#define u1 (u<<1)
#define u2 (u<<1|1)
#define PII pair<int,int>
#define ll long long
#define ull unsigned long long
#define PLL pair<long long,long long>
#define scd(a) scanf("%d",&a)
#define scdd(a,b) scanf("%d%d",&a,&b)
#define scddd(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define scl(a) scanf("%lld",&a)
#define rep(i,n) for(int i = 0; (i)<(n); i++)
#define rep1(i,n) for(int i = 1; (i)<=(n); i++)
#define pb(a) push_back(a)
#define mst(a,b) memset(a, b, sizeof a)
#define ac cout<<ans<<endl
using namespace std;
ll b,s,c;
ll yb,ys,yc;
ll wb,wss,wc;
ll q;
bool check(ll mid)
{
    ll now=0;
    if(mid*b>yb) now+=((mid*b)-yb)*wb;
    if(mid*s>ys) now+=((mid*s)-ys)*wss;
    if(mid*c>yc) now+=((mid*c)-yc)*wc;
    return now<=q;
}
void solve()
{
    string t;
    cin>>t;
    for(int i=0;i<t.length();i++)
    {
        if(t[i]=='B') b++;
        else if(t[i]=='S') s++;
        else c++;
    }
    cin>>yb>>ys>>yc>>wb>>wss>>wc>>q;
    ll l=0,r=1e13;
    while(l<r)
    {
        ll mid=l+r+1>>1;
        if(check(mid)) l=mid;
        else r=mid-1;
    }
    cout<<l<<endl;
}
signed main()
{
    int t=1;
    //scd(t);
    while(t--) solve();
    return 0;
}