Submission #2983333

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define repr(i, a, b) for(int i = a; i >= b; i--)
#define int long long
#define all(a) a.begin(), a.end()
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef pair<int, int> P;
const int mod = 1000000007;
const int INF = 1e15;

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    vector<int> t(n + 1), x(n + 1), y(n + 1);
    t[0] = x[0] = y[0] = 0;
    rep(i, 1, n + 1) cin >> t[i] >> x[i] >> y[i];
    bool f = true;
    rep(i, 1, n + 1){
        int diff = abs(x[i] - x[i - 1]) + abs(y[i] - y[i - 1]);
        int tm = t[i] - t[i - 1];
        if(diff <= tm && diff % 2 == tm % 2) ;
        else f = false;
    }
    if(f) cout << "Yes" << endl;
    else cout << "No" << endl;
}

Submission Info

Judge Result