CodeForces - 670D1 Magic Powder - 1 （模拟）

最新推荐文章于 2019-03-11 19:42:37 发布

原创最新推荐文章于 2019-03-11 19:42:37 发布 · 1.1k 阅读

0 ·

CC 4.0 BY-SA版权

模拟同时被 2 个专栏收录

132 篇文章

订阅专栏

codeforces

106 篇文章

订阅专栏

本文解析了CodeForces-670D烘焙问题，介绍了一个使用有限数量的原料和魔法粉来最大化饼干产量的问题解决方法。通过模拟算法确定了在给定的原料数量和魔法粉的帮助下，能制作的最大饼干数。

CodeForces - 670D1

Magic Powder - 1

Time Limit: 1000MS

Memory Limit: 262144KB

64bit IO Format: %I64d & %I64u

Submit Status

Description

This problem is given in two versions that differ only by constraints. If you can solve this problem in large constraints, then you can just write a single solution to the both versions. If you find the problem too difficult in large constraints, you can write solution to the simplified version only.

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 ≤ n, k ≤ 1000) — the number of ingredients and the number of grams of the magic powder.

The second line contains the sequence a₁, a₂, ..., a_n (1 ≤ a_i ≤ 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₁, b₂, ..., b_n (1 ≤ b_i ≤ 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.

Sample Input

Input

3 1
2 1 4
11 3 16

Output

Input

4 3
4 3 5 6
11 12 14 20

Output

Sample Output

Hint

Source

Codeforces Round #350 (Div. 2)

//题意：输入n,m; m表示的事魔法元素的数量，每个魔法元素可以转变成任意一个其他的元素；

表示制作饼干需要n种元素，并且制作一个饼干所需的每种元素的的数量是a[i],现在给你每种元素的数量b[i]，问你最多可以制作几个饼干？

//思路：

因为n是1000，所以直接模拟，最多是1000*1000；

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
#define INF 0x3f3f3f3f
#define N 1010
using namespace std;
int a[N],b[N];
struct zz
{
	int a;
	int b;
	int c;
}p[N]; 
int main()
{
	int n,k,i;
	while(scanf("%d%d",&n,&k)!=EOF)
	{
		int sum=0;
		for(i=0;i<n;i++)
			scanf("%d",&a[i]);
		for(i=0;i<n;i++)
			scanf("%d",&b[i]);
		int mm=INF;
		for(i=0;i<n;i++)
		{
			p[i].a=b[i]/a[i];
			p[i].b=b[i]%a[i];
			p[i].c=a[i]-p[i].b;
			mm=min(mm,p[i].a);
		}
		while(1)
		{
			for(i=0;i<n;i++)
			{
				if(p[i].a==mm)
				{
					if(k<p[i].c)
						break;
					else
					{
						k-=p[i].c;
						p[i].c=a[i];
						p[i].a=mm+1;
					}
				}				
			}
			if(i==n)
				mm++;
			else
				break;
		}
		printf("%d\n",mm);
	}
	return 0;
}