Codeforces Round #335 (Div. 2) A.Magic Spheres

A. Magic Spheres

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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)?

Input

The first line of the input contains three integers a, b and c (0 ≤ a, b, c ≤ 1 000 000) — 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 ≤ 1 000 000) — the number of blue, violet and orange spheres that he needs to get.

Output

If the wizard is able to obtain the required numbers of spheres, print "Yes". Otherwise, print "No".

Sample test(s)

Input

4 4 0
2 1 2

Output

Yes

Input

5 6 1
2 7 2

Output

No

Input

3 3 3
2 2 2

Output

Yes

Note

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.

题意：有x个蓝球，y个紫球，z个橙球，每次可以将两个相同颜色的球转换成另一种颜色，问三种球的数量x,y,z是否能得到a,b,c。

思路：其实就是每种球可以作-2或者+1的运算使得它变成目标数目，如果-2的次数大于等于+1的次数，那么就可以得出a,b,c。

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <time.h>
using namespace std;
int a, b, c, x, y, z;
int u, v;//u = 1, v = -2
int main()
{
    scanf("%d %d %d", &a, &b, &c);
    scanf("%d %d %d", &x, &y, &z);
    u = v = 0;
    if(a > x){
        if((a - x)%2==1) u++, v = v + (a+1-x)/2;
        else v = v + (a-x)/2;
    }
    if(b > y){
        if((b - y)%2==1) u++, v = v + (b+1-y)/2;
        else v = v + (b-y)/2;
    }
    if(c > z){
        if((c - z)%2==1) u++, v = v + (c+1-z)/2;
        else v = v + (c-z)/2;
    }
    if(a < x) u += (x-a);
    if(b < y) u += (y-b);
    if(c < z) u += (z-c);
    if(u <= v) printf("YES\n");
    else printf("NO\n");
}