CF912A.Tricky Alchemy
入门
通过率:0%
时间限制:1.00s
内存限制:256MB
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
During the winter holidays, the demand for Christmas balls is exceptionally high. Since it's already 2018, the advances in alchemy allow easy and efficient ball creation by utilizing magic crystals.
Grisha needs to obtain some yellow, green and blue balls. It's known that to produce a yellow ball one needs two yellow crystals, green — one yellow and one blue, and for a blue ball, three blue crystals are enough.
Right now there are A yellow and B blue crystals in Grisha's disposal. Find out how many additional crystals he should acquire in order to produce the required number of balls.
寒假期间,圣诞球的需求量异常巨大。由于现在已经是2018年,炼金术的进步使得人们能够借助魔法水晶,轻松高效地制作圣诞球。
格里沙需要制作若干黄色、绿色和蓝色的球。已知:制作一个黄色球需要 2 颗黄色水晶;制作一个绿色球需要 1 颗黄色水晶和 1 颗蓝色水晶;制作一个蓝色球则只需 3 颗蓝色水晶。
目前格里沙手头有 A 颗黄色水晶和 B 颗蓝色水晶。请计算:为了制作出所需数量的各色球,他至少还需额外获取多少颗水晶?
输入格式
The first line features two integers A and B (0 ≤ A, B ≤ 109), denoting the number of yellow and blue crystals respectively at Grisha's disposal.
The next line contains three integers x, y and z (0 ≤ x, y, z ≤ 109) — the respective amounts of yellow, green and blue balls to be obtained.
第一行包含两个整数 A 和 B(0 ≤ A, B ≤ 109),分别表示格里沙所拥有的黄色和蓝色水晶的数量。
下一行包含三个整数 x、y 和 z(0 ≤ x, y, z ≤ 109)—— 分别表示需要获得的黄色、绿色和蓝色球的数量。
输出格式
Print a single integer — the minimum number of crystals that Grisha should acquire in addition.
输出一个整数——格里沙需要额外获取的水晶的最小数量。
输入输出样例
输入#1
4 3 2 1 1
输出#1
2
输入#2
3 9 1 1 3
输出#2
1
输入#3
12345678 87654321 43043751 1000000000 53798715
输出#3
2147483648
说明/提示
In the first sample case, Grisha needs five yellow and four blue crystals to create two yellow balls, one green ball, and one blue ball. To do that, Grisha needs to obtain two additional crystals: one yellow and one blue.
在第一个样例中,Grisha 需要 5 个黄色水晶和 4 个蓝色水晶来制作 2 个黄色球、1 个绿色球和 1 个蓝色球。为此,Grisha 需要额外获取 2 个水晶:1 个黄色水晶和 1 个蓝色水晶。
输入解题思路,AI测评打分。不知道怎么写?