input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n=int(eval(input()))
a=[int(x) for x in input().split()]
b=10000
for i in range(n):
c=(sum(a[:i+1])-sum(a[i+1:]))**2
if c<b:
b=c
print((int(b**0.5))) | n=int(eval(input()))
a=[int(x) for x in input().split()]
b=100
for i in range(1,n):
c=abs(sum(a[:i])-sum(a[i:]))
if c<b:
b=c
print(b) | p03012 |
from itertools import accumulate
n = int(eval(input()))
w_lst = list(map(int,input().split()))
wa = [0] + list(accumulate(w_lst))
ans = wa[-1]
for i in range(len(wa)-1):
sa = abs((wa[-1] - wa[i]) - wa[i])
if sa < ans:
ans = sa
print(ans) | n = int(eval(input()))
w_lst = list(map(int,input().split()))
ans = float("inf")
for i in range(len(w_lst)):
if abs(sum(w_lst[0:i]) - sum(w_lst[i:])) < ans:
ans = abs(sum(w_lst[0:i]) - sum(w_lst[i:]))
print(ans) | p03012 |
N = int(eval(input()))
W = [int(i) for i in input().split()]
A = sum(W)
ans = float('inf')
for i in range(N):
tmp = abs(sum(W[: i]) - (A - sum(W[: i])))
ans = min(ans, tmp)
print(ans) | n = int(eval(input()))
W = list(map(int, input().split()))
diff = float('inf')
for i in range(1, n):
x = abs(sum(W[: i]) - sum(W[i :]))
if x < diff:
diff = x
print(diff) | p03012 |
n = int(eval(input()))
a = [int(i) for i in input().split()]
ret = 1000
for i in range(1, n):
s = abs(sum(a[:i]) - sum(a[i:]))
if s < ret:
ret = s
print(ret) | from sys import stdin
n = int(eval(input()))
a = [int(i) for i in stdin.readline().rstrip().split()]
ret = 1000
for i in range(1, n):
s = abs(sum(a[:i]) - sum(a[i:]))
if s < ret:
ret = s
print(ret)
| p03012 |
n = int(eval(input()))
w = list(map(int, input().split()))
s1 = 0
s2 = 0
ref = sum(w)
for i in range(n - 1):
s1 = sum(w[0: i + 1])
s2 = sum(w[i + 1: n])
diff = abs(s1 - s2)
if diff <= ref:
ref = diff
print(ref) | n = int(eval(input()))
w = list(map(int, input().split()))
s1 = w[0]
s2 = w[n - 1]
c1 = 1
c2 = 1
ref = sum(w)
for i in range(n - 2):
if abs(s1 + w[c1] - s2) >= abs(s1 - (s2 + w[n - 1 - c2])):
s2 = s2 + w[n - 1 - c2]
c2 = c2 + 1
else:
s1 = s1 + w[c1]
c1 = c1 + 1
print((abs(s1 - s2))) | p03012 |
n = int(eval(input()))
t0, x0, y0 = 0, 0, 0
for i in range(n):
ti, xi, yi = list(map(int, input().split()))
test = (ti - t0) - (xi + yi - x0 - y0)
if test >= 0 and test % 2 == 0:
t0, x0, y0 = ti, xi, yi
if i == n-1:
print("Yes")
else:
print("No")
break | #高速化
import sys
input_ = sys.stdin.readline
n = int(input_())
t0, x0, y0 = 0, 0, 0
for i in range(n):
ti, xi, yi = list(map(int, input_().split()))
test = (ti - t0) - (xi + yi - x0 - y0)
if test >= 0 and test % 2 == 0:
t0, x0, y0 = ti, xi, yi
if i == n-1:
print("Yes")
else:
print("No")
break | p03457 |
n=int(eval(input()));t,x,y,r1,r2=[],[],[],0,0
for _ in range(n):
a,b,c=list(map(int,input().split()))
t.append(a);x.append(b),y.append(c)
for i in range(n):
r1,r2=[[t[0],x[0]+y[0]],[t[i]-t[i-1],abs(x[i]-x[i-1])+abs(y[i]-y[i-1])]][i!=0]
if not (r1>=r2 and r1%2==r2%2): print('No');break
else:
print('Yes') | n=int(eval(input()));t,x,y=[],[],[]
for _ in range(n):
a,b,c=list(map(int,input().split()))
t.append(a);x.append(b),y.append(c)
for i in range(n):
r1,r2=[[t[0],x[0]+y[0]],[t[i]-t[i-1],abs(x[i]-x[i-1])+abs(y[i]-y[i-1])]][i!=0]
if not (r1>=r2 and r1%2==r2%2): print('No');break
else:
print('Yes') | p03457 |
N = int(eval(input()))
ts = [0]
xs = [0]
ys = [0]
for _ in range(N):
t,x,y = [ int(a) for a in input().split() ]
ts.append(t)
xs.append(x)
ys.append(y)
good = True
for i in range(N):
dist = abs(xs[i]-xs[i+1])+abs(ys[i]-ys[i+1])
time = ts[i+1]-ts[i]
# Parity
if dist%2 != time%2:
good = False
# Distance
if dist > time:
good = False
if good:
print('Yes')
else:
print('No')
| n = int(input())
x = 0
y = 0
t = 0
do = True
for i in range(0, n):
z = input().split(" ")
nt = int(z[0])
nx = int(z[1])
ny = int(z[2])
dt = nt - t
dx = nx - x
dy = ny - y
t = nt
x = nx
y = ny
if (abs(dx)+abs(dy))%2 != (dt)%2:
do = False
break
if abs(dx)+abs(dy) > abs(dt):
do = False
break
if do:
print("Yes")
else:
print("No")
| p03457 |
n = int(eval(input()))
pre_t, pre_x, pre_y = [0, 0, 0]
ok = True
for i in range(n):
t, x, y = list(map(int, input().split()))
if (((t-pre_t) - (abs(x-pre_x) + abs(y-pre_y))) < 0
or ((t-pre_t) - (abs(x-pre_x) + abs(y-pre_y))) % 2 != 0):
ok = False
break
pre_t, pre_x, pre_y = [t, x, y]
if ok:
print("Yes")
else:
print("No") | n = int(eval(input()))
pre_t, pre_x, pre_y = [0, 0, 0]
ok = True
for i in range(n):
t, x, y = list(map(int, input().split()))
if (((t-pre_t) - abs(x-pre_x) - abs(y-pre_y)) < 0
or ((t-pre_t) - abs(x-pre_x) - abs(y-pre_y)) % 2 != 0):
ok = False
break
pre_t, pre_x, pre_y = [t, x, y]
if ok:
print("Yes")
else:
print("No") | p03457 |
n = int(eval(input()))
pre_t, pre_x, pre_y = [0, 0, 0]
ok = True
for i in range(n):
t, x, y = list(map(int, input().split()))
if (((t-pre_t) - abs(x-pre_x) - abs(y-pre_y)) < 0
or ((t-pre_t) - abs(x-pre_x) - abs(y-pre_y)) % 2 != 0):
ok = False
break
pre_t, pre_x, pre_y = [t, x, y]
if ok:
print("Yes")
else:
print("No") | n = int(eval(input()))
pre_t, pre_x, pre_y = [0, 0, 0]
ok = True
for i in range(n):
t, x, y = list(map(int, input().split()))
d = (t-pre_t) - abs(x-pre_x) - abs(y-pre_y)
if d < 0 or d % 2 != 0:
ok = False
break
pre_t, pre_x, pre_y = [t, x, y]
if ok:
print("Yes")
else:
print("No") | p03457 |
n=int(eval(input()))
A=[]
for i in range(n):
a,b,c=list(map(int,input().split()))
if a<b+c or (b+c)%2!=a%2:
print("No")
exit()
A.append([a,b,c])
if n==1:
print("Yes")
exit()
for i in range(n-1):
if not A[i+1][0]-A[i][0]>=A[i+1][2]+A[i+1][1]-A[i][1]-A[i][2]:
print("No")
exit()
print("Yes")
| n=int(eval(input()))
A=[]
for i in range(n):
a,b,c=list(map(int,input().split()))
if a<b+c or (b+c)%2!=a%2:
print("No")
exit()
A.append([a,b,c])
for i in range(n-1):
if not A[i+1][0]-A[i][0]>=A[i+1][2]+A[i+1][1]-A[i][1]-A[i][2]:
print("No")
exit()
print("Yes")
| p03457 |
N = int(eval(input()))
count = 0
T, X, Y = 0, 0, 0
for i in range(N):
t, x, y = list(map(int, input().split()))
if abs(x-X)+abs(y-Y) <= t-T and t % 2 == (x+y) % 2:
count += 1
T, X, Y = t, x, y
if count==N:
print('Yes')
else:
print('No') | N = int(eval(input()))
for _ in range(N):
t, x, y = list(map(int, input().split()))
if x + y > t or (t + x + y)%2 != 0:
print("No")
quit()
print("Yes") | p03457 |
N = int(eval(input()))
for _ in range(N):
t, x, y = list(map(int, input().split()))
if x + y > t or (t + x + y)%2 != 0:
print("No")
quit()
print("Yes") | N = int(eval(input()))
for _ in range(N):
t, x, y = list(map(int, input().split()))
if x + y > t or (t + x + y)%2 != 0:
print("No")
exit()
print("Yes") | p03457 |
n=int(eval(input()))
T,X,Y=0,0,0
a='Yes'
for i in range(n):
t,x,y=list(map(int,input().split()))
if abs(x-X)+abs(y-Y)>t-T or t%2!=(x+y)%2:
a='No'
break
T,X,Y=t,x,y
print(('{}'.format(a))) | N = int(eval(input()))
for _ in range(N):
t, x, y = list(map(int, input().split()))
if x + y > t or (t + x + y)%2 != 0:
print("No")
exit()
print("Yes") | p03457 |
import sys
N = int(eval(input()))
for i in range(N):
t, x, y = list(map(int, input().split(" ")))
if x > 0 and t >= x:
t = t - x
x = 0
for j in range(t):
if y >= 0:
y -=1
else:
y +=1
elif x < 0 and t >= x * (-1):
t = t -(-1 * x)
x = 0
for j in range(t):
if y >= 0:
y -=1
else:
y +=1
else:
for j in range(t):
if y >= 0:
y -=1
else:
y +=1
if x != 0 or y !=0:
print("No")
sys.exit()
print("Yes") | import sys
N = int(eval(input()))
for i in range(N):
t, x, y = list(map(int, input().split(" ")))
t = t - x - y
if t % 2 != 0 or t < 0:
print("No")
sys.exit()
print("Yes") | p03457 |
N = int(eval(input()))
pre_t = 0
pre_x = 0
pre_y = 0
count = 0
for _ in range(N):
flag = False
t, x, y = list(map(int, input().split()))
for a in range(t - pre_t + 1):
for b in range(t - pre_t + 1 - a):
if pre_x + a - b == x:
for c in range(t - pre_t + 1 - a - b):
d = t - pre_t - a - b - c
if pre_y + c - d == y:
count += 1
flag = True
break
if flag:
break
if flag:
break
pre_t = t
pre_x = x
pre_y = y
if count == N:
print("Yes")
else:
print("No") | N = int(eval(input()))
pre_t = 0
pre_x = 0
pre_y = 0
count = 0
for _ in range(N):
flag = False
t, x, y = list(map(int, input().split()))
for a in range(t - pre_t + 1):
b = pre_x - x + a
if b >= 0:
for c in range(t - pre_t + 1 - a - b):
d = t - pre_t - a - b - c
if pre_y + c - d == y:
count += 1
flag = True
break
if flag:
break
pre_t = t
pre_x = x
pre_y = y
if count == N:
print("Yes")
else:
print("No") | p03457 |
N = int(eval(input()))
pre_t = 0
pre_x = 0
pre_y = 0
count = 0
for _ in range(N):
flag = False
t, x, y = list(map(int, input().split()))
for a in range(t - pre_t + 1):
b = pre_x - x + a
if b >= 0:
for c in range(t - pre_t + 1 - a - b):
d = t - pre_t - a - b - c
if pre_y + c - d == y:
count += 1
flag = True
break
if flag:
break
pre_t = t
pre_x = x
pre_y = y
if count == N:
print("Yes")
else:
print("No") | N = int(eval(input()))
pre_t = 0
pre_x = 0
pre_y = 0
count = 0
for _ in range(N):
t, x, y = list(map(int, input().split()))
if x > pre_x:
a = x - pre_x
b = 0
else:
b = pre_x - x
a = 0
if y > pre_y:
c = y - pre_y
d = 0
else:
d = pre_y - y
c = 0
total = a+b+c+d
if t - pre_t >= total and (t - pre_t - total) % 2 == 0:
count += 1
pre_t = t
pre_x = x
pre_y = y
if count == N:
print("Yes")
else:
print("No") | p03457 |
N = int(eval(input()))
pre_t = 0
pre_x = 0
pre_y = 0
count = 0
for _ in range(N):
t, x, y = list(map(int, input().split()))
if x > pre_x:
a = x - pre_x
b = 0
else:
b = pre_x - x
a = 0
if y > pre_y:
c = y - pre_y
d = 0
else:
d = pre_y - y
c = 0
total = a+b+c+d
if t - pre_t >= total and (t - pre_t - total) % 2 == 0:
count += 1
else:
print("No")
break
pre_t = t
pre_x = x
pre_y = y
if count == N:
print("Yes") | N = int(eval(input()))
pre_t = 0
pre_x = 0
pre_y = 0
count = 0
for _ in range(N):
t, x, y = list(map(int, input().split()))
if x > pre_x:
a = x - pre_x
b = 0
else:
b = pre_x - x
a = 0
if y > pre_y:
c = y - pre_y
d = 0
else:
d = pre_y - y
c = 0
total = a+b+c+d
if t - pre_t >= total and (t - pre_t - total) % 2 == 0:
count += 1
pre_t = t
pre_x = x
pre_y = y
if count == N:
print("Yes")
else:
print("No") | p03457 |
import sys
def input(): return sys.stdin.readline().strip()
def resolve():
def main():
n=int(eval(input()))
l=[list(map(int,input().split())) for i in range(n)]
l.insert(0,[0,0,0])
for j in range(n):
t,x,y=l[j+1][0]-l[j][0],l[j+1][1]-l[j][1],l[j+1][2]-l[j][2]
if t<(abs(x)+abs(y))or t%2!=(abs(x)+abs(y))%2:
return 'No'
return 'Yes'
print((main()))
resolve() | import sys
def input(): return sys.stdin.readline().strip()
def resolve():
n=int(eval(input()))
l=[list(map(int,input().split())) for i in range(n)]
l.insert(0,[0,0,0])
ans='Yes'
for i in range(n):
t=l[i+1][0]-l[i][0]
x=abs(l[i+1][1]-l[i][1])
y=abs(l[i+1][2]-l[i][2])
if t<x+y or t%2!=(x+y)%2:
ans='No'
break
print(ans)
resolve() | p03457 |
n = int(eval(input()))
t = 0
res = True
x, y = 0, 0
for i in range(n):
t2, x2, y2 = list(map(int, input().split()))
dt = t2 - t
#print("cur {0} {1} {2}".format(t, x, y))
#print("d {0} {1} {2}".format(dt, x2, y2))
#print("ju {0} {1} {2} {3}".format(abs(x-x2) + abs(y-y2), dt, (abs(x-x2) + abs(y-y2) - dt) % 2, 1))
if abs(x-x2) + abs(y-y2) > dt or (abs(x-x2) + abs(y-y2) - dt) % 2 == 1:
res = False
t, x, y = t2, x2, y2
print(("Yes" if res else "No")) | n = int(eval(input()))
pt = 0
px, py = 0, 0
f = True
for i in range(n):
t, x, y = list(map(int, input().split()))
dis = abs(px-x) + abs(py-y)
dt = t - pt
#print("dis{0} dt = {1}".format(dis, dt))
if dt >= dis and abs(dis - dt) % 2 == 0:
pass
else:
f = False
pt, px, py = t, x, y
print(("Yes" if f else "No"))
| p03457 |
n = int(eval(input()))
pt = 0
px, py = 0, 0
f = True
for i in range(n):
t, x, y = list(map(int, input().split()))
dis = abs(px-x) + abs(py-y)
dt = t - pt
#print("dis{0} dt = {1}".format(dis, dt))
if dt >= dis and abs(dis - dt) % 2 == 0:
pass
else:
f = False
pt, px, py = t, x, y
print(("Yes" if f else "No"))
| n = int(eval(input()))
can = True
time = 0
x = 0
y = 0
for _ in range(n):
t, xx, yy = list(map(int,input().split()))
distance = abs(x-xx) + abs(y - yy)
difft = t - time
if difft < distance:
can = False
break
if (distance - difft) % 2 == 1:
can = False
break
x = xx
y = yy
time = t
print(("Yes" if can else "No")) | p03457 |
N = int(eval(input()))
P = [(0,0,0)] + [tuple(int(x) for x in input().split()) for _ in range(N)]
def travelable(p,q):
time = q[0] - p[0]
dist = abs(q[1]-p[1]) + abs(q[2]-p[2])
if dist <= time and time%2 == dist%2:
return True
else:
return False
from itertools import zip_longest
print(('Yes' if all(travelable(p,q) for p,q in zip_longest(P[:N],P[1:])) else 'No')) | N = int(eval(input()))
P = [(0,0,0)] + [tuple(int(x) for x in input().split()) for _ in range(N)]
def travelable(p,q):
time = q[0] - p[0]
dist = abs(q[1]-p[1]) + abs(q[2]-p[2])
if dist <= time and time%2 == dist%2:
return True
else:
return False
print(('Yes' if all(travelable(p,q) for p,q in zip(P[:N],P[1:])) else 'No')) | p03457 |
# ABC086C - Traveling (ARC089C)
import sys
input = sys.stdin.readline
def main():
n = int(eval(input()))
A = tuple(tuple(map(int, input().rstrip().split())) for _ in range(n))
for t, x, y in A:
if x + y > t or (t + x + y) % 2 != 0:
print("No")
break
else:
print("Yes")
if __name__ == "__main__":
main() | # ABC086C - Traveling (ARC089C)
import sys
input = sys.stdin.readline
def main():
n = int(eval(input()))
A = tuple(tuple(map(int, input().split())) for _ in range(n))
for t, x, y in A:
if x + y > t or (t + x + y) % 2 != 0:
print("No")
break
else:
print("Yes")
if __name__ == "__main__":
main() | p03457 |
#!/usr/bin/python
# -*- coding: utf-8 -*-
N = int(eval(input()))
txy = []
for _ in range(N):
t, x, y = list(map(int, input().strip().split()))
txy.append((t, x, y))
can_travel = False
prev_t, prev_x, prev_y = 0,0,0
for t, x, y in txy:
if abs(x-prev_x) + (y-prev_y) > t - prev_t:
can_travel = False
break
elif (abs(x-prev_x) + abs(y-prev_y)) % 2 != (t-prev_t) % 2:
can_travel = False
break
else:
prev_t, prev_x, prev_y = t, x, y
can_travel = True
continue
if can_travel:
print("Yes")
else:
print("No") | N = int(input().strip())
prevt, prevx, prevy = 0, 0, 0
t = True
for n in range(N):
t, x, y = list(map(int, input().strip().split()))
if t - prevt >= abs(x-prevx) + abs(y-prevy) and (t-prevt) % 2 == (abs(x-prevx) + abs(y-prevy)) % 2:
prevt, prevx, prevy = t, x, y
else:
t = False
break
if t:
print("Yes")
else:
print("No") | p03457 |
from sys import stdin
def main():
#入力
readline=stdin.readline
N=int(readline())
t=[0]*N
x=[0]*N
y=[0]*N
for i in range(N):
t[i],x[i],y[i]=list(map(int,readline().split()))
nt=[]
nx=[]
ny=[]
for i in range(N):
if i==0:
nt.append(t[0])
nx.append(x[0])
ny.append(y[0])
else:
nt.append(t[i]-t[i-1])
nx.append(x[i]-x[i-1])
ny.append(y[i]-y[i-1])
for i in range(N):
if nt[i]<abs(nx[i])+abs(ny[i]):
print("No")
break
elif nt[i]%2!=(abs(nx[i])+abs(ny[i]))%2:
print("No")
break
else:
print("Yes")
if __name__=="__main__":
main() | from sys import stdin
def main():
#入力
readline=stdin.readline
n=int(readline())
t=[0]*n
x=[0]*n
y=[0]*n
for i in range(n):
t[i],x[i],y[i]=list(map(int,readline().split()))
flag=True
for i in range(n):
if i==0:
if t[i]==x[i]+y[i]:
pass
else:
flag=False
break
else:
a=t[i]-t[i-1]
b=abs(x[i]-x[i-1])
c=abs(y[i]-y[i-1])
if a>=b+c and a%2==(b+c)%2:
pass
else:
flag=False
break
if flag:
print("Yes")
else:
print("No")
if __name__=="__main__":
main() | p03457 |
N = int(eval(input()))
t = x = y = [0]
for i in range(N):
tn,xn,yn = list(map(int,input().split()))
t = t+[tn]
x = x+[xn]
y = y+[yn]
dt = t[i+1]-t[i]
d = abs(x[i+1]-x[i])+abs(y[i+1]-y[i])
if d <= dt and dt%2 == d%2:
isValid = True
else:
isValid = False
break
print(("Yes" if isValid else "No")) | N = int(eval(input()))
t = x = y = 0
for i in range(N):
tn,xn,yn = list(map(int,input().split()))
dt = tn-t
d = abs(xn-x)+abs(yn-y)
if d <= dt and dt%2 == d%2:
t,x,y = tn,xn,yn
isValid = True
else:
isValid = False
break
print(("Yes" if isValid else "No")) | p03457 |
n = int(eval(input()))
l = [list(map(int, input().split())) for _ in range(n)]
x = y = t = 0
for i in range(n):
dx, dy, dt = l[i][1], l[i][2], l[i][0]
dist = abs((dx - x) + (dy - y))
if abs(dt - t) < dist:
print("No")
exit()
if abs(dt - t) % 2:
if dist % 2 == 0:
print("No")
exit()
else:
if dist % 2 == 1:
print("No")
exit()
x, y, t = dx, dy, dt
print("Yes") | n = int(eval(input()))
l = [list(map(int, input().split())) for _ in range(n)]
x = y = t = 0
for i in range(n):
dx, dy, dt = l[i][1], l[i][2], l[i][0]
dist = abs((dx - x) + (dy - y))
if abs(dt - t) < dist or (dt - t - dist) % 2:
print("No")
exit()
x, y, t = dx, dy, dt
print("Yes") | p03457 |
n = int(eval(input()))
plan_list = list()
#最初に0,0の座標を定義しなさい
plan_list.append([0,0,0])
for i in range(n):
plan_list.append(list(map(int,input().split())))
for i in range(n):
t_margin = abs(plan_list[i+1][0] - plan_list[i][0])
x_margin = abs(plan_list[i+1][1] - plan_list[i][1])
y_margin = abs(plan_list[i+1][2] - plan_list[i][2])
xy_margin = x_margin + y_margin
if t_margin < xy_margin or xy_margin % 2 != t_margin % 2:
print("No")
break
else:
print("Yes") | n = int(eval(input()))
t_list = [0]
x_list = [0]
y_list = [0]
for i in range(n):
t,x,y = list(map(int,input().split()))
t_list.append(t)
x_list.append(x)
y_list.append(y)
for i in range(1,n+1):
t_margin = t_list[i] - t_list[i-1]
x_margin = abs(x_list[i] - x_list[i-1])
y_margin = abs(y_list[i] - y_list[i-1])
t_temp = t_margin%2
xy_temp = (x_margin+y_margin)%2
if (t_temp != xy_temp) or (t_margin < x_margin + y_margin):
print("No")
break
else:
print("Yes") | p03457 |
n = int(eval(input()))
ans = "Yes"
t,x,y = 0,0,0
for i in range(n):
t1,x1,y1 = list(map(int,input().split()))
td,dis = t1-t,x1+y1-x-y
if td%2 != dis%2 or td < dis:
ans = "No"
break
t,x,y = t1,x1,y1
print(ans) | from sys import stdin
input = stdin.readline
lines = stdin.readlines
n = int(eval(input()))
txy = ((list(map(int, line.split()))) for line in lines())
ans = "Yes"
t,x,y = 0,0,0
for t1,x1,y1 in txy:
td,dis = t1-t,abs(x1-x)+abs(y1-y)
if td%2 != dis%2 or td < dis:
ans = "No"
break
t,x,y = t1,x1,y1
print(ans) | p03457 |
n=int(eval(input()))
t=[list(map(int,input().split()))for i in range(n)]
t.insert(0,[0,0,0])
for i in range(n):
dxy=abs(t[i][1]-t[i+1][1])+abs(t[i][2]-t[i+1][2])
dt=abs(t[i][0]-t[i+1][0])
dd=dt-dxy
if dxy<=dt and dd%2==0:
pass
else:
print("No")
exit()
print("Yes")
| n=int(input())
cnt=0
for i in range(n):
t,x,y=map(int,input().split())
if x+y<=t and t%2==(x+y)%2:
cnt+=1
print("Yes") if cnt==n else print("No")
| p03457 |
N = int(eval(input()))
txy = [(0, 0, 0)] + [tuple(map(int, input().split())) for _ in range(N)]
for i in range(N):
t1, x1, y1 = txy[i]
t2, x2, y2 = txy[i+1]
if abs(x2-x1) + abs(y2-y1) <= t2 - t1 and (x1+y1+x2+y2) % 2 == (t2-t1) % 2:
continue
else:
print('No')
exit()
print('Yes') | N = int(eval(input()))
t0 = x0 = y0 = 0
for _ in range(N):
t1, x1, y1 = list(map(int, input().split()))
d = abs(x1 - x0) + abs(y1 - y0)
if d > t1 - t0 or d % 2 != (t1 - t0) % 2:
print('No')
exit()
t0, x0, y0 = t1, x1, y1
print('Yes')
| p03457 |
num = int(eval(input()))
travels = []
for _ in range(num):
travels.append(list(map(int, input().split())))
beforTime = 0
beforX = 0
beforY = 0
resultFrag = True
for travel in travels:
move = abs(beforX - travel[1]) + abs(beforY - travel[2])
canMoveTime = travel[0] - beforTime
if move <= canMoveTime and (move + canMoveTime) % 2 == 0:
beforTime = travel[0]
beforX = travel[1]
beforY = travel[2]
continue
resultFrag = False
break
print(("Yes" if resultFrag else "No")) | num = int(eval(input()))
beforTime = 0
beforX = 0
beforY = 0
resultFrag = True
for travel in range(num):
time, x, y = list(map(int, input().split()))
move = abs(beforX - x) + abs(beforY - y)
canMoveTime = time - beforTime
if move <= canMoveTime and (move + canMoveTime) % 2 == 0:
beforTime = time
beforX = x
beforY = y
continue
resultFrag = False
break
print(("Yes" if resultFrag else "No")) | p03457 |
N = int(eval(input()))
t0, x0, y0 = 0, 0, 0
for _ in range(N):
t, x, y = list(map(int, input().split()))
dt = t - t0
dx = x - x0
dy = y - y0
dxy = abs(dx) + abs(dy) #; print(dt, dx, dy, dxy)
isEvenOdd = (dt%2 == 0 and dxy%2 == 0) or (dt%2 != 0 and dxy%2 != 0)
if isEvenOdd and dxy <= dt :
t0, x0, y0 = t, x, y
else:
print('No')
break
else:
print('Yes') | N = int(eval(input()))
t0, x0, y0 = 0, 0, 0
for _ in range(N):
t, x, y = list(map(int, input().split()))
dt = t - t0
dx = x - x0
dy = y - y0
dxy = abs(dx) + abs(dy) #; print(dt, dx, dy, dxy)
if dt%2 == dxy%2 and dxy <= dt :
t0, x0, y0 = t, x, y
else:
print('No')
break
else:
print('Yes') | p03457 |
import sys
N = int(eval(input()))
t, x, y = [], [], []
p_x, p_y = 0, 0
for i in range(N):
t_t, x_t, y_t = list(map(int, input().split()))
t.append(t_t)
x.append(x_t)
y.append(y_t)
for i in range(N):
if int(t[i]) < int(x[i]) + int(y[i]) or t[i] % 2 != (x[i] + y[i]) % 2:
print("No")
sys.exit()
print("Yes")
| N = int(eval(input()))
t, x, y = 0, 0, 0
for i in range(N):
t_1, x_1, y_1 = list(map(int, input().split()))
distance = abs(x - x_1) + abs(y - y_1)
if distance > t_1 - t or (t_1 - t - distance) % 2 != 0:
print("No")
exit()
print("Yes")
| p03457 |
n=int(eval(input()))
flag=True
ts=0
xs=0
ys=0
for i in range(n):
te,xe,ye=list(map(int,input().split()))
if (te-ts)%2 == ((xe+ye)-(xs+ys))%2 and ((xe+ye)-(xs+ys))<=(te-ts):
flag = True
else:
flag = False
break;
ts,xs,ys=te,xe,ye
if flag:
print('Yes')
else:
print('No') | n=int(eval(input()))
arr=[[0,0,0]]+[list(map(int,input().split())) for _ in range(n)]
for i in range(n):
t1,x1,y1=arr[i]
t2,x2,y2=arr[i+1]
if abs(x1-x2)+abs(y1-y2)>t2-t1:
print('No')
exit()
if (abs(x1-x2)+abs(y1-y2))%2!=(t2-t1)%2:
print('No')
exit()
print('Yes') | p03457 |
n = int(eval(input()))
txy = [[int(0)] * 3]
txy += ([list(map(int, input().split())) for i in range(n)])
for i in range(n):
t_diff = txy[i+1][0] - txy[i][0]
xy_diff = (txy[i+1][1] + txy[i+1][2]) - (txy[i][1] + txy[i][2])
if t_diff % 2 != xy_diff % 2 or xy_diff > t_diff:
print("No")
exit()
print("Yes") | n = int(eval(input()))
for i in range(n):
t, x, y = list(map(int, input().split()))
if (t + x + y) % 2 == 1 or (x + y) > t:
print("No")
exit()
print("Yes") | p03457 |
n = int(eval(input()))
time_space = [(int(x) for x in input().split()) for i in range(n)]
pos = [0,0]
for t, x, y in time_space:
if (x+y) > t or (x+y+t)%2:
print('No')
exit()
print('Yes') | n = int(eval(input()))
for i in range(n):
t, x, y = [int(x) for x in input().split()]
if (x+y) > t or (x+y+t)%2:
print('No')
exit()
print('Yes') | p03457 |
N = int(eval(input()))
for i in range(N):
a,b,c = list(map(int,input().split()))
if abs(b)+abs(c)>a or (a+b+c)%2==1:
print("No")
exit()
print("Yes") | n = int(eval(input()))
for i in range(n):
t,x,y=list(map(int,input().split()))
if (x + y) > t or (x + y + t) % 2:
print("No")
exit()
print("Yes")
| p03457 |
import sys
sys.setrecursionlimit(500000)
import re
import array
import copy
import functools
import operator
import math
import string
import fractions
from fractions import Fraction
import collections
import itertools
import bisect
import random
import time
import heapq
from heapq import heappush
from heapq import heappop
from heapq import heappushpop
from heapq import heapify
from heapq import heapreplace
from queue import PriorityQueue as pq
from queue import Queue
from itertools import accumulate
from collections import deque
from collections import Counter
from operator import mul
from functools import reduce
input = sys.stdin.readline
def eprint(*args, **kwargs):
print(*args, file=sys.stderr, **kwargs)
return
# from fractions import gcd
# from math import gcd
# def lcm(n, m):
# return int(n * m / gcd(n, m))
# def coprimize(p, q):
# common = gcd(p, q)
# return (p // common, q // common)
# def find_gcd(list_l):
# x = reduce(gcd, list_l)
# return x
def combinations_count(n, r):
r = min(r, n - r)
numer = reduce(mul, list(range(n, n - r, -1)), 1)
denom = reduce(mul, list(range(1, r + 1)), 1)
return numer // denom
def judge(s,g):
t=g[0] - s[0]
x=g[1] - s[1]
y=g[2] - s[2]
eprint('x,y,t ',end=':\n')
eprint(x,y,t)
if (abs(x)+abs(y))%2 == t%2 and (abs(x)+abs(y))<=t:
return True
else:
return False
def main():
n = int(input().strip())
txy=[(0,0,0)]
for i in range(n):
tmp1, tmp2, tmp3 = list(map(int,input().strip().split()))
txy.append((tmp1,tmp2,tmp3))
txy.sort()
n+=1
for i in range(0,n-1):
if judge(txy[i], txy[i+1]) != True:
print("No")
return
print("Yes")
if __name__ == '__main__':
main() |
import sys
sys.setrecursionlimit(500000)
input = sys.stdin.readline
def judge(s, g):
t = g[0] - s[0]
x = g[1] - s[1]
y = g[2] - s[2]
if (abs(x)+abs(y)) % 2 == t % 2 and (abs(x)+abs(y)) <= t:
return True
else:
return False
def main():
# inputs
n = int(input().strip())
txy = [(0, 0, 0)]
for i in range(n):
tmp1, tmp2, tmp3 = list(map(int, input().strip().split()))
txy.append((tmp1, tmp2, tmp3))
txy.sort()
n += 1
# procedure and output
for i in range(0, n-1):
if judge(txy[i], txy[i+1]) != True:
print("No")
return
print("Yes")
if __name__ == '__main__':
main()
| p03457 |
n = int(eval(input()))
t_ = 0
x_ = 0
y_ = 0
for i in range(n):
t, x, y = list(map(int, input().split()))
if abs(x-x_)+abs(y-y_) > t-t_:
print('No')
exit()
else:
r = (t-t_) - abs(x-x_)-abs(y-y_)
if r%2 == 0:
t_ = t
x_ = x
y_ = y
else:
print('No')
exit()
else:
print('Yes') | n = int(eval(input()))
t_ = 0
x_ = 0
y_ = 0
for i in range(n):
t, x, y = list(map(int, input().split()))
d = (t-t_)-abs(x-x_)-abs(y-y_)
if d < 0 or d%2 != 0:
print('No')
exit()
else:
t_ = t
x_ = x
y_ = y
else:
print('Yes')
| p03457 |
n = int(eval(input()))
t_ = 0
x_ = 0
y_ = 0
for i in range(n):
t, x, y = list(map(int, input().split()))
d = (t-t_)-abs(x-x_)-abs(y-y_)
if d < 0 or d%2 != 0:
print('No')
exit()
else:
t_ = t
x_ = x
y_ = y
else:
print('Yes')
| n = int(eval(input()))
TXY = []
tc, xc, yc = 0, 0, 0
for i in range(n):
t, x, y = list(map(int, input().split()))
d = abs(x-xc)+abs(y-yc)
if d > t-tc or (t-tc-d)%2 == 1:
print('No')
exit()
else:
tc, xc, yc = t, x, y
else:
print('Yes')
| p03457 |
n = int(eval(input()))
TXY = []
tc, xc, yc = 0, 0, 0
for i in range(n):
t, x, y = list(map(int, input().split()))
d = abs(x-xc)+abs(y-yc)
if d > t-tc or (t-tc-d)%2 == 1:
print('No')
exit()
else:
tc, xc, yc = t, x, y
else:
print('Yes')
| n = int(eval(input()))
tc = 0
xc, yc = 0, 0
for i in range(n):
t, x, y = list(map(int, input().split()))
d = abs(x-xc)+abs(y-yc)
if d > t-tc:
print('No')
exit()
else:
if (t-tc-d)%2 != 0:
print('No')
exit()
xc, yc, tc = x, y, t
else:
print('Yes')
| p03457 |
N = int(eval(input()))
count = 0
T, X, Y = 0, 0, 0
for i in range(N):
t, x, y = list(map(int, input().split()))
if abs(x-X)+abs(y-Y) <= t-T and t % 2 == (x+y) % 2:
count += 1
T, X, Y = t, x, y
print(("Yes" if count == N else "No")) | # C - Traveling
# https://atcoder.jp/contests/abc086/tasks/arc089_a
# dt = ti+1 −ti
# dist = abs(xi+1 − xi)+abs(yi+1 − yi)
# キーポイント: パリティ
# x + y は毎秒ごとに必ず偶奇が入れ替わる。
n = int(eval(input()))
T = 0
X = 0
Y = 0
cnt = 0
for i in range(n):
t,x,y= list(map(int,input().split()))
if abs(x-X) + abs(y-Y) <= (t-T) and (x+y)%2 == t%2:
cnt += 1
T,X,Y = t,x,y
print(("Yes" if cnt == n else "No"))
| p03457 |
N = int(eval(input()))
In = [list(map(int, input().split())) for _ in range(N)]
s = (0, 0)
t = 0
success = True
for move in In:
before_x, before_y = s
tn, after_x, after_y = move
dist_xy = abs(after_x - before_x) + abs(after_y - before_y)
walk = tn - t
if walk < dist_xy:
success *= False
if walk % 2 == 0 and dist_xy % 2 != 0:
success *= False
elif walk % 2 != 0 and dist_xy % 2 == 0:
success *= False
s = (after_x, after_y)
t = tn
print(("Yes" if success else "No")) | N = int(eval(input()))
In = [list(map(int, input().split())) for _ in range(N)]
s = (0, 0)
t = 0
success = True
for move in In:
before_x, before_y = s
tn, after_x, after_y = move
dist_xy = abs(after_x - before_x) + abs(after_y - before_y)
walk = tn - t
if walk < dist_xy:
success *= False
break
if walk % 2 == 0 and dist_xy % 2 != 0:
success *= False
break
elif walk % 2 != 0 and dist_xy % 2 == 0:
success *= False
break
s = (after_x, after_y)
t = tn
print(("Yes" if success else "No")) | p03457 |
N = int(eval(input()))
previous_p = [{'t': 0, 'x': 0, 'y': 0}]
next_p = [{'t': t, 'x': x, 'y': y} for _ in range(N) for t, x, y in [list(map(int, input().split()))]]
previous_p += next_p
answer = 'Yes'
for p_p, n_p in zip(previous_p, next_p):
time = n_p['t'] - p_p['t']
distance = abs(n_p['x'] - p_p['x']) + abs(n_p['y'] - p_p['y'])
if time < distance or time % 2 != distance % 2:
answer = 'No'
break
print(answer) | N = int(eval(input()))
p_t = 0
p_x = 0
p_y = 0
answer = 'Yes'
for _ in range(N):
n_t, n_x, n_y = list(map(int, input().split()))
time = n_t - p_t
distance = abs(n_x - p_x) + abs(n_y - p_y)
if time < distance or time % 2 != distance % 2:
answer = 'No'
break
p_t = n_t
p_x = n_x
p_y = n_y
print(answer) | p03457 |
n=int(eval(input()))
li=[list(map(int,input().split())) for i in range(n)]
li.insert(0,[0,0,0])
#print(li)
for i in range(n) :
cr=li[i]
nx=li[i+1]
dist=abs(nx[1]-cr[1])+abs(nx[2]-cr[2])
dt=nx[0]-cr[0]
if dt<dist :
print("No")
exit()
if (dt%2) != (dist%2) :
print("No")
exit()
print("Yes") | n=int(eval(input()))
#a,b=map(int,input().split())
#l=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]
t_bef=0
x_bef=0
y_bef=0
flag='Yes'
for i in range(1,n+1):
t,x,y=list(map(int,input().split()))
dt=t-t_bef
dist=abs(x-x_bef)+abs(y-y_bef)
if (dt%2 != dist%2) or dist>dt:
flag='No'
#break
t_bef,x_bef,y_bef=t,x,y
print(flag) | p03457 |
n=int(eval(input()))
#a,b=map(int,input().split())
#l=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]
t_bef=0
x_bef=0
y_bef=0
flag='Yes'
for i in range(1,n+1):
t,x,y=list(map(int,input().split()))
dt=t-t_bef
dist=abs(x-x_bef)+abs(y-y_bef)
if (dt%2 != dist%2) or dist>dt:
flag='No'
#break
t_bef,x_bef,y_bef=t,x,y
print(flag) | n=int(eval(input()))
#a,b=map(int,input().split())
#l=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]
t_bef=0
x_bef=0
y_bef=0
flag='Yes'
for i in range(1,n+1):
t,x,y=list(map(int,input().split()))
dt=t-t_bef
dist=abs(x-x_bef)+abs(y-y_bef)
if (dt%2 != dist%2) or dist>dt:
flag='No'
break
t_bef,x_bef,y_bef=t,x,y
print(flag) | p03457 |
N=int(eval(input()))
x=[0]
y=[0]
t=[0]
flag=1
for i in range(1,N+1):
t_tmp,x_tmp,y_tmp=list(map(int,input().split()))
t.append(t_tmp)
x.append(x_tmp)
y.append(y_tmp)
time=abs(t[i-1]-t[i])
d=abs(x[i-1]-x[i])+abs(y[i-1]-y[i])
if d>time or (d%2)!=(time%2):
print("No")
flag=0
break
if flag==1:
print("Yes") | N = int(eval(input()))
pre_t = 0
pre_x = 0
pre_y = 0
for i in range(N):
now_t,now_x,now_y = list(map(int,input().split()))
d = abs(now_x - pre_x) + abs(now_y - pre_y)
t = now_t - pre_t
if d <= t and t % 2 == d % 2:
flg = 1
else:
flg = 0
break
if flg == 1:
print('Yes')
else:
print('No') | p03457 |
# -*- coding: utf-8 -*-
# AtCoder Beginner Contest
# Problem C
class TravelingPlan(object):
def __init__(self):
from collections import OrderedDict
self._points = OrderedDict()
def add_point(self, name: str):
if name not in self._points:
self._points[name] = Point()
return self._points[name]
def is_executable(self):
for j in range(len(self._points) - 1):
current_point = self._points[str(j + 1)]
previous_point = self._points[str(j)]
result = self._can_move(previous_point, current_point)
if result is False:
return False
return True
def _can_move(self, previous_point, current_point):
delta_x = current_point.x - previous_point.x
delta_y = current_point.y - previous_point.y
delta_x_y = delta_x + delta_y
delta_t = current_point.t - previous_point.t
if delta_x_y == delta_t:
return True
elif delta_x_y < delta_t:
return self._is_reachable(delta_x_y, delta_t)
elif delta_x_y > delta_t:
return False
def _is_reachable(self, delta_x_y, delta_t):
for i in range(delta_t + 1):
if (1 * i + (-1) * (delta_t - i)) == delta_x_y:
return True
return False
class Point(object):
def __init__(self):
self._x = 0
self._y = 0
self._t = 0
@property
def x(self):
return self._x
@x.setter
def x(self, value):
self._x = value
@property
def y(self):
return self._y
@y.setter
def y(self, value):
self._y = value
@property
def t(self):
return self._t
@t.setter
def t(self, value):
self._t = value
if __name__ == '__main__':
point_count = int(eval(input()))
points = [list(map(int, input().split(" "))) for _ in range(point_count)]
plan = TravelingPlan()
origin = plan.add_point(str(0))
for i in range(0, len(points)):
point = plan.add_point(str(i + 1))
point.t = points[i][0]
point.x = points[i][1]
point.y = points[i][2]
if plan.is_executable() is True:
print("Yes")
else:
print("No")
| # -*- coding: utf-8 -*-
def main():
n = int(eval(input()))
ts, xs, ys = [0], [0], [0]
for i in range(n):
ti, xi, yi = list(map(int, input().split()))
ts.append(ti)
xs.append(xi)
ys.append(yi)
for j in range(n):
dt = ts[j + 1] - ts[j]
dxy = (xs[j + 1] - xs[j]) + (ys[j + 1] - ys[j])
if (-dt <= dxy <= dt) and (dt % 2 == dxy % 2):
pass
else:
print('No')
exit()
print('Yes')
if __name__ == '__main__':
main()
| p03457 |
n=int(eval(input()))
t=[0]*(n+1)
x=[0]*(n+1)
y=[0]*(n+1)
for i in range(n):
t[i+1],x[i+1],y[i+1] = list(map(int,input().split()))
flag=True
for i in range(n):
time=t[i+1]-t[i]
dist=abs(x[i+1]-x[i])+abs(y[i+1]-y[i])
if dist>time:
flag=False
if dist%2 != time%2:
flag=False
if flag == True:
print('Yes')
else:
print('No') | n=int(eval(input()))
t=[0]*(n+1)
x=[0]*(n+1)
y=[0]*(n+1)
for i in range(1,n+1):
t[i],x[i],y[i]=list(map(int,input().split()))
time=0
dist=0
for i in range(n):
dist=abs(x[i+1]-x[i])+abs(y[i+1]-y[i])
time=t[i+1]-t[i]
if time>=dist and time%2 == dist%2:
continue
else:
print('No')
exit()
print('Yes') | p03457 |
N = int(eval(input()))
t = [list(map(int, input().split())) for i in range(N)]
if N == 1:
if t[0][0] >= t[0][1] + t[0][2]:
print("Yes")
else:
print("No")
else:
for i in range(1,N):
a = t[i][0] - t[i-1][0]
b = abs(t[i][1] - t[i-1][1]) + abs(t[i][2] - t[i-1][2])
if a >= b and a % 2 == b % 2:
continue
else:
print("No")
exit()
print("Yes") | N = int(eval(input()))
pt, px, py = 0, 0, 0
for i in range(N):
t, x, y = list(map(int, input().split()))
a = abs(x - px) + abs(y - py)
b = t - pt
if b < a or (a - b) % 2 != 0:
print("No")
exit()
pt, px, py = t, x, y
print("Yes") | p03457 |
n = int(eval(input()))
t, x, y = 0, 0, 0
ans = "Yes"
for i in range(1, n+1):
ti, xi, yi = list(map(int, input().split()))
displacements = (xi - x) + (yi - y)
dist = abs(displacements)
dt = ti - t
if dt >= dist and (dt - dist) % 2 == 0:
t, x, y = ti, xi, yi
else:
ans = "No"
if ans == "No":
break
print(ans) | n = int(eval(input()))
t, x, y = 0, 0, 0
ans = "Yes"
for i in range(1, n+1):
ti, xi, yi = list(map(int, input().split()))
displacements = (xi - x) + (yi - y)
dist = abs(displacements)
dt = ti - t
if dt >= dist and (dt - dist) % 2 == 0:
t, x, y = ti, xi, yi
else:
ans = "No"
break
print(ans) | p03457 |
n = int(eval(input()))
t, x, y = 0, 0, 0
ans = "Yes"
for i in range(1, n+1):
ti, xi, yi = list(map(int, input().split()))
displacements = (xi - x) + (yi - y)
dist = abs(displacements)
dt = ti - t
if dt >= dist and (dt - dist) % 2 == 0:
t, x, y = ti, xi, yi
else:
ans = "No"
print(ans) | # author: kagemeka
# created: 2019-11-06 12:47:30(JST)
import sys
# import collections
# import math
# import string
# import bisect
# import re
# import itertools
# import statistics
def main():
n, *txy = (int(x) for x in sys.stdin.read().split())
t, x, y = [0], [0], [0]
for i in range(0, n * 3, 3):
t.append(txy[i])
x.append(txy[i+1])
y.append(txy[i+2])
for i in range(n):
dt = t[i+1] - t[i]
distx = abs(x[i+1] - x[i])
disty = abs(y[i+1] - y[i])
if dt - (distx + disty) >= 0 and (dt - (distx + disty)) % 2 == 0:
continue
else:
ans = 'No'
break
else:
ans = 'Yes'
print(ans)
if __name__ == "__main__":
# execute only if run as a script
main()
| p03457 |
T = 0
X = 1
Y = 2
item = eval(input())
tabiji = [[0,0,0]]
for i in range(1, int(item)+1):
tabiji.append(input().split(' '))
a = 'Yes'
for i in range(0, len(tabiji)-1):
time = int(tabiji[i+1][T]) - int(tabiji[i][T])
dX = int(tabiji[i+1][X]) - int(tabiji[i][X])
dY = int(tabiji[i+1][Y]) - int(tabiji[i][Y])
for j in range(time):
if dX > 0:
dX -= 1
elif dX < 0:
dX += 1
elif dY > 0:
dY -= 1
elif dY < 0:
dY += 1
if dX == 0 and dY == 0 and (time - j+1) % 2 == 1:
a = 'No'
break
elif dX == 0 and dY == 0 and (time - j+1) % 2 == 0:
break
if dX != 0 or dY != 0:
a = 'No'
print(a) | T = 0
X = 1
Y = 2
item = eval(input())
tabiji = [[0,0,0]]
for i in range(1, int(item)+1):
tabiji.append(input().split(' '))
a = 'Yes'
for i in range(0, len(tabiji)-1):
time = int(tabiji[i+1][T]) - int(tabiji[i][T])
dX = abs(int(tabiji[i+1][X]) - int(tabiji[i][X]))
dY = abs(int(tabiji[i+1][Y]) - int(tabiji[i][Y]))
dtime = time - dX - dY
if dtime < 0 or dtime % 2 == 1:
a = 'No'
print(a) | p03457 |
n = int(eval(input()))
pret = 0
prex = 0
prey = 0
flag = True
for i in range(n):
t,x,y = list(map(int,input().split()))
if flag:
tmp = t - pret - abs(x - prex) - abs(y - prey)
#print(t, x, y, tmp)
if tmp >= 0 and tmp % 2 == 0:
pret = t
prex = x
prey = y
else:
flag = False
if flag:
print('Yes')
else:
print('No')
| import sys
n = int(eval(input()))
pret = 0
prex = 0
prey = 0
for i in range(n):
t,x,y = list(map(int,input().split()))
tmp = t - pret - abs(x - prex) - abs(y - prey)
#print(t, x, y, tmp)
if tmp >= 0 and tmp % 2 == 0:
pret = t
prex = x
prey = y
else:
print('No')
sys.exit()
print('Yes') | p03457 |
#! env python
# -*- coding: utf-8 -*-
import os
import sys
# at_coder.ABC086C_Traveling
# Date: 2019/06/02
# Filename: ABC086C_Traveling
__author__ = 'acto_mini'
__date__ = "2019/06/02"
def main():
# 作業ディレクトリを自身のファイルのディレクトリに変更
os.chdir(os.path.dirname(os.path.abspath(sys.argv[0])))
t, x, y = [0], [0], [0]
# 整数の入力
num = int(eval(input()))
for i in range(num):
a, b, c = list(map(int, input().split()))
t.append(a)
x.append(b)
y.append(c)
can = True
for i in range(num):
dt = t[i + 1] - t[i]
dist = abs(x[i + 1] - x[i]) + abs(y[i + 1] - y[i])
if (dt < dist):
can = False
if (dt % 2 != dist % 2):
can = False
if can:
print("Yes")
else:
print("No")
return
if __name__ == '__main__':
main()
| #! env python
# -*- coding: utf-8 -*-
import os
import sys
# ac_py.main.py
# Date: 2020/06/08
# Filename: main.py
__author__ = 'acto_mini'
__date__ = "2020/06/08"
def main():
n = int(eval(input()))
t_prev = 0
x_prev = 0
y_prev = 0
for i in range(n):
t, x, y = list(map(int, input().split()))
dt = t - t_prev
dist = abs(x - x_prev) + abs(y - y_prev)
if dt < dist or ((dt % 2) != (dist % 2)):
print("No")
exit()
t_prev, x_prev, y_prev = t, x, y
print("Yes")
return
if __name__ == '__main__':
main()
| p03457 |
import copy
N = int(eval(input()))
txy = {}
for i in range(N):
t, x, y = list(map(int, input().split(' ')))
txy[t] = [x, y]
src_t = 0
src_x = 0
src_y = 0
success = True
for t, xy in list(txy.items()):
dest_t = t
dest_x = xy[0]
dest_y = xy[1]
before = [[src_x, src_y]]
after = []
for i in range(src_t, dest_t):
after.clear()
for before_x, before_y in before:
after.append([before_x + 1, before_y])
after.append([before_x - 1, before_y])
after.append([before_x, before_y + 1])
after.append([before_x, before_y - 1])
before = copy.deepcopy(after)
if [dest_x, dest_y] in after:
src_t = dest_t
src_x = dest_x
src_y = dest_y
continue
else:
success = False
break
if success:
print('Yes')
else:
print('No')
| n = int(eval(input()))
src_t = 0
src_x = 0
src_y = 0
success = True
for i in range(n):
t, x, y = list(map(int, input().split(' ')))
if success == True:
dt = t - src_t
dist = abs(x - src_x) + abs(y - src_y)
if dist <= dt and dist % 2 == dt % 2:
src_t = t
src_x = x
src_y = y
continue
else:
success = False
if success:
print('Yes')
else:
print('No')
| p03457 |
n = int(eval(input()))
prev_dst = 0
prev_time = 0
for _ in range(n):
t, x, y = list(map(int, input().split()))
if t % 2 == 0 and (x + y) % 2 != 0:
print('No')
exit()
if t % 2 == 1 and (x + y) % 2 != 1:
print('No')
exit()
if (t - prev_time) < abs(x + y - prev_dst):
print('No')
exit()
prev_time = t
prev_dst = x + y
print('Yes') | n = int(eval(input()))
prev_dst = 0
prev_time = 0
for _ in range(n):
t, x, y = list(map(int, input().split()))
total = x + y
if t % 2 != total % 2 or (t - prev_time) < abs(total - prev_dst):
print('No')
exit()
prev_time = t
prev_dst = total
print('Yes') | p03457 |
N = int(eval(input()))
T = [0]*100000
X= [0]*100000
Y= [0]*100000
x = 0
y = 0
for n in range(N):
T[n],X[n],Y[n] = (list(map(int, input().split())))
flag = 1
for n in range(N):
#print(n)
if flag == 0:
continue
if n == 0:
count = T[n]
else:
count = T[n] - T[n-1]
x = X[n-1]
y = Y[n-1]
c = 0
end = 0
while True:
if end == 1:
break
s_x = X[n] - x
s_y = Y[n] - y
# print(str(s_x)+' '+str(s_y))
if ((s_x != 0 or s_y !=0) )and (c!=count):
if s_x >0:
x +=1
c += 1
elif s_x < 0:
x -= 1
c+=1
elif s_y > 0:
y +=1
c += 1
elif s_y < 0:
y -= 1
c+=1
elif ((s_x == 0 and s_y == 0) )and (c!=count):
x +=1
c +=1
elif c==count:
if (x == X[n] and y ==Y[n]):
flag = 1
end=1
else:
flag=0
end =1
if flag == 1:
print('Yes')
else:
print('No')
| N = int(eval(input()))
t = [0]*110000
x= [0]*110000
y= [0]*110000
for n in range(N):
t[n+1],x[n+1],y[n+1] = (list(map(int, input().split())))
can = True
for i in range(N):
dt = t[i+1] - t[i]
dist = abs(x[i+1] - x[i]) + abs(y[i+1] - y[i])
if dt < dist: #dt が大きければたどり着ける
can = False
if (dist % 2 != dt % 2):#動いていなければ偶数奇数がずれる
can = False
if can == True:
print('Yes')
else:
print('No')
| p03457 |
N = int(eval(input()))
txy = [[0, 0, 0]] + [list(map(int, input().split())) for _ in range(N)]
flag = True
for i in range(N):
nt = txy[i+1][0]
nx = txy[i+1][1]
ny = txy[i+1][2]
t = txy[i][0]
x = txy[i][1]
y = txy[i][2]
move = nt - t
tmp = abs(nx-x)+abs(ny-y)
if move >= tmp:
if abs(move-tmp) % 2 != 0:
flag = False
break
else:
flag = False
break
print(('Yes' if flag else 'No'))
| N = int(eval(input()))
txy = [[0, 0, 0]] + [list(map(int, input().split())) for _ in range(N)]
flag = True
for i in range(N):
nt = txy[i+1][0]
nx = txy[i+1][1]
ny = txy[i+1][2]
t = txy[i][0]
x = txy[i][1]
y = txy[i][2]
move = nt - t
tmp = abs(nx-x)+abs(ny-y)
if move >= tmp:
if abs(move-tmp) % 2 != 0:
print('No')
exit()
else:
print('No')
exit()
print('Yes')
| p03457 |
N=eval(input())
a=[]
t=True
for _ in range(int(N)):
a+=[list(map(int,input().split()))]
for i in range(int(N)):
if a[i][0]%2==0:
if abs(a[i][1]+a[i][2])<=a[i][0] and (a[i][1]+a[i][2])%2==0:
continue
else:
print('No')
t=False
break
else:
if abs(a[i][1]+a[i][2]<=a[i][0]) and (a[i][1]+a[i][2])%2==1:
continue
else:
print('No')
t=False
break
if t:
print('Yes') | import sys
n=int(eval(input()))
t=[]
for i in range(n):
t.append(list(map(int,input().split())))
for i,d in enumerate(t):
if i>0:
b=d[0]-a
c=abs(d[1]+d[2]-aa)
a=d[0]
aa=d[1]+d[2]
if i==0:
if not (a >= aa and a % 2 == aa % 2):
print('No')
sys.exit()
else:
continue
if not (b>=c and b%2==c%2):
print('No')
sys.exit()
print('Yes') | p03457 |
def travel(x,y,t):
for i in range(t):
if x+y==t-2*i:
return True
return False
n=int(eval(input()))
for i in range(n):
t, x, y = [int(j) for j in input().split() ]
if not travel(x,y,t):
print("No")
exit()
print("Yes")
| n=int(eval(input()))
txy=[[0, 0, 0]]+[list(map(int, input().split())) for i in range(n)]
def C(txy0, txy1):
xx=txy1[1]-txy0[1]
yy=txy1[2]-txy0[2]
tt=txy1[0]-txy0[0]
if xx+yy<=tt and (xx+yy-tt)%2==0:
return True
return False
if all(C(txy[i], txy[i+1]) for i in range(n)):
print('Yes')
else:
print('No') | p03457 |
def main():
import sys
input = sys.stdin.buffer.readline
N = int(input())
TXY = [[int(i) for i in input().split()] for j in range(N)]
time, px, py = 0, 0, 0
for t, x, y in TXY:
move = abs(x-px) + abs(y-py)
# print(move, t-time)
if (t - time) % 2 != move % 2 or t - time < move:
return print("No")
time, px, py = t, x, y
print("Yes")
if __name__ == '__main__':
main()
| def main():
import sys
input = sys.stdin.buffer.readline
N = int(input())
TXY = [[int(i) for i in input().split()] for j in range(N)]
time = 0
px = 0
py = 0
for t, x, y in TXY:
move = abs(py-y) + abs(px - x)
if (t-time) < move or (t - time) % 2 != move % 2:
return print("No")
time = t
px = x
py = y
print("Yes")
if __name__ == '__main__':
main()
| p03457 |
import sys
n = int(input())
data = [list(map(int, input().split())) for i in range(n)]
t = 0
x = 0
y = 0
for d in data:
duration = d[0] - t
distance = abs(x - d[1]) + abs(y - d[2])
if (distance > duration) or ((duration - distance) % 2 == 1):
print('No')
sys.exit()
t = d[0]
x = d[1]
y = d[2]
print('Yes') | import sys
def main():
_int = int
_abs = abs
n = int(eval(input()))
data = [[_int(e) for e in input().split()] for _ in range(n)]
t, x, y = 0, 0, 0
for d in data:
rt = d[0] - t - _abs(x - d[1]) - _abs(y - d[2])
if rt < 0 or rt & 1 == 1:
print('No')
sys.exit()
t, x, y = d
print('Yes')
main()
| p03457 |
import sys
def main():
_int = int
n = int(eval(input()))
data = [[_int(e) for e in input().split()] for _ in range(n)]
t, x, y = 0, 0, 0
for d in data:
rt = d[0] - t - abs(x - d[1]) - abs(y - d[2])
if rt < 0 or rt & 1 == 1:
print('No')
sys.exit()
t, x, y = d
print('Yes')
main()
| from sys import exit
n = int(eval(input()))
data = [list(map(int, input().split())) for _ in range(n)]
t = 0
x = 0
y = 0
for d in data:
duration = d[0] - t
distance = abs(x - d[1]) + abs(y - d[2])
if (distance > duration) or ((duration - distance) % 2 == 1):
print('No')
exit()
t = d[0]
x = d[1]
y = d[2]
print('Yes')
| p03457 |
n = int(eval(input()))
bt, bx, by = 0, 0, 0
ans = 'Yes'
for i in range(n):
t, x, y = list(map(int, input().split()))
if ((t % 2 == 0 and (x + y) % 2 == 0) or (t % 2 == 1 and (x + y) % 2 == 1)) and (abs(x - bx) + abs(y - by) <= t - bt):
bt, bx, by = t, x, y
continue
else:
ans = 'No'
break
print(ans)
| n = int(eval(input()))
ans = "Yes"
for _ in range(n):
t, x, y = list(map(int, input().split()))
if (t < x + y) or (t + x + y) % 2 == 1:
ans = "No"
print(ans)
| p03457 |
N = int(eval(input()))
tt = 0
xx = 0
yy = 0
flag = True
z = [list(map(int, input().split())) for _ in range(N)]
for i in range(N):
t, x, y = z[i]
s = [[xx, yy]]
for j in range(t - tt):
ss = []
for k in range(len(s)):
ss.append([s[k][0] + 1, s[k][1]])
ss.append([s[k][0] - 1, s[k][1]])
ss.append([s[k][0], s[k][1] + 1])
ss.append([s[k][0], s[k][1] - 1])
s = ss
if [x, y] in s:
tt = t
xx = x
yy = y
else:
print('No')
exit()
print('Yes') | N = int(eval(input()))
tt = 0
xx = 0
yy = 0
z = [list(map(int, input().split())) for _ in range(N)]
for i in range(N):
t, x, y = z[i]
dt = t - tt
dx = abs(x - xx)
dy = abs(y - yy)
if dt < dx + dy or (dt - (dx + dy)) % 2:
print('No')
exit()
tt = t
xx = x
yy = y
print('Yes') | p03457 |
n=int(eval(input()))
l=[list(map(int,input().split())) for i in range(n)]
t=0
x=0
y=0
flag=True
for i in range(n):
tt=l[i][0]-t
d=abs(l[i][1]-x)+abs(l[i][2]-y)
if tt<d or tt%2!=d%2:
flag=False
t=l[i][0]
x=l[i][1]
y=l[i][2]
if flag:
print("Yes")
else:
print("No")
| n=int(eval(input()))
X=0
Y=0
T=0
f=1
for _ in range(n):
t,x,y=list(map(int,input().split()))
dx=abs(x-X)
dy=abs(y-Y)
dt=t-T
if dt>=dx+dy and dt%2==(dx+dy)%2:
pass
else:
f=0
print(("Yes" if f else "No"))
| p03457 |
#!/bin/env python3
N = int(eval(input()))
t_prev = x_prev = y_prev = 0
for i in range(N):
t_i, x_i, y_i = list(map(int, input().split()))
if (x_i+y_i)> t_i:
print("No")
exit()
elif (x_i+y_i) %2 != t_i%2 :
print("No")
exit()
elif (abs(x_i - x_prev) + abs(y_i - y_prev)) > (t_i - t_prev):
print("No")
exit()
print("Yes")
| #!/bin/env python3
N = int(eval(input()))
#t_prev = x_prev = y_prev = 0
for i in range(N):
t_i, x_i, y_i = list(map(int, input().split()))
if (x_i+y_i)> t_i:
print("No")
exit()
elif (x_i+y_i) %2 != t_i%2 :
print("No")
exit()
#elif (abs(x_i - x_prev) + abs(y_i - y_prev)) > (t_i - t_prev):
# print("No")
# exit()
print("Yes")
| p03457 |
n = int(eval(input()))
t = [0]
x = [0]
y = [0]
for i in range(n):
t_tmp, x_tmp, y_tmp = list(map(int, input().split()))
t.append(t_tmp)
x.append(x_tmp)
y.append(y_tmp)
r_init = [0, 0]
parity = 0 # 偶数
for i in range(1, n+1):
dt = t[i] - t[i-1]
dx = abs(x[i] - x[i-1])
dy = abs(y[i] - y[i-1])
dist = dx + dy
if dist > dt:
print('No')
exit()
if dt % 2 != dist % 2:
print('No')
exit()
print('Yes') | n = int(eval(input()))
prev_t = 0
prev_x = 0
prev_y = 0
for i in range(n):
t, x, y = list(map(int, input().split()))
dt = t - prev_t
dx = abs(x - prev_x)
dy = abs(y - prev_y)
dist = dx + dy
if dist > dt:
print('No')
exit()
if dt % 2 != dist % 2:
print('No')
exit()
print('Yes') | p03457 |
N = int(eval(input()))
txy = [[0, 0, 0]] + [list(map(int, input().split())) for _ in range(N)]
result = True
for i in range(N):
dt = txy[i + 1][0] - txy[i][0]
dist = abs(txy[i + 1][1] - txy[i][1]) + abs(txy[i + 1][2] - txy[i][2])
if(dist > dt): result = False
if(dist % 2 != dt % 2): result = False
print((("No", "Yes")[result])) | N = int(eval(input()))
txy = [list(map(int, input().split())) for _ in range(N)]
result = True
for pol in txy:
dist = abs(pol[1]) + abs(pol[2])
if(dist > pol[0]): result = False
if(dist % 2 != pol[0] % 2): result = False
print((("No", "Yes")[result])) | p03457 |
def solve(T_X_Y):
curr_t = 0
curr_x = 0
curr_y = 0
for t_x_y in T_X_Y:
t = t_x_y[0]
x = t_x_y[1]
y = t_x_y[2]
if not travelable(curr_t, curr_x, curr_y, t, x, y):
return "No"
return "Yes"
def travelable(curr_t, curr_x, curr_y, t, x, y):
dist_x = abs(x - curr_x)
dist_y = abs(y - curr_y)
min_step = dist_x + dist_y
if t - curr_t < min_step:
return False
return (t - curr_t - min_step) % 2 == 0
N = int(eval(input()))
T_X_Y = [list(map(int, input().split())) for _ in range(N)]
print((solve(T_X_Y))) | # 0位置からの計算でも途中位置からの計算でも計算コストは同じ
def travelable(t, x, y):
min_step = x + y
if t < min_step:
return False
return (t - min_step) % 2 == 0
ans = None
N = int(eval(input()))
for _ in range(N):
t_x_y = list(map(int, input().split()))
if not travelable(t_x_y[0], t_x_y[1], t_x_y[2]):
ans = "No"
break
if ans is None:
ans = "Yes"
print(ans)
| p03457 |
n = int(eval(input()))
cnt = 0
t,x,y = 0,0,0
for i in range(n):
nt, nx, ny = list(map(int, input().split()))
if abs(nx-x)+abs(ny-y) <= nt-t and t%2 == (x+y)%2:
cnt += 1
t,x,y = nt,nx,ny
print(("Yes" if cnt == n else "No")) | n = int(eval(input()))
t,x,y = 0,0,0
for i in range(n):
nt, nx, ny = list(map(int, input().split()))
if not(abs(nx-x)+abs(ny-y) <= nt-t and t%2 == (x+y)%2):
print("No")
exit()
t,x,y = nt,nx,ny
print("Yes")
| p03457 |
N = int(eval(input()))
ans = "Yes"
i = 0
while i < N:
t,x,y = [int(num) for num in input().split()]
if x+y <= t and (t-x-y)%2 == 0:
i += 1
else:
ans = "No"
break
print(ans) | n = int(eval(input()))
for i in range(n):
t,x,y = list(map(int,input().split()))
if (x+y) > t or (x+y+t) % 2:
print("No")
quit()
print("Yes") | p03457 |
if __name__ == "__main__":
n = int(eval(input()))
plan = list()
for i in range(n):
plan.append(list(map(int, input().split())))
pos = [0, 0]
time = 0
for i in range(n):
delta_t = plan[i][0] - time
delta_x = plan[i][1] - pos[0]
delta_y = plan[i][2] - pos[1]
if delta_t < delta_x + delta_y:
print('No')
exit()
elif (delta_t - delta_x - delta_y) % 2 == 1:
print('No')
exit()
pos[0] = plan[i][1]
pos[1] = plan[i][2]
time = plan[i][0]
print('Yes')
| if __name__ == "__main__":
n = int(eval(input()))
pos = [0, 0]
time = 0
flag = False
for i in range(n):
tmp = list(map(int, input().split()))
time = tmp[0] - time
dist = tmp[1] - pos[0] + tmp[2] - pos[1]
if time < dist or (dist - time) % 2 == 1:
flag = True
pos = [tmp[1], tmp[2]]
time = tmp[0]
if flag:
print('No')
else:
print('Yes')
| p03457 |
def main():
N = int(input().strip())
stx = sty = stt = 0
for i in range(N):
t, x, y = [int(x) for x in input().strip().split()]
mvt = abs(stt - t)
mvx = abs(stx - x)
mvy = abs(sty - y)
mvxy = mvx + mvy
if mvt < (mvx + mvy):
return "No"
if (mvt % 2) != (mvxy % 2):
return "No"
stx = x
sty = y
stt = t
return "Yes"
if __name__ == '__main__':
print((main())) | def main():
N = int(input().strip())
stx = sty = stt = 0
for i in range(N):
t, x, y = [int(x) for x in input().strip().split()]
mvt = abs(stt - t)
mvx = abs(stx - x)
mvy = abs(sty - y)
mvxy = mvx + mvy
if mvt < mvxy:
return "No"
if mvt % 2 != mvxy % 2:
return "No"
# 次のスタート地点
stx = x
sty = y
stt = t
return "Yes"
if __name__ == '__main__':
print((main())) | p03457 |
n = int(eval(input()))
x = [0]
y = [0]
t = [0]
fl = True
def judge(a,b,c,d,e,f):
if abs(b-a)+abs(d-c) <= f-e and abs(b+d-a-c)%2 == abs(f-e)%2:
return False
return True
for i in range(n):
tt,xx,yy = list(map(int,input().split()))
x.append(xx)
y.append(yy)
t.append(tt)
if judge(x[i],x[i+1],y[i],y[i+1],t[i],t[i+1]):
fl = False
if(fl):
print("Yes")
else:
print("No")
| n = int(eval(input()))
x = 0
y = 0
t = 0
a = 0
def trav(a,b,c,d,e,f):
if abs(a-b) + abs(c-d) <= e - f and ((a-b) % 2 + (c-d) % 2)%2 == (e-f) % 2:
return 0
else:
return 1
for i in range(n):
tn,xn,yn = list(map(int,input().split()))
if trav(xn,x,yn,y,tn,t) == 0:
x = xn
y = yn
t = tn
else:
a = 1
if a == 0:
print("Yes")
else:
print("No")
| p03457 |
import sys
read = sys.stdin.buffer.read
input = sys.stdin.buffer.readline
inputs = sys.stdin.buffer.readlines
# rstrip().decode('utf-8')
# map(int,input().split())
# import numpy as np
def main():
n=int(eval(input()))
li=[[0,0,0]]+[list(map(int,input().split())) for _ in range(n)]
ans="Yes"
li2=[]
for i in range(n):
li2.append([li[i+1][0]-li[i][0],abs(li[i+1][1]-li[i][1])+abs(li[i+1][2]-li[i][2])])
for t,k in li2:
if t%2!=k%2 or t<k:
ans="No"
print(ans)
if __name__ == "__main__":
main()
| import sys
#input = sys.stdin.readline
input = sys.stdin.buffer.readline
# mod=10**9+7
# rstrip().decode('utf-8')
# map(int,input().split())
# import numpy as np
def main():
n=int(eval(input()))
li=[[0,0,0]]+[list(map(int,input().split())) for _ in range(n)]
td=[]
for i in range(n):
td.append((li[i+1][0]-li[i][0],abs(li[i+1][1]-li[i][1])+abs(li[i+1][2]-li[i][2])))
ans="Yes"
for t,d in td:
if t<d or t%2!=d%2:
ans="No"
print(ans)
if __name__ == "__main__":
main()
| p03457 |
#086 C Traveling
N =int(eval(input()))
List=[list(map(int,input().split())) for i in range(N)]
for i,l in enumerate(List):
dt =List[i][0] - List[i-1][0]
distance = abs(List[i][1] - List[i-1][1])+abs(List[i][2] - List[i-1][2])
if i==0 and l[0] ==abs(l[1])+abs(l[2]):
continue
elif i==0 and l[0] !=abs(l[1])+abs(l[2]):
print('No')
exit()
elif i!=0 and dt%2==distance%2 and distance<=dt:
continue
else:
print('No')
exit()
print('Yes') | # C - Traveling
N = int(eval(input()))
T = []
for n in range(N):
T.append([int(i) for i in input().split()])
now_t = 0
now_x = 0
now_y = 0
cnt=0
for t in T:
if t[0]%2 !=(t[1]+t[2])%2:
print('No')
exit()
if t[0] -now_t >= abs(t[1]-now_x)+abs(t[2]-now_y):
now_t = t[0]
now_x = t[1]
now_y = t[2]
else:
print('No')
exit()
print('Yes') | p03457 |
n = int(input())
travel = [list(map(int, input().split())) for i in range(n)]
accessible_now = [(0,0)]
limit = 1e5 + 1
stroke = 0
for target in travel:
t, x, y = target
while (stroke<t):
stroke += 1
accessible_next = []
for loc in accessible_now:
for step in [(1,0),(0,1),(-1,0),(0,-1)]:
loc_next = (loc[0]+step[0],loc[1]+step[1])
if ((-1 in loc_next) or (limit in loc_next)):
continue
if (loc_next in accessible_next):
continue
accessible_next.append(loc_next)
accessible_now = accessible_next
#print stroke, t, accessible_now
if (stroke == t):
if ((x,y) in accessible_now):
accessible_now = [(x,y)]
continue
else:
print('No')
exit(0)
res = 'Yes' if (stroke==t) else 'No'
print(res)
| n = int(input())
travel = [list(map(int, input().split())) for i in range(n)]
loc = (0,0)
now = 0
res = 'Yes'
for dest in travel:
t, x, y = dest
minpath = abs(x-loc[0]) + abs(y-loc[1])
tmp = (t-now)-minpath
if (tmp%2==0 and tmp>=0 ):
loc = (x,y)
now = t
continue
else:
res = 'No'
break
print(res)
| p03457 |
N = int(eval(input()))
ans = "Yes"
x = 0
y = 0
t = 0
for i in range(N):
t_i,x_i,y_i = list(map(int,input().split()))
x_i = abs(x_i-x)
y_i = abs(y_i-x)
t_i = abs(t_i-t)
if x_i+y_i <= t_i and (x_i+y_i-t_i)%2 == 0:
continue
else:
ans = "No"
print(ans) | N = int(eval(input()))
ans = "Yes"
x = 0
y = 0
t = 0
for i in range(N):
t_i,x_i,y_i = list(map(int,input().split()))
x_i = abs(x_i-x)
y_i = abs(y_i-x)
t_i = abs(t_i-t)
if x_i+y_i <= t_i and (x_i+y_i-t_i)%2 == 0:
continue
else:
ans = "No"
x = x_i
y = y_i
t = t_i
print(ans) | p03457 |
N = int(eval(input()))
ans = "Yes"
a = 0
b = 0
T = 0
for _ in range(N):
t,x,y = list(map(int, input().split()))
if abs(a-x)+abs(b-y) <= t-T and (abs(a-x)+abs(b-y))%2 == (t-T)%2:
a = x
b = y
T = t
else:
ans = "No"
print(ans) | N = int(eval(input()))
ans = "Yes"
X = 0
Y = 0
T = 0
for _ in range(N):
t,x,y = list(map(int, input().split()))
dt = t-T
d = abs(X-x)+abs(Y-y)-dt
if d > 0 or d%2 == 1:
ans = "No"
T = t
X = x
Y = y
print(ans) | p03457 |
n = int(eval(input()))
txy = [list(map(int, input().split())) for i in range(n)]
for i in range(n):
if i == 0:
ti, xi, yi = 0, 0, 0
else:
ti, xi, yi = txy[i-1]
tf,xf,yf = txy[i]
dt = tf - ti
dx = abs(xi-xf)
dy = abs(yi-yf)
if dt < dx + dy or (dt-(dx+dy))%2 != 0:
print("No")
exit()
print("Yes")
| n = int(eval(input()))
for i in range(n):
t, x, y = list(map(int, input().split()))
if x+y > t or (x+y+t) % 2!=0:
print("No")
exit()
print("Yes") | p03457 |
N = int(eval(input()))
txy = [0]*(N+1)
txy[0] = [0, 0, 0]
for i in range(1, N + 1):
txy[i] = [int(i) for i in input().split()]
for i in range(1, N + 1):
dis = abs(txy[i][1] - txy[i-1][1]) + abs(txy[i][2] - txy[i-1][2])
time = txy[i][0] - txy[i-1][0]
if time < dis or (time - dis) % 2 != 0:
print('No')
break
else:
print('Yes') | N = int(eval(input()))
now = [0, 0, 0]
for i in range(N):
t, x, y = list(map(int, input().split()))
dis = abs(x-now[0]) + abs(y - now[1])
if (t - now[2]) < dis:
print('No')
break
elif ((t - now[2]) - dis) % 2 != 0:
print('No')
break
else:
print('Yes')
| p03457 |
from itertools import accumulate, permutations, combinations, product, combinations_with_replacement
from math import floor, ceil, sqrt, factorial, log
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict
from heapq import heappop, heappush, heappushpop
from itertools import product
import sys
stdin = sys.stdin
mod = 10**9 + 7
def ns(): return stdin.readline().rstrip()
def ni(): return int(ns())
def na(): return list(map(int, stdin.readline().split()))
n = ni()
tnow, xnow, ynow = 0, 0, 0
for _ in range(n):
t, x, y = na()
l = abs(xnow - x) + abs(ynow - y)
if (t - tnow) < l or (t - tnow) % 2 != l % 2:
print("No")
quit()
print("Yes")
| import sys
stdin = sys.stdin
from itertools import accumulate, groupby
mod = 10**9 + 7
def ns(): return stdin.readline().rstrip()
def ni(): return int(ns())
def na(): return list(map(int, stdin.readline().split()))
n = ni()
tp, xp, yp = 0, 0, 0
for _ in range(n):
t, x, y = na()
ta, l = t-tp, abs(x - xp) + abs(y - yp)
if ta >= l and ta % 2 ==l % 2:
continue
else:
print("No")
quit()
print("Yes") | p03457 |
N = int(eval(input()))
pnt = [[0]*3]
for i in range(N):
pnt.append(list(map(int, input().split())))
cnt = 0
for i in range(1, N+1):
t = pnt[i][0] - pnt[i-1][0]
x = abs(pnt[i][1] - pnt[i-1][1])
y = abs(pnt[i][2] - pnt[i-1][2])
if t >= x+y and (t-(x+y)) % 2 == 0:
cnt += 1
if cnt == N: print("Yes")
else: print("No")
| n = int(eval(input()))
ti_1, xi_1, yi_1 = [0,0,0]
for i in range(n):
ti, xi, yi = list(map(int, input().split()))
tlim = ti- ti_1
dist = abs(xi - xi_1) + abs(yi - yi_1)
if tlim < dist or (tlim-dist) % 2 == 1:
print('No')
exit()
else:
ti_1, xi_1, yi_1 = ti, xi, yi
continue
print('Yes') | p03457 |
n = int(eval(input()))
plcs = [list(map(int,input().split())) for _ in range(n)]
A = [0, 0, 0]
for i in range(n):
A = [plcs[i][j] - A[j] for j in range(3)]
if A[0] >= abs(A[1]) + abs(A[2]) and plcs[i][0] % 2 == (abs(plcs[i][1]) + abs(plcs[i][2])) % 2:
continue
else:
print('No')
exit()
print('Yes') | n = int(eval(input()))
TP = [[0, 0, 0]]
for _ in range(n):
TP.append(list(map(int, input().split())))
for i in range(1, n + 1):
td = TP[i][0] - TP[i-1][0]
pd = abs(TP[i][1] - TP[i-1][1]) + abs(TP[i][2] - TP[i-1][2])
if td >= pd and td % 2 == pd % 2:
continue
else:
print('No')
exit()
print('Yes') | p03457 |
N = int(eval(input()))
t = [0 for i in range(N + 1)]
x = [0 for i in range(N + 1)]
y = [0 for i in range(N + 1)]
for i in range(N):
t[i + 1], x[i + 1], y[i + 1] = list(map(int, input().split()))
flag = 1
for i in range(N):
dl = abs(x[i + 1] - x[i]) + abs(y[i + 1] - y[i])
dt = t[i + 1] - t[i]
if dl > dt or (dl - dt) % 2 == 1:
flag = 0
break
if flag == 1:
print("Yes")
else:
print("No")
| N=int(eval(input()));t=[0]*(N+1);x=[0]*(N+1);y=[0]*(N+1)
for i in range(N):t[i+1],x[i+1],y[i+1]=list(map(int,input().split()))
flag=1
for i in range(N):
dl = abs(x[i + 1] - x[i]) + abs(y[i + 1] - y[i])
dt = t[i + 1] - t[i]
if dl > dt or (dl - dt) % 2 == 1:
flag = 0
break
if flag == 1:
print("Yes")
else:
print("No")
| p03457 |
def BlCannotGo(dt, dx, dy): ## 行けないならTrue
if (dt % 2) != ((dx + dy) % 2) or (dx + dy) > dt:
return True
else:
return False
if __name__ == '__main__':
n = int(eval(input()))
l = list(list(map(int, input().split())) for _ in range(n))
dt = l[0][0]
dx = l[0][1]
dy = l[0][2]
if BlCannotGo(dt, dx, dy):
print('No')
exit()
for i in range(1,n):
dt = l[i][0] - l[i-1][0]
dx = l[i][1] - l[i-1][1]
dy = l[i][2] - l[i-1][2]
if BlCannotGo(dt, dx, dy):
print('No')
exit()
print('Yes') | def BlCannotGo(dt, dx, dy): ## 行けないならTrue
dist = dx + dy
if (dt % 2) != (dist % 2) or dist > dt:
return True
else:
return False
def abs(x):
if x>=0:
return x
else:
return -x
if __name__ == '__main__':
n = int(eval(input()))
t = list(False for _ in range(n+1))
x = list(False for _ in range(n+1))
y = list(False for _ in range(n+1))
t[0], x[0], y[0] = 0, 0, 0
for i in range(n):
t[i+1], x[i+1], y[i+1] = list(map(int, input().split()))
for i in range(1,n+1):
dt = t[i] - t[i-1]
dx = abs(x[i] - x[i-1])
dy = abs(y[i] - y[i-1])
if BlCannotGo(dt, dx, dy):
print('No')
exit()
print('Yes')
| p03457 |
def BlCannotGo(dt, dx, dy): ## 行けないならTrue
dist = dx + dy
if (dt % 2) != (dist % 2) or dist > dt:
return True
else:
return False
def abs(x):
if x>=0:
return x
else:
return -x
if __name__ == '__main__':
n = int(eval(input()))
t = list(False for _ in range(n+1))
x = list(False for _ in range(n+1))
y = list(False for _ in range(n+1))
t[0], x[0], y[0] = 0, 0, 0
for i in range(n):
t[i+1], x[i+1], y[i+1] = list(map(int, input().split()))
for i in range(1,n+1):
dt = t[i] - t[i-1]
dx = abs(x[i] - x[i-1])
dy = abs(y[i] - y[i-1])
if BlCannotGo(dt, dx, dy):
print('No')
exit()
print('Yes')
| def main():
n = int(eval(input()))
pt, px, py = 0, 0, 0
for _ in range(n):
t, x, y = list(map(int, input().split()))
dt = t - pt
dx = abs(x - px)
dy = abs(y - py)
if (dx + dy) % 2 != dt % 2:
print('No')
return
if (dx + dy) > dt:
print('No')
return
print('Yes')
if __name__ == '__main__':
main()
| p03457 |
def main():
n = int(eval(input()))
pt, px, py = 0, 0, 0
for _ in range(n):
t, x, y = list(map(int, input().split()))
dt = t - pt
dx = abs(x - px)
dy = abs(y - py)
if (dx + dy) % 2 != dt % 2:
print('No')
return
if (dx + dy) > dt:
print('No')
return
print('Yes')
if __name__ == '__main__':
main()
| def main():
import sys
input = sys.stdin.readline
N = int(eval(input()))
pt, px, py = 0, 0, 0
for _ in range(N):
t, x, y = list(map(int, input().split()))
dt = t - pt
dx = abs(x - px)
dy = abs(y - py)
dl = dx + dy
if dt < dl or dl % 2 != dt % 2:
print('No')
return
pt, px, py = t, x, y
print('Yes')
if __name__ == '__main__':
main()
| p03457 |
N = int(eval(input()))
p = [list(map(int, input().split())) for _ in range(N)]
ans = True
for i in range(N):
if p[i][1] + p[i][2] > p[i][0]:
ans = False
break
if (p[i][1] + p[i][2]) % 2 != p[i][0] % 2:
ans = False
break
if ans:
print("Yes")
else:
print("No")
| N = int(eval(input()))
for i in range(N):
t, x, y = list(map(int, input().split()))
if x + y > t or (x + y) % 2 != t % 2:
print("No")
exit()
print("Yes")
| p03457 |
#!/mnt/c/Users/moiki/bash/env/bin/python
N = int(eval(input()))
from collections import defaultdict, Counter
t = [ list(map(int, input().split())) for _ in range(N)]
diff = lambda a,b : abs(a[0] - b[0]) + abs(a[1] - b[1])
pos = (0,0)
tim = 0
for i in range(N):
distance = diff(pos, t[i][1:])
dis_time = t[i][0] - tim
if not dis_time % 2 == distance %2 or not dis_time>=distance:
print("No")
exit(0)
print("Yes")
exit(0)
# d = defaultdict(int)
#
# for _ in range(N):
# s = input()
# d[s[0]] += 1
# print(d)
ans = 0
charlist = list("MARCH")
for i in range(1<<5):
if not Counter( list ( "{0:05b}".format(i)) )["1"] == 3:
continue
s = 1
for e,i in enumerate(list("{0:05b}".format(i))):
if i == "1":
s *= d[ charlist[e] ]
ans += s
print(ans)
| N=int(eval(input()))
nt=0
np=(0,0)
ok=True
for t,x,y in [list(map(int,input().split())) for _ in range(N)]:
el,nt=t-nt,t
dist=abs(np[0]-x)+abs(np[1]-y)
if el<dist:
ok=False
break
if (el-dist)%2!=0:
ok=False
break
np=(x,y)
if ok:
print("Yes")
else:
print("No") | p03457 |
n=int(eval(input()))
a=[list(map(int,input().split())) for _ in range(n)]
x=y=t=0
ans='Yes'
for i in range(n):
xy=a[i][1]+a[i][2]-(x+y)
if xy>a[i][0]-t:
ans='No'
break
else:
if xy%2!=(a[i][0]-t)%2:
ans='No'
break
elif abs(a[i][1]-x)+abs(a[i][2]-y)>a[i][0]-t:
ans='No'
break
x=a[i][1]
y=a[i][2]
t=a[i][0]
print(ans) | n=int(eval(input()))
a=[list(map(int,input().split())) for _ in range(n)]
x=y=t=0
ans='Yes'
for i in range(n):
c=a[i]
xy=c[1]+c[2]-(x+y)
if xy>c[0]-t:
ans='No'
break
else:
if xy%2!=(c[0]-t)%2:
ans='No'
break
elif abs(c[1]-x)+abs(c[2]-y)>c[0]-t:
ans='No'
break
x=c[1]
y=c[2]
t=c[0]
print(ans) | p03457 |
# -*- coding: utf-8 -*-
n = int(eval(input()))
t_bef, x_bef, y_bef, flag = 0, 0, 0, 0
travel = []
for i in range(n):
travel.append([int(x) for x in input().split()])
for j in travel:
t, x, y = j[0], j[1], j[2]
check = (t - t_bef) - abs(x_bef - x) - abs(y_bef - y)
t_bef, x_bef, y_bef = t, x, y
if check < 0:
print('No')
flag = 1
break
if check % 2 != 0:
print('No')
flag = 1
break
if flag == 0:
print('Yes') | # -*- coding: utf-8 -*-
n = int(eval(input()))
t_bef, x_bef, y_bef, flag = 0, 0, 0, 0
travel = []
for i in range(n):
t, x, y = [int(x) for x in input().split()]
check = (t - t_bef) - abs(x_bef - x) - abs(y_bef - y)
t_bef, x_bef, y_bef = t, x, y
if check < 0:
print('No')
flag = 1
break
if check % 2 != 0:
print('No')
flag = 1
break
if flag == 0:
print('Yes') | p03457 |
n = int(eval(input()))
t = [0]
x = [0]
y = [0]
for i in range(n):
t_, x_, y_ = list(map(int, input().split()))
t.append(t_)
x.append(x_)
y.append(y_)
for j in range(n):
dt = t[j+1] - t[j]
dx = abs(x[j+1] - x[j])
dy = abs(y[j+1] - y[j])
if dx+dy>dt or dt%2!=(dx+dy)%2:
print('No')
exit()
print('Yes') | n=int(eval(input()))
t=0
x=0
y=0
for i in range(n):
t_,x_,y_=list(map(int,input().split()))
t=abs(t_-t)
x=abs(x_-x)
y=abs(y_-y)
if x+y>t:
print('No')
exit()
if t_%2!=(x_+y_)%2:
print('No')
exit()
print('Yes') | p03457 |
#!/usr/bin/env python
"""AtCoder Beginner Contest 086: C - Traveling
https://atcoder.jp/contests/abc086/tasks/arc089_a
"""
__author__ = 'bugttle <bugttle@gmail.com>'
def main():
N = int(eval(input()))
position = {'t': 0, 'x': 0, 'y': 0}
answer = 'Yes'
for _ in range(N):
t, x, y = list(map(int, input().split()))
# print('x:' + str(abs(x-position['x'])))
# print('y:' + str(abs(y-position['y'])))
# print('t:' + str(t - position['t']))
# print(abs(x-position['x']) + abs(y-position['y']))
length = abs(x-position['x']) + abs(y-position['y'])
t_d = t - position['t']
if length <= t_d and length % 2 == t_d % 2:
position = {'t': t, 'x': x, 'y': y}
else:
answer = 'No'
break
print(answer)
if __name__ == '__main__':
main()
| #!/usr/bin/env python
"""AtCoder Beginner Contest 086: C - Traveling
https://atcoder.jp/contests/abc086/tasks/arc089_a
"""
__author__ = 'bugttle <bugttle@gmail.com>'
def main():
N = int(eval(input()))
current = {'t': 0, 'x': 0, 'y': 0}
answer = 'Yes'
for _ in range(N):
t, x, y = list(map(int, input().split()))
length = abs(x-current['x']) + abs(y-current['y'])
t_d = t - current['t']
# t=1: odd, t=2: even, t=3: odd, t=4: even, ...
if length <= t_d and length % 2 == t_d % 2:
current = {'t': t, 'x': x, 'y': y}
else:
answer = 'No'
break
print(answer)
if __name__ == '__main__':
main()
| p03457 |
N=int(eval(input()))
txy=[list(map(int,input().split())) for i in range(N)]
ans=0
for i in range(N):
t,x,y=txy[i][0],txy[i][1],txy[i][2]
if x+y<=t and t%2==(x+y)%2:ans+=1
print(("Yes" if ans==N else "No")) | N=int(eval(input()))
count=0
for i in range(N):
t,x,y=list(map(int,input().split()))
if x+y<=t and t%2==(x+y)%2:count+=1
print(("Yes" if count==N else "No")) | p03457 |
def dif(two_lists):
return [abs(two_lists[1][i] - two_lists[0][i]) for i in range(3)]
n = int(eval(input()))
txy = [[0, 0, 0]] + [list(map(int, input().split())) for _ in range(n)]
dtxy = list(map(dif, list(zip(txy, txy[1:]))))
for i in range(n):
dt, dx, dy = dtxy[i]
if dx + dy > dt or (dt - dx - dy) % 2:
print("No")
exit()
print("Yes")
| import sys
def dif(two_lists):
return [abs(two_lists[1][i] - two_lists[0][i]) for i in range(3)]
n = int(eval(input()))
txy = [[0, 0, 0]] + [[int(s) for s in line.split()] for line in sys.stdin]
dtxy = list(map(dif, list(zip(txy, txy[1:]))))
for i in range(n):
dt, dx, dy = dtxy[i]
if dx + dy > dt or (dt - dx - dy) % 2:
print("No")
exit()
print("Yes")
| p03457 |
import sys
n = int(eval(input()))
before_t, before_x, before_y = 0, 0, 0
for i in range(n):
txy_strs = input().split()
t, x, y = tuple(map(int, txy_strs))
movable = t - before_t
min_move = abs(x - before_x) + abs(y - before_y)
remaining = movable - min_move
if 0 <= remaining and remaining % 2 == 0:
before_t, before_x, before_y = t, x, y
else:
print("No")
sys.exit()
print("Yes") |
import sys
n = int(sys.stdin.readline())
before_t, before_x, before_y = 0, 0, 0
for i in range(n):
txy_strs = sys.stdin.readline().split()
t, x, y = tuple(map(int, txy_strs))
movable = t - before_t
min_move = abs(x - before_x) + abs(y - before_y)
remaining = movable - min_move
if 0 <= remaining and remaining % 2 == 0:
before_t, before_x, before_y = t, x, y
else:
print("No")
sys.exit()
print("Yes") | p03457 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.