CodeForces 670D Magic Powder

二分。

二分一下答案，然后验证一下。

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<iostream>
using namespace std;
typedef long long LL;
const double pi=acos(-1.0),eps=1e-6;
void File()
{freopen("D:\\in.txt","r",stdin);freopen("D:\\out.txt","w",stdout);
}
template <class T>
inline void read(T &x)
{char c=getchar(); x=0;while(!isdigit(c)) c=getchar();while(isdigit(c)) {x=x*10+c-'0'; c=getchar();}
}const int maxn=100010;
LL k,a[maxn],b[maxn];
int n;bool check(LL x)
{LL sum=0;for(int i=1;i<=n;i++){if(a[i]*x<=b[i]) continue;sum=sum+a[i]*x-b[i];if(sum>k) return 0;}if(sum<=k) return 1;return 0;
}int main()
{scanf("%d%lld",&n,&k);for(int i=1;i<=n;i++) scanf("%lld",&a[i]);for(int i=1;i<=n;i++) scanf("%lld",&b[i]);LL L=0,R=3e9,ans;while(L<=R){LL mid=(L+R)/2;if(check(mid)) L=mid+1,ans=mid;else R=mid-1;}printf("%lld\n",ans);return 0;
}

转载于:https://www.cnblogs.com/zufezzt/p/5899578.html

CodeForces 670D Magic Powder相关推荐

codeforces 670D1 Magic Powder - 1
题目链接:http://codeforces.com/problemset/problem/670/D1 题目:Magic Powder - 1 time limit per test 1 secon ...
CodeForces 670D2 Magic Powder - 2
Description The term of this problem is the same as the previous one, the only exception - increased ...
CodeForces 670D2 Magic Powder - 2（二分+贪心）
http://codeforces.com/contest/670/problem/D2 简单的二分,二分所有可以做的饼干数,然后遍历就可以啦 #include <iostream> #i ...
【CodeForces - 670D1 】Magic Powder - 1 （模拟或枚举或二分优化）
题干: This problem is given in two versions that differ only by constraints. If you can solve this pro ...
Magic Powder - 2
https://codeforces.com/contest/670/problem/D2 The term of this problem is the same as the previous o ...
Magic Powder - 2 （CF 670_D）
http://codeforces.com/problemset/problem/670/D2 The term of this problem is the same as the previous ...
codeforce之Magic Powder
题目: The term of this problem is the same as the previous one, the only exception - increased restric ...
Magic Powder - 1，2
问题 This problem is given in two versions that differ only by constraints. If you can solve this prob ...
Magic Powder - 2 CodeForces - 670D2（二分答案）
先贴一篇关于二分边界问题的博客,看来自己还是对二分边界的理解不够深入题目:今天我们要来造房子.造这个房子需要n种原料,每造一个房子需要第i种原料ai个.现在你有第i种原料bi个.此外,你还有一种特殊 ...

CodeForces 670D Magic Powder

CodeForces 670D Magic Powder相关推荐

最新文章

热门文章