A10103 | Magic Spheres
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Carl is a beginner magician. He has $a$ blue, $b$ violet and $c$ orange magic spheres. In one move he can transform two spheres of the same color into one sphere of any other color. To make a spell that has never been seen before, he needs at least $x$ blue, $y$ violet and $z$ orange spheres. Can he get them (possible, in multiple actions)?
输入格式
The first line of the input contains three integers $a$ , $b$ and $c$ ( $0<=a,b,c<=1000000$ ) — the number of blue, violet and orange spheres that are in the magician's disposal.
The second line of the input contains three integers, $x$ , $y$ and $z$ ( $0<=x,y,z<=1000000$ ) — the number of blue, violet and orange spheres that he needs to get.
The second line of the input contains three integers, $x$ , $y$ and $z$ ( $0<=x,y,z<=1000000$ ) — the number of blue, violet and orange spheres that he needs to get.
输出格式
If the wizard is able to obtain the required numbers of spheres, print "Yes". Otherwise, print "No".
输入输出样例
输入 #1
4 4 0 2 1 2
输出 #1
Yes
输入 #2
5 6 1 2 7 2
输出 #2
No
输入 #3
3 3 3 2 2 2
输出 #3
Yes
In the first sample the wizard has $4$ blue and $4$ violet spheres. In his first action he can turn two blue spheres into one violet one. After that he will have $2$ blue and $5$ violet spheres. Then he turns $4$ violet spheres into $2$ orange spheres and he ends up with $2$ blue, $1$ violet and $2$ orange spheres, which is exactly what he needs.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted