Educational Codeforces Round 23 A - Treasure Hunt

#include 
using namespace std;

int main()
{
    int x1,y1,x2,y2,x,y;
    cin >> x1 >> y1 >> x2 >> y2;
    cin >> x >> y;
    int derx,dery;
    int flag1 = -1,flag2 = -1;
    derx = abs(x1-x2);
    dery = abs(y1-y2);
    if(derx%x != 0)
    {
        cout << "NO" <return 0;
    }
    if(dery%y != 0)
    {
        cout << "NO" <return 0;
    }
    //如果当前起点x坐标移动到终点x坐标的步数
    //多余起点y坐标移动到终点y坐标的度数多
    //就交换一下，方便计算
    int cntx = derx/x;
    int cnty = dery/y;
    if(cntx > cnty)
    {
        cntx ^= cnty ^= cntx ^= cnty;
        x ^= y ^= x ^= y;
    }
    cnty -= cntx;
    if(cnty%2 == 0)
        cout << "YES" << endl;
    else
        cout << "NO" << endl;
    return 0;
}