判断第i步能不能到这个地方,要求相邻两步的时间差与相邻两步的坐标和的差奇偶性相同且关系是大于
Problem Statement
AtCoDeer the deer is going on a trip in a two-dimensional plane. In his plan, he will depart from point (0,0) at time 0, then for each i between 1 and N(inclusive), he will visit point (xi,yi) at time ti.
If AtCoDeer is at point (x,y) at time t, he can be at one of the following points at time t+1: (x+1,y), (x−1,y), (x,y+1) and (x,y−1). Note that he cannot stay at his place. Determine whether he can carry out his plan.
Constraints- 1 ≤ N ≤ 105
- 0 ≤ xi ≤ 105
- 0 ≤ yi ≤ 105
- 1 ≤ ti ≤ 105
- ti < ti+1 (1 ≤ i ≤ N−1)
- All input values are integers.
Input is given from Standard Input in the following format:
N t1 x1 y1 t2 x2 y2 : tN xN yNOutput
If AtCoDeer can carry out his plan, print Yes
; if he cannot, print No
.
2 3 1 2 6 1 1Sample Output 1
Yes
For example, he can travel as follows: (0,0), (0,1), (1,1), (1,2), (1,1), (1,0), then (1,1).
Sample Input 21 2 100 100Sample Output 2
No
It is impossible to be at (100,100) two seconds after being at (0,0).
Sample Input 32 5 1 1 100 1 1Sample Output 3
No
#include<cstdio>
int main()
{
int n,t[100005],i;
int x[100005],y[100005];
t[0]=x[0]=y[0]=0;
while(scanf("%d",&n)!=EOF)
{
for( i=1;i<=n;i++)
{
scanf("%d",&t[i]);
scanf("%d",&x[i]);
scanf("%d",&y[i]);
}
for( i=1;i<=n;i++)
{
if((x[i]+y[i]-x[i-1]-y[i-1])%2!=0&&(t[i]-t[i-1])%2==0||(x[i]+y[i]-x[i-1]-y[i-1])%2==0&&(t[i]-t[i-1])%2!=0)
break;
if((x[i]+y[i]-x[i-1]-y[i-1])%2==0&&(t[i]-t[i-1])%2==0||(x[i]+y[i]-x[i-1]-y[i-1])%2!=0&&(t[i]-t[i-1])%2!=0)
if(t[i]<x[i]+y[i])
break;
}
if(i==n+1)
printf("Yes\n");
else
printf("No\n");
}
return 0;
}