Submission #1999376

---

Source Code Expand

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<set>
#include<bitset>
#include<map>

#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)

using namespace std;

typedef long long LL;
typedef double db;

int get(){
	char ch;
	while(ch=getchar(),(ch<'0'||ch>'9')&&ch!='-');
	if (ch=='-'){
		int s=0;
		while(ch=getchar(),ch>='0'&&ch<='9')s=s*10+ch-'0';
		return -s;
	}
	int s=ch-'0';
	while(ch=getchar(),ch>='0'&&ch<='9')s=s*10+ch-'0';
	return s;
}

const int N = 100005;

int n;
struct point{
	int x,y,t;
}a[N];

int main(){
	n=get();
	fo(i,1,n){
		a[i].t=get();
		a[i].x=get();
		a[i].y=get();
	}
	fo(i,1,n){
		int delt=a[i].t-a[i-1].t,w=abs(a[i].x-a[i-1].x)+abs(a[i].y-a[i-1].y);
		if ((delt&1)!=(w&1)||w>delt)return printf("No\n"),0;
	}
	printf("Yes\n");
	return 0;
}

Submission Info

Judge Result