problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03457 | s758755549 | Accepted | n = int(input())
start = [0, 0]
curtime = 0
flag = True
for i in range(n):
t, x, y = map(int, input().split())
dist = abs(x-start[0]) + abs(y-start[1])
time = t-curtime
if dist <= time and dist % 2 == time % 2:
start = [x, y]
curtime = t
continue
print('No')
flag = False
break
if flag:
print('Yes') |
p03457 | s940586483 | Accepted | n = int(input())
t = [list(map(int,input().split())) for _ in range(n)]
t.insert(0,[0,0,0])
for i in range(1,n+1):
d_sec = t[i][0] - t[i-1][0]
d_x = abs(t[i][1]- t[i-1][1])
d_y = abs(t[i][2]- t[i-1][2])
d_xy = d_x + d_y
if (d_sec < d_xy) | (d_sec%2 != d_xy%2):
print("No")
break
else:
print("Yes") |
p03457 | s158305637 | Accepted | N = int(input())
travel = [list(map(int, input().split())) for _ in range(N)]
buff = [0, 0, 0]
ans = "Yes"
for i in range(N):
t, x, y = travel[i]
time = t - buff[0]
distance = abs(x - buff[1]) + abs(y - buff[2])
if time < distance or (time - distance) % 2 == 1:
ans = "No"
break
buff = travel[i]
print(ans)
|
p03457 | s763907068 | Accepted | n = int(input())
ans = 1
tt, xx, yy = 0, 0, 0
for i in range(n):
t, x, y = map(int, input().split())
keep = abs(xx - x) + abs(yy - y) - (t - tt)
if (keep > 0) | (keep % 2 != 0):
ans *= 0
tt, xx, yy = t, x, y
print(['No', 'Yes'][ans])
|
p03457 | s021114388 | Accepted | N = int(input())
TXY = []
flag = True
for i in range(N):
txy = list(map(int,input().split()))
if not (txy[0] % 2 == (txy[1] + txy[2]) % 2 and txy[0] >= (txy[1] + txy[2])):
flag = False
if flag == True:
print("Yes")
else:
print("No") |
p03457 | s560746337 | Accepted | N = int(input())
time = [0]*100009
x = [0]*100009
y = [0]*100009
for i in range(N):
time[i+1],x[i+1],y[i+1] = [int(x) for x in input().split()]
flag = True
for i in range(N):
dt = time[i+1]-time[i]
dist = abs(x[i+1] - x[i]) + abs(y[i+1] - y[i])
if dt < dist:
flag = False
if dt % 2 != dist % 2:
flag = False
if flag:
print('Yes')
else:
print('No')
|
p03457 | s340830071 | Accepted | N=int(input())
t=0
x=0
y=0
for i in range(N):
t_next,x_next,y_next=map(int,input().split())
zikan=t_next - t
kyori=abs(x_next-x)+abs(y_next-y)
if kyori>zikan or (zikan-kyori)%2==1:
print('No')
exit(0)
t,x,y=t_next,x_next,y_next
print('Yes') |
p03457 | s682404398 | Accepted | n=int(input())
sx,sy=0,0
f=True
t1=0
for i in range(n):
t2,gx,gy=map(int,input().split())
a=abs(sx-gx)+abs(sy-gy)
t=t2-t1
if a>t:
f=False
elif (a-t)%2==1:
f=False
sx,sy=gx,gy
t1=t2
if f:
print("Yes")
else:
print("No") |
p03457 | s422297161 | Accepted | def solve():
N = int(input())
A = [[0,0,0]]
for _ in range(N):
a = list(map(int, input().split()))
A.append(a)
ans = 'Yes'
for i in range(N):
t1, x1, y1 = A[i]
t2, x2, y2 = A[i+1]
time = t2 - t1
x = abs(x2 - x1)
y = abs(y2 - y1)
if time < x+y or (time+x+y) % 2 != 0:
ans = 'No'
return ans
print(solve())
|
p03457 | s642015806 | Accepted | N = int(input())
t = 0
x = 0
y = 0
for ti, xi, yi in [map(int, input().split(' ')) for n in range(N)]:
if not (abs(xi-x)+abs(yi-y) <= ti-t and ti%2 == (xi+yi)%2):
print('No')
exit()
else:
t = ti
x = xi
y = yi
print('Yes') |
p03457 | s666329655 | Accepted | t, x, y = 0, 0, 0
for i in range(int(input())):
next_t, next_x, next_y = map(int, input().split())
diff = abs(x - next_x) + abs(y - next_y)
if diff > (next_t - t) or (diff - (next_t - t)) % 2 == 1:
print("No")
exit(0)
t, x, y, = next_t, next_x, next_y
print("Yes") |
p03457 | s538127523 | Accepted | N = int(input())
T, X, Y = 0, 0, 0
cnt = 0
for _ in range(N):
t, x, y = map(int,input().split())
dist = abs(x-X) + abs(y-Y)
dt = t - T
cnt += all([dist <= dt, (dist - dt) % 2 == 0])
T, X, Y = t, x, y
print("YNeos"[N!=cnt::2])
|
p03457 | s450512901 | Accepted | N = int(input())
ans = True
k,x,y = 0,0,0
for i in range(N):
t,p,q = map(int,input().split())
d = abs(x-p)+abs(y-q)
if d>(t-k):ans = False
if ((t-k)-d)%2==1:ans = False
k,x,y = t,p,q
print("Yes" if ans else "No") |
p03457 | s164456197 | Accepted | n=int(input())
bt=0
bx=0
by=0
ans='Yes'
for i in range(n):
t,x,y=map(int,input().split())
dt=t-bt
dx=abs(x-bx)
dy=abs(y-by)
if (dx+dy)>dt:
ans='No'
elif (dt-(dx+dy))%2==1:
ans='No'
bt=t
bx=x
by=y
print(ans) |
p03457 | s882628905 | Accepted | for _ in range(int(input())):
t, x, y = map(int, input().split())
if (x + y + t) % 2 or (x + y) > t:
print('No')
exit(0)
print('Yes') |
p03457 | s321708963 | Accepted | #!/usr/bin/env python3
import sys
n = int(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] = map(int, input().split())
for i in range(n):
length = abs((x[i+1]-x[i])+(y[i+1]-y[i]))
move = t[i+1]-t[i]
if move < length:
print('No')
sys.exit()
if (move - length)%2==1:
print('No')
sys.exit()
print('Yes')
|
p03457 | s351768887 | Accepted | #python3
def main():
n = int(input())
for _ in range(n):
t, x, y = map(int, input().split())
if t < x + y:
print('No')
return
if (x+y-t)%2 != 0:
print('No')
return
print('Yes')
main()
|
p03457 | s122060685 | Accepted | n = int(input())
flg = True
x,y = 0,0
for i in range(n):
a,b,c = map(int,input().split())
if (a < abs(b) + abs(c) - (x+y)) or (a % 2 != (abs(b) + abs(c)) % 2):
flg = False
break
else:
x = b
y = c
#print(flg)
print("Yes" if flg else "No") |
p03457 | s868645308 | Accepted | N = int(input())
pt, px, py = [0, 0, 0]
ans = 'Yes'
for i in range(N):
t, x, y = [int(n) for n in input().split()]
dt = t-pt
dxy = sum([abs(x-px), abs(y-py)])
if dt < dxy or dt%2 != dxy%2:
ans = 'No'
break
else:
pt, px, py = t, x, y
print(ans)
|
p03457 | s050872340 | Accepted | N = int(input())
start = [0, 0]
start_t = 0
for i in range(N):
t, x, y = map(int, input().split())
now = [x, y]
dt = t - start_t
dist = abs(now[0]-start[0]) + abs(now[1]-start[1])
if dist > dt or dt % 2 != dist % 2:
print('No')
break
else:
start = now
start_t = t
else:
print('Yes') |
p03457 | s438794252 | Accepted | N = int(input())
t = 0
xy = [0,0]
ans = 'Yes'
for i in range(N):
ti,xi,yi = map(int,input().split())
dt = ti - t
dx = abs(xi - xy[0])
dy = abs(yi - xy[1])
if dt < dx+dy:
ans = 'No'
elif dt%2 != (dx+dy)%2:
ans = 'No'
t = ti
xy = [xi,yi]
print(ans) |
p03457 | s387009817 | Accepted | n = int(input())
t, x, y = 0, 0, 0
for _ in range(n):
t2, x2, y2 = map(int, input().split())
T = t2 - t
d = abs(x2 - x) + abs(y2 - y)
if T < d or (T % 2 != d % 2):
print('No')
break
t, x, y = t2, x2, y2
else:
print('Yes') |
p03457 | s800060283 | Accepted | N = int(input())
plan = [[0,0,0]] + [list(map(int, input().split())) for i in range(N)]
f = True
for i in range(N):
time = plan[i+1][0]-plan[i][0]
dist = abs(plan[i+1][1]-plan[i][1])+abs(plan[i+1][2]-plan[i][2])
if dist>time or dist%2 != time%2:
f = False
print('Yes' if f else 'No') |
p03457 | s173742018 | Accepted | N=int(input())
cnt=0
T,X,Y=0,0,0
for i in range(N):
t,x,y=map(int,input().split())
if abs(X-x)+abs(Y-y)<=t-T and t%2==(x+y)%2:cnt+=1
T,X,Y=t,x,y
print("Yes" if cnt==N else "No") |
p03457 | s103328073 | Accepted | 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()
|
p03457 | s386832171 | Accepted | N = int(input())
P = [[0, 0, 0]]
ans = 'Yes'
for i in range(N):
l = list(map(int, input().split()))
P.append(l)
for i in range(N):
c = P[i+1][0] - P[i][0]
d = abs(P[i+1][1] - P[i][1]) + abs(P[i+1][2] - P[i][2])
if c % d != 0:
ans = 'No'
break
print(ans)
|
p03457 | s034215606 | Accepted | n = int(input())
lst1 = [list(map(int,input().split())) for i in range(n)]
lst1.sort()
x,y = 0,0
t = lst1[0][0]
for i in range(n):
if i > 0:
t = lst1[i][0] - lst1[i-1][0]
move = abs(lst1[i][1]-x) + abs(lst1[i][2]-y)
if move > t:
print("No")
exit()
elif move%2 != t%2:
print("No")
exit()
x,y = lst1[i][1],lst1[i][2]
print("Yes") |
p03457 | s582915611 | Accepted | N = int(input())
l = [list(map(int, input().split())) for _ in range(N)]
pT, pX, pY = 0, 0, 0
for i in range(N):
cT, cX, cY = l[i]
mvT, mvX, mvY = abs(cT-pT), abs(cX-pX), abs(cY-pY)
dam = mvT - (mvX+mvY)
if dam %2 == 1 or dam < 0:
print('No')
exit()
pT, pX, pY = l[i]
print('Yes')
|
p03457 | s349743215 | Accepted | n = int(input())
ct, cx, cy = 0, 0, 0
for i in range(n):
t, x, y = map(int, input().split())
if abs(ct-t) < abs(cx-x) + abs(cy-y) or (abs(ct-t) + abs(cx-x) + abs(cy - y)) % 2 != 0:
print('No')
break
else:
ct = t
cx = x
cy = y
else:
print('Yes') |
p03457 | s169912975 | Accepted | N = int(input())
PX = PY = PT = 0
for _ in range(N):
T,X,Y = map(int,input().split())
if abs(X-PX)+abs(Y-PY)>T-PT or (X+Y-PX-PY)%2 != (T-PT)%2:
print("No")
exit()
else:
PX = X
PY = Y
PT = T
print("Yes") |
p03457 | s434329144 | Accepted | N = int(input())
flag = 1
t1 = 0
x1 = 0
y1 = 0
for i in range(N):
t2, x2, y2 = map(int, input().split())
dt = t2-t1
dx = abs(x2-x1)
dy = abs(y2-y1)
if dt<(dx+dy) or dt %2 != (dx+dy) % 2:
flag = 0
break
t1 = t2
x1 = x2
y1 = y2
print("Yes" if flag else "No")
|
p03457 | s682134765 | Accepted | n=int(input())
inix=0
iniy=0
for _ in range(n):
t,x,y=map(int,input().split())
dist=abs(x-inix) + abs(y-iniy)
if t<dist or (t+dist)%2 != 0:
print('No')
break
else:
print('Yes')
|
p03457 | s796850708 | Accepted | t,x,y = 0, 0, 0
for i in range(int(input())):
next_t,next_x,next_y = map(int, input().split())
dist = abs(next_x - x) + abs(next_y - y)
time = next_t - t
if dist > time or (dist - time) % 2 == 1:
print("No")
exit(0)
t,x,y = next_t,next_x,next_y
print("Yes")
|
p03457 | s390859566 | Accepted | n=int(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=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 | s679217470 | Accepted | N = int(input())
count = 0
T, X, Y = 0, 0, 0
for i in range(N):
t, x, y = 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") |
p03457 | s293825025 | Accepted | # 距離的に到達可能か、経過時間と距離差の偶奇が一致してるか
N = int(input())
pt = 0
px = 0
py = 0
#ans = True
for _ in range(N):
t,x,y = map(int,input().split())
if abs(x-px) + abs(y-py) > t-pt:
print('No')
exit()
if (abs(x-px) + abs(y-py))%2 != (t-pt)%2:
print('No')
exit()
pt = t
px = x
py = y
print('Yes') |
p03457 | s848806290 | Accepted | N=int(input())
tl=[]
xl=[]
yl=[]
al=[]
bl=[]
cl=[]
dl=[]
for i in range(N):
t,x,y=map(int,input().split())
tl.append(t)
xl.append(x)
yl.append(y)
al.append((x+y)%2)
bl.append(t%2)
for i in range(N):
c=abs((xl[i]+yl[i])-(xl[i-1]+yl[i-1]))
d=abs(tl[i]-tl[i-1])
cl.append(c)
dl.append(d)
count=0
for i in range(N):
if al[i]==bl[i] and (xl[i]+yl[i])<=tl[i] and cl[i]<=dl[i]:
count+=1
if count==N:
print("Yes")
else :
print("No") |
p03457 | s103952389 | Accepted | t=0
x=0
y=0
n=int(input())
for i in range(n):
ti,xi,yi=map(int,input().split())
t=ti-t
x=xi-x
y=yi-y
if t%2!=(abs(x+y))%2:
print('No')
exit()
elif t<abs(x)+abs(y):
print('No')
exit()
print('Yes') |
p03457 | s508033979 | Accepted | import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)
N = int(input())
TXY = [list(map(int, input().split())) for _ in range(N)]
nx, ny = 0, 0
time = 0
ans = "Yes"
for i in range(N):
t, x, y = TXY[i]
dt = t - time
move = abs(nx - x) + abs(ny - y)
if move > dt:
ans = "No"
break
if dt % 2 != move % 2:
ans = "No"
break
time, nx, ny = t, x, y
print(ans)
|
p03457 | s779847528 | Accepted | def dist(x,y):
return abs(x[0]-y[0])+abs(x[1]-y[1])
N = int(input())
X = [list(map(int,input().split())) for _ in range(N)]
flag = 0
t1,x1,y1 = 0,0,0
for i in range(N):
t2,x2,y2 = X[i]
d = dist((x1,y1),(x2,y2))
dt = t2-t1
if dt>=d and (dt-d)%2==0:
t1,x1,y1 = X[i]
else:
flag=1
break
if flag==0:
print("Yes")
else:
print("No") |
p03457 | s274863505 | Accepted | N = int(input())
plan = [[0]*3 for i in range(N+1)]
for i in range(1,N+1):
plan[i][0],plan[i][1],plan[i][2] = map(int,input().split())
flag = 0
for i in range(N):
dt = plan[i+1][0] - plan[i][0]
dist = abs(plan[i+1][1]-plan[i][1]) + abs(plan[i+1][2]-plan[i][2])
if dt < dist or dt%2 != dist%2:
print("No")
flag = 0
break
else:
flag = 1
if flag == 1:
print("Yes")
|
p03457 | s374192908 | Accepted | N = int(input().strip())
route = [tuple(map(int, input().strip().split(" "))) for i in range(N)]
start = (0, 0, 0)
goal = True
for r in route:
t = r[0] - start[0]
d = abs(r[1]-start[1]) + abs(r[2]-start[2])
if d % 2 == t % 2 and t >= d: # match even/odd and can reach dest in time
pass
else:
goal = False
break
start = r
if goal:
print("Yes")
else:
print("No")
|
p03457 | s939014228 | Accepted | N = int(input())
l = []
now = [0,0,0]
ans = 'Yes'
for _ in range(N):
inp = list(map(int,input().split()))
l.append(inp)
for i in range(N):
shortest = abs(l[i][1] - now[1]) + abs(l[i][2] - now[2])
if shortest > l[i][0]-now[0]:
ans = 'No'
break
a = l[i][0] -now[0]- shortest
if a % 2 !=0:
ans = 'No'
break
else:
now = l[i]
print(ans) |
p03457 | s266043807 | Accepted | n = int(input())
txy = [list(map(int,input().split())) for _ in range(n)]
txy.insert(0,[0,0,0])
for i in range(n):
t = txy[i+1][0] - txy[i][0]
x = abs(txy[i+1][1] - txy[i][1])
y = abs(txy[i+1][2] - txy[i][2])
if t < x+y:
print('No')
exit()
elif t == x+y:
pass
else:
if ((t%2 == 0) and ((x+y)%2 == 0)) or ((t%2 != 0)and((x+y)%2 != 0)):
pass
else:
print('No')
exit()
print('Yes') |
p03457 | s610329167 | Accepted | import sys
n = int(input())
tourList = {}
#順次移動できるかチェックしていく
nowX = 0
nowY = 0
nowTime = 0
for i in range(n):
t,x,y = map(int,input().split())
moveX = abs(x - nowX)
moveY = abs(y - nowY)
moveTime = moveX+moveY
reachTime = moveTime + nowTime
if reachTime > t or (t-reachTime) % 2 != 0:
print('No')
sys.exit()
nowTime = t
nowX = x
nowY = y
print('Yes')
|
p03457 | s830534305 | Accepted | n=int(input())
u=0
p=0
q=0
for _ in range(n):
t,x,y=map(int,input().split())
if abs(p-x)+abs(q-y)<=t-u and (t-u-abs(p-x)-abs(q-y))%2==0:
u=t
p=x
q=y
else:
print('No')
break
else:
print('Yes') |
p03457 | s003818043 | Accepted | import sys
input = sys.stdin.readline
n = int(input())
t = 0
x = 0
y = 0
judge = True
for i in range(n):
t1, x1, y1 = map(int, input().split())
if (abs(x1 - x) + abs(y1 - y))/(t1 - t) > 1 or (abs(x1 - x) + abs(y1 - y))%2 != (t1 - t)%2:
judge = False
x = x1
y = y1
t = t1
if judge == True:
print("Yes")
else:
print("No") |
p03457 | s001163966 | Accepted | import numpy as np
n=int(input())
x=[list(map(int, input().split())) for _ in range(n)]
now=0
nplace=[0,0]
noflag=False
for y in x:
dis=sum(map(abs, (np.array(y[1:]) - np.array(nplace))))
# print(dis)
if not ((dis<=(y[0]-now)) & ((y[0]-now-dis)%2==0)):
noflag=True
now=y[0]
nplace=y[1:]
print('Yes') if noflag==False else print('No') |
p03457 | s352352642 | Accepted | #!/usr/bin/python3
# -*- coding: utf-8 -*-
import numpy as np
N = int(input())
prev_dst = [0,0,0]
for n in range(N):
t, x, y = map(int, input().split(" "))
a = (t - prev_dst[0]) - (np.abs(prev_dst[1]-x) + np.abs(prev_dst[2]-y))
if a >= 0 and a % 2 == 0:
prev_dst = [t, x, y]
else:
print("No")
exit(0)
print("Yes")
|
p03457 | s860192924 | Accepted | N = int(input())
nowx = 0
nowy = 0
nowt = 0
result = 'Yes'
for i in range(N):
[t, x, y] = list(map(int,input().split(' ')))
if (t - nowt) >= abs(x - nowx) + abs(y - nowy) and ((t - nowt) - (x - nowx) - (y - nowy)) % 2 == 0:
nowx = x
nowy = y
nowt = t
continue
else:
result = 'No'
break
print(result)
|
p03457 | s729697995 | Accepted | n=int(input())
posi=[]
for _ in range(n):
posi.append(list(map(int,input().split())))
x=0
y=0
t=0
for item in posi:
temp=abs(x-item[1])+abs(y-item[2])
#print(t,x,y,item)
if item[0]-t<temp:
#print("error")
print("No")
exit()
flag=(item[0]-t-temp)%2
#print("flag",flag)
if flag==0:
#print("hoge")
t=item[0]
x=item[1]
y=item[2]
else:
print("No")
exit()
print("Yes") |
p03457 | s962768026 | Accepted | N = int(input())
ans = "Yes"
X = 0
Y = 0
T = 0
for _ in range(N):
t,x,y = 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 | s966974492 | Accepted | N = int(input())
t_pre, x_pre, y_pre = 0, 0, 0
flag = True
for i in range(N):
t, x, y = map(int, input().split())
delta_t = t - t_pre
delta_x = abs(x - x_pre)
delta_y = abs(y - y_pre)
if t % 2 != (x + y) %2:
flag = False
break
if delta_x + delta_y > delta_t:
flag = False
break
if flag:
print('Yes')
else:
print('No') |
p03457 | s360259198 | Accepted | def main():
n = int(input())
txy = [list(map(int, input().split())) for _ in range(n)]
pre_x, pre_y, pre_t = 0, 0, 0
for t, x, y in txy:
d = abs(pre_x - x) + abs(pre_y - y)
if not(t - pre_t >= d and (t - pre_t) % 2 == d % 2):
print('No')
break
pre_x, pre_y, pre_t = x, y, t
else:
print('Yes')
if __name__ == '__main__':
main() |
p03457 | s354647477 | Accepted | n = int(input())
x = 0
y = 0
t = 0
ans = 'Yes'
for _ in range(n):
ti, xi, yi = map(int, input().split())
elapsed_time = ti - t
if abs(x - xi) + abs(y - yi) > elapsed_time:
ans = 'No'
break
dist_odd_even = (abs(x - xi) + abs(y - yi)) % 2
time_odd_even = elapsed_time % 2
if dist_odd_even != time_odd_even:
ans = 'No'
break
x = xi
y = yi
t = ti
print(ans) |
p03457 | s606570703 | Accepted | N = int(input())
for _ in range(N):
t, x, y = map(int, input().split())
if x + y > t or (t + x + y)%2 != 0:
print("No")
exit()
print("Yes") |
p03457 | s713531798 | Accepted | N = int(input())
tmp = [tuple(map(int,input().split())) for i in range(N)]
ct = cx = cy = 0
for t,x,y in tmp:
dst = abs(cx - x) + abs(cy - y)
if dst > t-ct or dst%2 != (t-ct)%2:
print('No')
exit()
ct,cx,cy = t,x,y
print('Yes') |
p03457 | s211926413 | Accepted | import sys
_input = sys.stdin.readline
def resolve():
N = int(_input())
t, x, y = 0, 0, 0
for _ in range(N):
next_t, next_x, next_y = map(int, _input().split())
diff_xy = abs(x - next_x) + abs(y - next_y)
diff_t = next_t - t
if diff_xy > diff_t or (diff_xy % 2 != diff_t % 2):
print('No')
exit(0)
print('Yes')
if __name__ == '__main__':
resolve() |
p03457 | s150547753 | Accepted | # coding: utf-8
N=int(input())
L=[]
L.append([0,0,0])
Flg=True
cnt=0
for i in range(1,N+1):
t,x,y=map(int,input().split())
L.append([t,x,y])
if (t-L[i-1][0]-(abs(L[i-1][1]-x)+abs(L[i-1][2]-y)))%2==0 and t-L[i-1][0]>=(abs(L[i-1][1]-x)+abs(L[i-1][2]-y)):
cnt+=1
if cnt==N:
print('Yes')
else:
print('No') |
p03457 | s619709820 | Accepted | n = int(input())
txy = [list(map(int,input().split())) for _ in range(n)]
flag = True
txy.insert(0,[0,0,0])
for i in range(n):
t = txy[i+1][0] - txy[i][0]
d = abs(txy[i+1][1] - txy[i][1]) + abs(txy[i+1][2]-txy[i][2])
if t < d:
flag = False
elif t == d:
continue
elif (t-d) % 2 != 0:
flag = False
if flag:
print('Yes')
else:
print('No') |
p03457 | s095697353 | Accepted | n = int(input())
x0, y0, t0 = 0, 0, 0
for _ in range(n):
t, x, y = map(int, input().split())
if abs(x-x0) + abs(y-y0) > t-t0 or (x+y)%2 != t%2:
status = "No"
break
else:
status = "Yes"
t0, x0, y0 = t, x, y
print(status) |
p03457 | s416153350 | Accepted | import numpy as np
n = int(input())
grid = []
grid.append([0,0,0])
ans = "Yes"
for i in range(1,n+1):
array = list(map(int,input().split()))
grid.append(array)
for i in range(n):
if np.abs(grid[i+1][1]-grid[i][1])+np.abs(grid[i+1][2]-grid[i][2]) > grid[i+1][0]-grid[i][0]:
ans="No"
elif (grid[i+1][0] - grid[i][0] - np.abs(grid[i+1][1]-grid[i][1]) - np.abs(grid[i+1][2]-grid[i][2])) % 2 == 1:
ans="No"
print(ans) |
p03457 | s010825287 | Accepted | n = int(input())
ti,xi,yi = 0,0,0
found = True
for _ in range(n):
t, x, y = map(int, input().split())
root = abs(x-xi)+abs(y-yi)
if root > (t-ti) or (t-ti-root)&1:
found = False
ti,xi,yi = t,x,y
print("Yes" if found else "No") |
p03457 | s316997006 | Accepted | n=int(input())
txylist=[[0,0,0]]
for i in range(n):
txy=list(map(int,input().split(" ")))
txylist+=[txy]
for i in range(n):
p=False
t0,x0,y0=txylist[i]
t1,x1,y1=txylist[i+1]
t,x,y=t1-t0,x1-x0,y1-y0
tt=abs(x)+abs(y)
legs=t-tt
if legs>=0 and legs%2==0:
p=True
else:
print("No")
break
if p==True:
print("Yes") |
p03457 | s970045357 | Accepted | N = int(input())
ex_t, ex_x, ex_y = 0, 0, 0
count = 0
for i in range(N):
t, x, y = map(int, input().split())
if abs(x-ex_x) + abs(y-ex_y) <= abs(t-ex_t) and t%2 == (x+y)%2:
count += 1
ex_t, ex_x, ex_y = t, x, y
print('Yes' if count == N else 'No') |
p03457 | s502988497 | Accepted | n = int(input())
bt, bx, by = 0, 0, 0
flag = True
for i in range(n):
nt, nx, ny = map(int, input().split())
dist = abs(nx - bx) + abs(ny - by)
diff_t = nt - bt
if diff_t < dist or (diff_t - dist) % 2:
flag = False
bt, bx, by = nt, nx, ny
print('Yes' if flag else 'No') |
p03457 | s733709302 | Accepted | n = int(input())
t_list = [list(map(int,input().split()))
for nesya in range(n)]
dame = 0
ti = 0
tx = 0
ty = 0
for t in t_list:
time = t[0]
x_t = t[1]
y_t = t[2]
d = abs(y_t-ty)+abs(x_t-tx)
h = time - ti
if d > h or (h-d)%2 == 1:
dame += 1
print('No')
break
ti = time
tx = x_t
ty = y_t
if dame == 0:
print('Yes') |
p03457 | s732193044 | Accepted | n = int(input())
# 初期位置
x_old, y_old, t_old = 0, 0, 0
for _ in range(n):
# 都度読み込み
t, x, y = map(int, input().split())
d = (t - t_old) - abs(x - x_old) - abs(y - y_old)
if d >= 0 and d % 2 == 0:
x_old, y_old, t_old = x, y, t
else:
print('No')
exit()
print('Yes') |
p03457 | s220668945 | Accepted | import sys
input = sys.stdin.readline
n = int(input())
t = 0
x = 0
y = 0
l = [tuple(map(int, input().split())) for _ in range(n)]
for t1, x1, y1 in l:
if (abs(x1 - x) + abs(y1 - y))/(t1 - t) > 1:
print("No")
exit()
if (abs(x1 - x) + abs(y1 - y))%2 != (t1 - t)%2:
print("No")
exit()
x = x1
y = y1
t = t1
print("Yes") |
p03457 | s057115872 | Accepted | N = int(input())
t = [list(map(int, input().split())) for i in range(N)] #[t,x,y]
t.insert(0, [0,0,0]) #リストに場所指定して要素追加：（リスト名）.insert(インデックス番号, 要素)
flag = True
for i in range(N):
dt = t[i+1][0] - t[i][0]
dist = abs(t[i+1][1]-t[i][1]) + abs(t[i+1][2]-t[i][2])
if dt < dist:
flag = False
if dt%2!=dist%2:
flag = False
print('Yes' if flag else 'No') |
p03457 | s275701550 | Accepted | n=int(input())
plan=[[int(s) for s in input().split()] for j in range(n)]
now =[0 for j in range(3)]
plan.insert(0,now)
ans=0
for i in range(n):
dt=abs(plan[i+1][0]-plan[i][0])
dx=abs(plan[i+1][1]-plan[i][1])
dy=abs(plan[i+1][2]-plan[i][2])
if dt>=dx+dy:
if dt%2 == (dx+dy)%2:
ans+=1
print("Yes" if ans==n else "No") |
p03457 | s206005678 | Accepted | n=int(input())
a=[[int(i) for i in input().split()] for l in range(n)]
nx=0
ny=0
day=0
for x in a:
tx=abs(x[1]-nx)
ty=abs(x[2]-ny)
tday=x[0]-day
if (tx+ty-tday)%2==0 and tx+ty<=tday:
nx=x[1]
ny=x[2]
day=x[0]
else:
print("No")
break
else:print("Yes") |
p03457 | s260917475 | Accepted | N = int(input())
ans = True
cx = 0
cy = 0
ct = 0
for _ in range(N):
t, x, y = map(int, input().split())
d = abs(cx - x) + abs(cy - y)
dt = t - (ct + d)
if dt % 2 == 0 and dt >= 0:
cx = x
cy = y
ct = t
else:
ans = False
break
if ans:
print("Yes")
else:
print("No")
|
p03457 | s337762679 | Accepted | import sys
def input(): return sys.stdin.readline().strip()
def resolve():
def main():
n=int(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() |
p03457 | s299646464 | Accepted | N = int(input())
prev = (0,0)
prev_t = 0
for i in range(N):
t,x,y= map(int, input().split())
manhattan = abs(prev[0]-x) + abs(prev[1]-y)
if manhattan%2 != (t-prev_t)%2:
print("No")
exit()
if manhattan > (t-prev_t):
print("No")
exit()
prev = (x,y)
prev_t = t
print("Yes")
|
p03457 | s998670190 | Accepted | n = int(input())
p = [[0,0,0]]
for i in range(n):
p.append([int(k) for k in input().split()])
res = 'No'
for i in range(1, n+1):
t = p[i][0] - p[i-1][0]
d = p[i][1] - p[i-1][1] + p[i][2] - p[i-1][2]
if t % 2 == d % 2 and t >= d:
continue
break
else:
res = 'Yes'
print(res)
|
p03457 | s499690668 | Accepted | N = int(input())
for _ in range(N):
t, x, y = map(int, input().split())
if x + y > t or (t + x + y)%2 != 0:
print("No")
quit()
print("Yes") |
p03457 | s421144998 | Accepted | N = int(input())
count = 0
T, X, Y = 0, 0, 0
for i in range(N):
t, x, y = 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") |
p03457 | s273421188 | Accepted | n = int(input())
t, x, y = 0, 0, 0
t1, x1, y1 = 0, 0, 0
p = False
for i in range(n):
t, x, y = t1, x1, y1
t1, x1, y1 = map(int, input().split())
s = t1 - t
d = x1 + y1 - x - y
p = x >= 0 and y >= 0 and (abs(s) >= abs(d)) and ((s - d) % 2 == 0)
# print("{},{}".format(s, d))
if p == False:
break
print("Yes" if p else "No")
|
p03457 | s436621821 | Accepted | N = int(input())
tmp_x = 0
tmp_y = 0
tmp_t = 0
for i in range(N):
t, x, y = map(int, input().split())
T = t - tmp_t
d = (x - tmp_x) + (y - tmp_y)
if T < d:
print('No')
break
elif T % 2 == 0 and d % 2 == 1:
print('No')
break
elif T % 2 == 1 and d % 2 == 0:
print('No')
break
else:
print('Yes') |
p03457 | s711346712 | Accepted | n = int(input())
lt = 0
lx = 0
ly = 0
for i in range(n):
t, x, y = [int(i) for i in input().split()]
dt = abs(lt-t)
dx = abs(lx-x)
dy = abs(ly-y)
if not(dt >= dx + dy and dt % 2 == (dx + dy) % 2):
print("No")
exit()
lt = t
lx = x
ly = y
print("Yes") |
p03457 | s963869423 | Accepted | from collections import deque
n = int(input())
txy = deque([list(map(int, input().split())) for _ in range(n)])
tn, xn, yn = 0, 0, 0
while txy:
t, x, y = txy.popleft()
if (abs(xn-x)+abs(yn-y)<=(t-tn)) and (abs(xn-x)+abs(yn-y))%2==(t-tn)%2:
tn, xn, yn = t, x, y
else:
print('No')
exit()
print('Yes') |
p03457 | s384900535 | Accepted | n = int(input())
for i in range(n):
t,x,y = map(int,input().split())
if (x + y) > t or (x + y + t) % 2:
print("No")
exit()
print("Yes") |
p03457 | s410555804 | Accepted | n = int(input())
txy = [list(map(int, input().split())) for _ in range(n)]
tmp = [0, 0, 0]
for t, x, y in txy:
tmp1 = t - tmp[0]
tmp2 = abs(x - tmp[1]) + abs(y - tmp[2])
if tmp1 >= tmp2 and (tmp1 + tmp2) % 2 == 0:
tmp = [t, x, y]
else:
print("No")
exit()
print("Yes") |
p03457 | s373240206 | Accepted | def dist(x,y):
return abs(x[0]-y[0])+abs(x[1]-y[1])
N = int(input())
X = [list(map(int,input().split())) for _ in range(N)]
X.insert(0,[0,0,0])
flag = 0
for i in range(1,N+1):
dx = dist(X[i][1:],X[i-1][1:])
dt = X[i][0]-X[i-1][0]
if dt>=dx and (dt-dx)%2==0:
continue
else:
flag = 1
break
if flag==0:
print("Yes")
else:
print("No") |
p03457 | s513753886 | Accepted | n = int(input())
t_now = 0
x_now = 0
y_now = 0
for _ in range(n):
t,x,y = map(int,input().split())
dist = x+y - (x_now + y_now)
time = t - t_now
if dist<=time and (time-dist)%2 == 0:
t_now,x_now,y_now = t,x,y
continue
else:
print('No')
break
else:
print('Yes') |
p03457 | s446265611 | Accepted | N = int(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] = map(int, input().split())
for i in range(N):
dt = t[i + 1] - t[i]
dst = abs(x[i + 1] - x[i]) + abs(y[i + 1] - y[i])
if (dt < dst) or (dt % 2 != dst % 2):
print("No")
break
else:
print("Yes") |
p03457 | s110520312 | Accepted | n = int(input())
flg = 0
for i in range(n):
t,x,y = map(int, input().split())
if x+y > t:
print ("No")
exit()
if x+y < t:
if (x+y)%2 != t%2:
print ("No")
exit()
print ("Yes") |
p03457 | s884623614 | Accepted | N = int(input())
now_t, now_x, now_y = 0, 0, 0
for _ in range(N):
t, x, y = list(map(int, input().split()))
distance = abs(now_x - x) + abs(now_y - y)
has_time = t - now_t
if (distance - has_time) > 0 or (distance - has_time) % 2:
print("No")
break
now_t, now_x, now_y = t, x, y
else:
print("Yes")
|
p03457 | s169746451 | Accepted | n=int(input())
t=[0]
x=[0]
y=[0]
for i in range(n):
ti,xi,yi=map(int,input().split())
t.append(ti)
x.append(xi)
y.append(yi)
can = True
for i in range(n):
dt=t[i+1]-t[i]
dist=(x[i+1]-x[i])+(y[i+1]-y[i])
if(dt<dist):
can=False
if(dist%2 != dt%2):
can=False
if(can):
print('Yes')
else:
print('No') |
p03457 | s881380884 | Accepted | N=int(input())
T,X,Y=0,0,0
for i in range(N):
t,x,y=map(int,input().split())
if abs(X-x)+abs(Y-y)>t-T or t%2!=(x+y)%2:
print("No")
exit()
T,X,Y=t,x,y
print("Yes")
|
p03457 | s451025000 | Accepted | N = int(input())
T = []
XY = []
def f(x1, y1, x2, y2):
return abs(x1 - x2) + abs(y1 - y2)
cx, cy = 0, 0
ct = 0
for _ in range(N):
t, x, y = map(int, input().split())
d = f(cx, cy, x, y)
# print(f'{ct=}, {t=}, {d=}')
if d > t - ct:
print('No')
exit()
if (t - ct - d) % 2 != 0:
print('No')
exit()
cx, cy = x, y
ct = t
print('Yes')
|
p03457 | s061901587 | Accepted | N=int(input())
t_list=[0]
x_list=[0]
y_list=[0]
ans="Yes"
for i in range(N):
t,x,y=map(int,input().split())
t_list.append(t)
x_list.append(x)
y_list.append(y)
for i in range(N):
T=t_list[i+1]-t_list[i]
X=x_list[i+1]-x_list[i]
Y=y_list[i+1]-y_list[i]
X=abs(X)
Y=abs(Y)
if T<X+Y or T%2!=(X+Y)%2:
ans="No"
print(ans) |
p03457 | s173762689 | Accepted | import sys
readline=sys.stdin.readline
read=sys.stdin.read
n,*abc=map(int,read().split())
abc=[(t,x,y) for t,x,y in zip(*[iter(abc)]*3)]
abc=[(0,0,0)]+abc
diff=[abs(nxt[2]-cur[2])+abs(nxt[1]-cur[1])-nxt[0]+cur[0] for cur,nxt in zip(abc,abc[1:])]
for d in diff:
if d>0 or d%2==1:
print('No')
break
else:
print('Yes') |
p03457 | s176190127 | Accepted | import sys
input = sys.stdin.readline
N = int(input())
pt, px, py = 0, 0, 0
for i in range(N):
t, x, y = map(int, input().split())
d = abs(x - px) + abs(y - py)
# print(t, d)
if t - pt < d or (t - pt - d) % 2 != 0:
print("No")
sys.exit()
pt = t
px = x
py = y
print("Yes")
|
p03457 | s046314696 | Accepted | n = int(input())
grid = [[0,0,0]] + [list(map(int,input().split())) for i in range(n)]
for i in range(1,n+1):
dt = grid[i][0] - grid[i-1][0]
dx = abs(grid[i][1] - grid[i-1][1])
dy = abs(grid[i][2] - grid[i-1][2])
#print(dt,dx,dy)
if dt < dx + dy:
print('No')
break
elif (dt - dx - dy) % 2 == 1:
print('No')
break
else:
print('Yes')
|
p03457 | s199870806 | Accepted | import sys
input = sys.stdin.readline
t, x, y = 0, 0, 0
for _ in range(int(input())):
t1, x1, y1 = map(int, input().split())
a = abs(x1 - x) + abs(y1 - y)
b = t1 - t
if a <= b and a % 2 == b % 2:
t, x, y = t1, x1, y1
else:
print("No")
break
else:
print("Yes") |
p03457 | s713461228 | Accepted | N = int(input())
ans = True
preT,preX,preY = 0,0,0
for i in range(N):
t,x,y = map(int,input().split())
if abs(x-preX)+abs(y-preY) > t - preT:
ans=False
if (-abs(x-preX)-abs(y-preY) + t - preT)%2==1:
ans=False
preX = x
preY = y
preT = t
print("Yes" if ans else "No") |
p03457 | s848846569 | Accepted | n=int(input())
x=[0,0,0]
ans="Yes"
for i in range(n):
y=x
x=list(map(int,input().split()))
if x[0]-y[0]<abs(y[1]-x[1])+abs(y[2]-x[2]) or (x[1]+x[2])%2!=x[0]%2:
ans="No"
break
print(ans)
|
p03457 | s955623183 | Accepted | n = int(input())
p_t, p_x, p_y = 0, 0, 0
available = True
for i in range(n) :
t, x, y = map(int, input().split())
judge = (t - p_t) - ( abs(x - p_x) + abs(y - p_y) )
if judge < 0 or judge % 2 != 0 :
available = False
break
p_t, p_x, p_y = t, x, y
if available :
print('Yes')
else :
print('No')
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.