Submission #2982828

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#define MAX_N 100000

struct mov
{
    int t, x, y;
};

mov a[MAX_N + 1 + 1];

int n;

int main()
{
    cin >> n;

    a[1] = {0, 0, 0};

    for(int i = 2; i <= n + 1; i ++)
        cin >> a[i].t >> a[i].x >> a[i].y;

    int ok = 1;
    for(int i = 2; i <= n + 1; i ++)
    {
        int t = a[i].t - a[i - 1].t;
        int dist = abs(a[i].x - a[i - 1].x) + abs(a[i].y - a[i - 1].y);

        if(t < dist)
            ok = 0;

        if(t > dist)
        {
            t -= dist;
            if(t & 1)
                ok = 0;
        }
    }

    cout << (ok == 1 ? "Yes\n" : "No\n");

    return 0;
}

Submission Info

Judge Result