Magic Powder CodeForces - 670D2 二分

Magic Powder CodeForces - 670D2 二分

传送门：https://codeforces.com/contest/670/problem/D2

Waking up in the morning, Apollinaria decided to bake cookies. To bake one cookie, she needs $n$ ingredients, and for each ingredient she knows the value $a_i$ — how many grams of this ingredient one needs to bake a cookie. To prepare one cookie Apollinaria needs to use all n ingredients.

Apollinaria has $b_i$ gram of the $i-th$ ingredient. Also she has $k$ grams of a magic powder. Each gram of magic powder can be turned to exactly $1$ gram of any of the n ingredients and can be used for baking cookies.

Your task is to determine the maximum number of cookies, which Apollinaria is able to bake using the ingredients that she has and the magic powder.

Input
The first line of the input contains two positive integers $n$ and $k(1\le n,k\le 1000)$ — the number of ingredients and the number of grams of the magic powder.

The second line contains the sequence $a_1,a_2,...,a_n(1\le a_i\le 1000)$, where the $i-th$ number is equal to the number of grams of the $i-th$ ingredient, needed to bake one cookie.

The third line contains the sequence $b_1,b_2,...,b_n(1\le b_i\le 1000)$, where the $i-th$ number is equal to the number of grams of the $i-th$ ingredient, which Apollinaria has.

Output
Print the maximum number of cookies, which Apollinaria will be able to bake using the ingredients that she has and the magic powder.

题意：
Apollinaria 想要做一些饼干，已知做一个饼干需要$n$种材料，每种材料需要$a_i$克，我们现在拥有每种材料$b_i$克，和$k$克万能材料，万能材料可以补充任何一种材料，现问Apollinaria最多可以做多少饼干。

代码：

#include<iostream>
using namespace std ;
#define ll long long
const ll N = 1e5+9 ;
void updata( ll &a , ll b ){if(b>a)a=b;}
ll a[ N ] , b[ N ] , n , k ;
bool check( ll sum ){
    ll kk = k ; //存目前可用的万能材料还剩多少克
    for( int i = 1 ; i <= n ; i ++ ){
        ll ned = a[ i ]*sum ;//ned表示做sum个饼干，第i种材料一共需要多少克
        if( b[ i ] >= ned ) continue ; //第i种材料足够做sum个饼干，continue
        else if( b[ i ] + kk >= ned ){  kk -= (ned-b[i]) ; }//材料不足用万能材料补充
        else { return 0 ;  }
    }
    return 1 ;
}
int main(){
   cin >> n >> k ;
   for( int i = 1 ; i <= n ; i ++ ) cin >> a[ i ] ;
   for( int i = 1 ; i <= n ; i ++ ) cin >> b[ i ] ;
   ll l , r , mid , ans =-1 ;
    l = 0 , r = 3e9 ;
   while( l <= r ){
        mid = l + r >> 1 ;
        ll f = check( mid ) ;
        //cout << "mid=" << mid << " f=" << f << " l=" << l << " r=" << r << "\n" ;
        if( f ) { l = mid + 1 ; updata( ans , mid ) ; }
        else r = mid - 1 ;
   }
    cout << ans << "\n" ;
return 0 ;
}