Submission #2544676

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <numeric>
#include <string>
#include <cstdlib>
#include <vector>

#define rep(i, n) for(long i=0; i<(long)(n); ++i)

using namespace std;

// Globals
int n;
const int N=20000;
//int ts[N], xs[N], ys[N]; 
vector<int> ts, xs, ys;

void input() {
  cin >> n;
  ts=vector<int>(n);
  xs=vector<int>(n);
  ys=vector<int>(n);
  rep(i, n) cin >> ts[i] >> xs[i] >> ys[i];
}

void solve() {
  int now_x=0, now_y=0, now_t=0;
  rep (i, n) {
    int x=xs[i], y=ys[i], t=ts[i];
    int dist = abs(now_x - x) + abs(now_y - y);
    int dur = t - now_t;
    bool ok = dist <= dur && dist%2 == dur%2;
    if (!ok) {
      cout << "No" << endl;
      return;
    }
    //printf("%d,%d,%d,%d,%d,%d,%d,%d\n",now_x,x,now_y,y,now_t,t,dist,dur);
    now_x=x; now_y=y; now_t=t;
  }
  cout << "Yes" << endl;
}

int main() {
  input();
  solve();
  return 0;
}

Submission Info

Judge Result