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);
    }
    
  • 相关阅读:
    tensorflow的日常Demo
    docker 搭建Mysql集群
    简单版nginx lua 完成定向流量分发策略
    简单版nginx lua 完成流量上报于中间件
    redis 数据备份持久化方案
    nginx 场景业务汇总 (中)
    nginx 场景业务汇总 (初)
    Sentinel 哨兵 实现redis高可用
    工地信息化——施工现场网格化管理系统实施小记
    小记 xian80 坐标转换 wgs84
  • 原文地址:https://www.cnblogs.com/01world/p/5651216.html
Copyright © 2011-2022 走看看