zoukankan      html  css  js  c++  java
  • Codeforces 670D2 Magic Powder

    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 ai — 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 bi 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 contains two positive integers n and k (1 ≤ n ≤ 100 000, 1 ≤ k ≤ 109) — the number of ingredients and the number of grams of the magic powder.

    The second line contains the sequence a1, a2, …, an (1 ≤ ai ≤ 109), 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 b1, b2, …, bn (1 ≤ bi ≤ 109), 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.

    分析:
    二分答案即可。

    #include <bits/stdc++.h>
    using namespace std;
    typedef long long ll;
    const int N=1e5+9;
    ll a[N],b[N];
    int n,k;
    bool ok(ll x)
    {
        ll num=k;
        for(int i=0;i<n;i++){
            ll t=b[i]-x*a[i];
            if(t<0){
                num+=t;
                if(num<0)return 0;
            }
        }
        return 1;
    }
    int main()
    {
        scanf("%d%d",&n,&k);
        for(int i=0;i<n;i++)scanf("%I64d",&a[i]);
        for(int i=0;i<n;i++)scanf("%I64d",&b[i]);
        ll l=0,r=2e9+9;
        while(l<r){
            int m=l+(r-l+1)/2;
            if(ok(m))l=m;
            else r=m-1;
        }
        printf("%d
    ",l);
    }
    
  • 相关阅读:
    如何在博客园中添加新随笔以及随笔参考格式
    如何在班级博客中提交作业
    C高级第一次作业
    MySQL调优
    个人作业--软件工程实践总结
    动态分区最佳-最坏-最先分配
    动态分区代码
    个人作业-软件评测
    软件工程第五次作业
    软件工程第四次作业——结对作业
  • 原文地址:https://www.cnblogs.com/01world/p/5651216.html
Copyright © 2011-2022 走看看