problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03457 | s307465884 | Wrong Answer | import fileinput
def main():
pos = [0, 0, 0]
lines = [line.rstrip() for line in fileinput.input()]
for line in lines[1:]:
t, x, y = map(lambda x: int(x), line.split())
dest = abs(x - pos[1]) + abs(y - pos[2])
t_d = t - pos[0]
if (dest <= t_d and (dest % 2 == t % 2)):
pos[0], pos[1], pos[2] = t, x, y
next
else:
return print("No")
print("Yes")
main()
|
p03457 | s936963787 | Wrong Answer | N=int(input())
for i in range(N):
t,x,y = map(int,input().split())
if ((x+y+t)%2 == 0) & (abs(x+y)<=t):
continue
else:
print("No")
exit()
print("Yes")
|
p03457 | s206372929 | Wrong Answer | n=int(input())
ans="Yes"
a,b,c=0,0,0
for i in range(n):
t,x,y=map(int,input().split())
if abs(b-x)+abs(y-c)>(t-a):
ans="No"
break
elif (t-a-(abs(b-x)+abs(y-c)))%2!=0:
ans="No"
break
else:
a=t
b=x
y=c
print(ans) |
p03457 | s160869758 | Wrong Answer | N = int(input())
t=[0]*N; x=[0]*N; y=[0]*N
t_diff=0; x_diff=0; y_diff=0
for i in range(N):
t[i], x[i], y[i] = map(int, input().split())
for i in range(N-1):
t_diff += t[i+1]-t[i]
x_diff += x[i+1]-x[i]
y_diff += y[i+1]-y[i]
if t_diff%2 == (x_diff+y_diff)%2 and t[-1] > (x[-1]+y[-1]):
print("Yes")
else:
print("No")
|
p03457 | s049505600 | Wrong Answer | #奇数のとき、xとy足して奇数になる点にしか止まれない。偶数の時も同じ
#xとyの和がステップ数より多いとき、たどり着けない
N = int(input())
#最初にいる位置
T, X, Y = 0, 0, 0
for i in range(N):
t, x, y = map(int, input().split())
wa = (x-X) + (y-Y)
time = t - T
if time < wa:
print('No')
exit()
if (time- wa)%2 == 1:
print('No')
exit()
T, X, Y = t, x, y
print('Yes') |
p03457 | s991441181 | Wrong Answer | 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("Yes")
exit()
print("No") |
p03457 | s379364214 | Wrong Answer | # coding: utf-8
import math
n = int(input())
t = 0
x = 0
y = 0
txy = []
for i in range(n):
ti, xi, yi = list(map(int, input().split()))
txy.append((ti, xi, yi))
for ti, xi, yi in txy:
if abs(xi - x) + abs(yi - y) > abs(ti - t):
print("NO")
exit()
elif (abs(xi - x) + abs(yi - y) - abs(ti - t)) % 2 != 0:
print("NO")
exit()
else:
t = ti
x = xi
y = yi
print("YES")
|
p03457 | s839367263 | Wrong Answer | 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 = 0
x1,y1 = 0,0
for i in range(N):
t2,x2,y2 = X[i]
dt = t2-t1
d = dist((x1,y1),(x2,y2))
if dt>=d and (dt-d)%2==0:continue
flag = 1
break
t2,x2,y2 = t1,x1,y1
if flag==0:
print("Yes")
else:
print("No") |
p03457 | s096121429 | Wrong Answer | N = int(input())
# 初期状態
T = [0]
X = [0]
Y = [0]
for i in range(N):
t, x, y = map(int, input().split())
T.append(t)
X.append(x)
Y.append(y)
# パリティに着目せよ
count = 0
for i in range(N):
distanceSum = abs(X[i+1]-X[i]) + abs(Y[i+1]-Y[i])
T_parity = (T[i+1]-T[i]) % 2
Distance_parity = distanceSum % 2
if (T_parity - Distance_parity) % 2 == 0:
count += 1
if count == N:
print('Yes')
else:
print('No')
|
p03457 | s640165673 | Wrong Answer | import sys
n=int(input())
px=0
py=0
pt=0
for i in range(n):
t,x,y=map(int,input().split())
if abs(x-px)+abs(y-py)>t-pt or abs(x-px)+abs(y-py)%2!=(t-pt)%2:
print('No')
sys.exit()
else:
px=x
py=y
pt=t
print('Yes') |
p03457 | s824021655 | Wrong Answer | 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 | s441467604 | Wrong Answer | import sys
N = int(input())
old_t = 0
old_x = 0
old_y = 0
for i in sys.stdin:
a = list(map(int, i.split(' ')))
t = a[0]
x = a[1]
y = a[2]
d = abs(x - old_x) + abs(y-old_y)
T = t - old_t
if (T % 2 != d % 2):
print('No')
sys.exit(0)
if (T <= d):
print('No')
sys.exit(0)
old_t = t
old_x = x
old_y = y
print('Yes') |
p03457 | s252482168 | Wrong Answer | n = int(input())
data = [input() for _ in range(n)]
for d in data:
t, x, y = [int(i) for i in d.split()]
s = t - x
if s < 0 or s < y:
print('No')
exit()
elif s == y:
break
else:
for c in range(1, s+1):
if y == 2*c -s:
break
else:
print('No')
exit()
print('Yes') |
p03457 | s128237998 | Wrong Answer | n = int(input())
t = 0
x = 0
y = 0
list1 = []
for i in range(n):
t_i, x_i, y_i = map(int, input().split())
list1.append((t, x, y))
for t_i, x_i, y_i in list1:
distance = (x_i - x) + (y_i - y)
if distance > (t_i - t) or (t_i - t)%2 == 1:
print('No')
break
print('Yes') |
p03457 | s764630975 | Wrong Answer | 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-T % 2 == (abs(x-X)+abs(y-Y)) % 2:
count += 1
T, X, Y = t, x, y
print("Yes" if count == N else "No") |
p03457 | s629163688 | Wrong Answer | 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 | s357188193 | Wrong Answer | n = int(input())
data = [input() for _ in range(n)]
for d in data:
t, x, y = [int(i) for i in d.split()]
s = t - x
if s < 0:
print('No')
exit()
elif s == y:
break
else:
# flag = False
for c in range(1, s+1):
if y == 2*c -s:
break
else:
print('No')
exit()
print('Yes') |
p03457 | s781443488 | Wrong Answer | N = int(input())
Flag = True
for _ in range(N):
t,x,y = map(int,input().split())
if t < x + y :
Flag = False
break
elif t % 2 == 1 and (x+y)%2 == 0:
Flag = False
break
elif t % 2 == 0 and (x+y)%2 == 1:
Flag = Flag
break
print('Yes' if Flag else 'No') |
p03457 | s149747154 | Wrong Answer | n = int(input())
t1 = 0
x1 = 0
y1 = 0
count = 0
for _ in range(n):
t,x,y = map(int,input().split())
t = abs(t - t1)
x = abs(x - x1)
y = abs(y - y1)
if x + y <= t and x+y % 2 == t % 2:
t1 = t
x1 = x
y1 = y
count += 1
if count == n:
print("Yes")
else:
print("No")
|
p03457 | s333814992 | Wrong Answer | n = int(input())
location = [list(map(int, input().split())) for j in range(n)]
counter = 0
adj_t, adj_x, adj_y = 0,0,0
for i in range(n):
time = location[i][0] - adj_t
x = location[i][1] - adj_x
y = location[i][2] - adj_y
if abs(x)<= time and abs(y) <=time and abs(x + y) in range(time, 0, -2):
counter += 1
adj_t = time
adj_x = x
adj_y = y
if counter == len(location):
print('Yes')
else:
print('No') |
p03457 | s535389338 | Wrong Answer | N = int(input())
tmp = [tuple(map(int,input().split())) for i in range(N)]
ct = 0
cx = 0
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 | s095917116 | Wrong Answer | N = int(input())
for i in range(N):
t, x, y = list(map(int, input().split()))
flag = 1
for i in range(N):
if(t%2==(x+y)%2 and x+y<t):
continue
else:
flag = 0
break
if(flag):
print("Yes")
else:
print("No")
|
p03457 | s734852446 | Wrong Answer | N=int(input())
TXY=[list(map(int,input().split(' '))) for i in range(N)]
t,x,y=0,0,0
for i,j,k in TXY:
if i-t!=abs(x-j)+abs(y+k):
print('No')
exit()
print('Yes') |
p03457 | s094931402 | Wrong Answer | N = int(input())
Flag = True
x_bef = 0
y_bef = 0
t_bef = 0
for _ in range(N):
t_now,x_now,y_now = map(int,input().split())
t = t_now - t_bef
x = abs(x_now - x_bef)
y = abs(y_now - y_bef)
if t < x + y :
Flag = False
break
elif t % 2 == 1 and (x+y)%2 == 0:
Flag = False
break
elif t % 2 == 0 and (x+y)%2 == 1:
Flag = Flag
break
print('Yes' if Flag else 'No') |
p03457 | s383954630 | Wrong Answer | N = int(input())
prev_t = 0
for i in range(N):
t,x,y = map(int, input().split())
if (x+y) > (t - prev_t) or (x+y)%2 != (t-prev_t)%2:
print('No')
exit()
prev_t = t
print('Yes') |
p03457 | s288713705 | Wrong Answer | n = int(input())
target_point = [list( map(int,input().split())) for i in range(n)]
current_point = [0, 0, 0]
for i in range(n):
dist = abs(target_point[i][1] - current_point[1]) + abs(target_point[i][2]) - current_point[2]
time = target_point[i][0] - current_point[0]
if time >= dist and (time - dist) % 2 == 0:
current_point = target_point[i]
else:
print('No')
exit()
print('Yes')
|
p03457 | s693615680 | Wrong Answer | 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) & (dis-now-y[0])%2==0):
noflag=True
now=y[0]
nplace=y[1:]
print('Yes') if noflag==False else print('No') |
p03457 | s597185962 | Wrong Answer | n = int(input())
info = [list(map(int, input().split())) for i in range(n)]
info = sorted(info)
t = 0
x = 0
y = 0
for t1, x1, y1 in info:
diff = abs(x - x1) + abs(y - y1)
diff_t = abs(t - t1)
if diff_t >= diff and diff % 2 == diff % 2:
continue
else:
print("No")
exit()
print("Yes") |
p03457 | s159732030 | Wrong Answer | prev,pt = (0,0),0
b = True
def f(a,b): return abs(b[0]- a[0]) + abs(b[1] - a[1])
for _ in range(int(raw_input())):
t,x,y = map(int, raw_input().split())
if not((t - pt) == f((x,y), prev)):
b = False
break
prev,pt = (x,y),t
print 'Yes' if b else 'No' |
p03457 | s854976116 | Wrong Answer | rows = int(input())
x = []
for i in range(rows):
x.append(list(map(int, input().split())))
for j in range(rows):
if x[j][0] >= abs(x[j][1]) + abs(x[j][2]):
if x[j][0] % 2 == (abs(x[j][1]) + abs(x[j][2])) % 2:
pass
else:
print("No")
exit()
else:
print("No")
exit()
print("Yes")
|
p03457 | s833571207 | Wrong Answer | n = int(input())
for i 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 | s231264683 | Wrong Answer | N = int(input())
x = 0
y = 0
t = 0
for _ in range(N):
ti, xi, yi = map(int, input().split())
if abs(x-xi) + abs(y-yi) > ti - t or (x == xi and y == yi):
print('No')
exit()
x = xi
y = yi
t = ti
print('Yes')
|
p03457 | s855377782 | Wrong Answer | n = int(input())
time = 0
now = [0, 0]
for i in range(n):
t, x, y = map(int, input().split())
d = abs(x - now[0]) + abs(y - now[1])
if d <= t - time and d % 2 == (t - time) % 2:
continue
else:
print("No")
exit()
else:
print("Yes") |
p03457 | s868881949 | Wrong Answer | ii = input()
ii = int(ii)
la = []
for jj in range(ii):
la.append(input())
flag = 1
for ss in la:
t, x, y = ss.split(" ")
t = int(t)
x = int(x)
y = int(y)
if t < (x + y):
print("No")
flag = 0
break
elif (x + y - t)%2:
print("No")
flag = 0
break
if flag:
print("Yes") |
p03457 | s303032877 | Wrong Answer | def boolean(a,b):
if((abs(a[0] - b[0]) -abs(a[1] - b[1]) - abs(a[2] - b[2])) %2 == 0):
return 0
else:
return 1
N = int(input())
txy=[0 for i in range(N+1)]
txy[0]=[0,0,0]
for i in range(N):
a=list(map(int,input().split()))
txy[i+1]=a
ans = "Yes"
for i in range(1,N + 1):
if(boolean(txy[i-1],txy[i])):
ans = "No"
break
print(ans) |
p03457 | s221447352 | Wrong Answer | N = int(input())
List = [list(map(int, input().split())) for _ in range(N)]
Sorted = sorted(List)
Sorted.insert(0, [0, 0, 0])
for i in range(N):
if abs(Sorted[i+1][1] - Sorted[i][1]) + abs(Sorted[i+1][2] - Sorted[i][2]) > Sorted[i+1][0] - Sorted[i][0]:
print("No")
break
else:
print("Yes") |
p03457 | s745535647 | Wrong Answer | def dist(s1,s2):
return abs(s1[1]-s2[1]) + abs(s1[2]-s2[2])
N=int(input())
now = (0,0,0)
for i in range(N):
next_ = list(map(int,input().split()))
if dist(now,next_)<=next_[0]-now[0] and dist(now,next_) % 2 == (next_[0]-now[0])%2:
continue
else:
print('No')
exit()
print('Yes') |
p03457 | s343305215 | Wrong Answer | n = int(input())
for i in range(n):
t,x,y = map(int,input().split())
if (x+y) > t and (x+y)%2==t%2:
print("No")
exit()
print("Yes") |
p03457 | s752449043 | Wrong Answer | n = int(input())
d = [list(map(int, input().split())) for i in range(n)]
t, x, y = 0, 0, 0
flag = True
for ti, xi, yi in d:
if ti > x + y:
if (ti - t) % 2 != (abs(xi - x) + abs(yi - y)) % 2:
flag = False
break
t = ti
x = xi
y = yi
else:
flag = False
break
print("Yes" if flag else "No") |
p03457 | s031673266 | Wrong Answer | A = [[0,0]]
N = int(input())
for _ in range(N):
t,x,y = map(int,input().split())
A.append([t,x+y])
for i in range(1,N+1):
if A[i][0]-A[i-1][0] >= A[i][1]-A[i-1][1] and (A[i][0]-A[i-1][0])%2 == (A[i][1]-A[i-1][1])%2:
continue
else:
print('No')
exit()
print('Yes')
|
p03457 | s616532931 | Wrong Answer | N = int(input())
A = [[int(x) for x in input().split()]for i in range(N)]
T = 0 ####現在時刻
place = (0,0) ####現在地
for i in range(N):
if ((A[i][0]-T) + abs(A[i][1]-place[0]) + abs(A[i][2]-place[1]))%2 == 0:
T = A[i][0]
place = (A[i][1], A[i][2])
elif ((A[i][0]-T) + abs(A[i][1]-place[0]) + abs(A[i][2]-place[1]))%2 == 1:
print("No")
exit()
print("Yes")
|
p03457 | s501545369 | Wrong Answer | n = int(input())
posdata = [list(map(int,input().split())) for i in range(n)]
nowpos = [0,0,0]
for i in range(n):
diff = posdata[i][1] - nowpos[1] + posdata[i][2] - nowpos[2]
l_parity = diff % 2
t_parity = posdata[i][0] % 2
if diff < (posdata[i-1][0] - posdata[i][0]) and l_parity != t_parity:
print("No")
exit()
print("Yes") |
p03457 | s010861403 | Wrong Answer | n = int(input())
tl = []
dl = []
flag = 0
for i in range(n):
t, x, y = (int(x) for x in input().split())
tl.append(t)
dl.append((x, y))
for num in range(n):
if tl[num] >= sum(dl[num]) and tl[num]%2 == sum(dl[num])%2:
pass
else:
flag = 1
if flag == 0:
print("Yes")
else:
print("No") |
p03457 | s645650728 | Wrong Answer | # ABC086 C Traveling
n = int(input())
t, x, y = 0, 0, 0
flag = True
for i in range(n):
_t,_x,_y = map(int, input().split())
_d = abs(x - _x) + abs(y - _y)
_dt = abs(t - _t)
if _d > _dt or ((_d - _dt)%2) == 1:
flag = False
t,x,y = _t,_x,_y
if flag:
print("YES")
else:
print("NO") |
p03457 | s988145779 | Wrong Answer | T, X, Y = 0, 0, 0
cnt = 0
for n in range(int(input())):
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 | s441463324 | Wrong Answer | n = int(input())
txy = [list(map(int,input().split()))for _ in range(n)]
ok = True
time = 0
nx = 0
ny = 0
for i in range(n):
t = txy[i][0]
x = txy[i][1]
y = txy[i][2]
dist = abs(x-nx)+abs(y-ny)
if not(t - time >= dist and (t- time )%2 == dist%2):
ok = False
break
time+=t
nx = x
ny = y
if ok:print('Yes')
else:print('No')
|
p03457 | s404204842 | Wrong Answer | N = int(input())
P = [[0,0,0]]
for i in range(N):
t,x,y = map(int,input().split())
P.append([t,x,y])
judge = False
for i in range(1,N+1):
dt = P[i][0] - P[i-1][0]
dist = abs(P[i][1] - P[i-1][1]) + abs(P[i][2] - P[i-1][2])
if (dt % 2 == 0 and dist % 2 == 0 and dist <= dt) or (dt % 2 == 1 and dist % 2 == 1 and dist <= dt):
judge = True
if judge:
print("Yes")
else:
print("No")
|
p03457 | s167297220 | Wrong Answer | N = int(input())
T = [[0,0,0]]+[map(int, input().split()) for _ in range(N)]
flag = 'Yes'
i = 0
while flag=='Yes' and i<len(T)-2:
a = T[i]
b = T[i]
i += 1
print(flag)
|
p03457 | s663376158 | Wrong Answer | N = int(input())
plan = [list(map(int, input().split())) for i in range(N)]
f = True
for i in range(N-1):
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 or dist == 0:
f = False
break
print('Yes' if f else 'No') |
p03457 | s468786197 | Wrong Answer | N = int(input())
# 初期状態
T = []
X = []
Y = []
for i in range(N):
t, x, y = map(int, input().split())
T.append(t)
X.append(x)
Y.append(y)
# パリティに着目せよ
count=0
for i in range(N):
if x + y <= t and t % 2 == (x+y)%2:
count += 1
if count == N:
print('Yes')
else:
print('No') |
p03457 | s429727517 | Wrong Answer | N = int(input())
T = [[0,0,0]]+[map(int, input().split()) for _ in range(N)]
flag = 'Yes'
i = 0
while flag=='Yes' and i<len(T)-1:
# t1,x1,y1 = T[i]
# t2,x2,y2 = T[i+1]
# dis = abs(x2-x1)+abs(y2-y1)
# _t = t2-t1
# if dis > _t or _t%2 != dis%2:
# flag = 'No'
i += 1
print(flag)
|
p03457 | s668222962 | Wrong Answer | n = int(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 - dist) % 2:
print("No")
exit()
x, y, t = dx, dy, dt
print("Yes") |
p03457 | s287237865 | Wrong Answer | 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())
lim_t=t[i+1]-t[i]
lim_x=x[i+1]-x[i]
lim_y=y[i+1]-y[i]
if lim_x+lim_y>lim_t or (lim_t-lim_x-lim_y)%2==1:
print('No')
exit()
print('Yes') |
p03457 | s988175693 | Wrong Answer | N = int(input())
pos = [0, 0, 0]
ans = 'Yes'
for i in range(N):
t, x, y = map(int, input().split())
if t-pos[0] >= abs(x-pos[1]) + abs(y-pos[2]):
if ((t-pos[0]) % 2 == 0) and ((abs(x-pos[1]) + abs(y-pos[2])) % 2 == 0):
pass
elif ((t-pos[0]) % 2 == 1) and ((abs(x-pos[1]) + abs(y-pos[2])) % 2 == 1):
pass
else:
ans = 'No'
break
else:
ans = 'No'
break
print(ans) |
p03457 | s121828214 | Wrong Answer | # coding: utf-8
import sys
N = int(input())
t = [0]
x = [0]
y = [0]
for i in range(N):
txy = [int(x) for x in input().split()]
t.append(txy[0])
x.append(txy[1])
y.append(txy[2])
for i in range(N - 1):
d = abs(x[i + 1] - x[i]) + abs(y[i + 1] - y[i])
dt = t[i + 1] - t[i]
if dt < d or (dt - d) % 2 == 1:
print("No")
sys.exit()
print("Yes") |
p03457 | s852021631 | Wrong Answer | N = int(input())
ti_xi_yi = [map(int, input().split(' ')) for n in range(N)]
for ti, xi, yi in ti_xi_yi:
if not (abs(xi+yi) <= abs(ti) and abs(xi)+abs(yi) <= abs(ti) and abs(abs(xi)-abs(yi)) < abs(ti) and ti%2 == (xi+yi)%2):
print('No')
exit()
print('Yes') |
p03457 | s139657781 | Wrong Answer | # ABC86 C - Traveling
N = int(input())
ans = "Yes"
t, x, y = 0, 0, 0
for i in range(N):
ti, xi, yi = map(int, input().split())
dt, dx, dy = ti - t, abs(xi - x), abs(yi - y)
if (dx + dy - dt) % 2 == 0:
t, x, y = ti, xi, yi
else:
ans = "No"
break
print(ans) |
p03457 | s833054704 | Wrong Answer | N = int(input())
plan = []
for i in range(N):
plan += [[int(n) for n in input().split(' ')]]
ret = "YES"
t0 , x0, y0 = 0, 0, 0
for t, x, y in plan:
dt = t-t0
dx = x-x0
dy = y-y0
result = dt - (dx+dy)
if (result<0) | (result%2!=0):
ret = "NO"
break
t0, x0, y0 = t, x, y
print(ret)
|
p03457 | s635026493 | Wrong Answer | def boolean(a,b):
if(abs(a[0] - b[0]) == abs(a[1] - b[1]) + abs(a[2] - b[2])):
return 0
else:
return 1
N = int(input())
txy=[0 for i in range(N+1)]
txy[0]=[0,0,0]
for i in range(N):
a=list(map(int,input().split()))
txy[i+1]=a
ans = "Yes"
for i in range(1,N + 1):
if(boolean(txy[i-1],txy[i])):
ans = "No"
break
print(ans) |
p03457 | s065651258 | Wrong Answer | n = int(input())
d = [list(map(int, input().split())) for i in range(n)]
t, x, y = 0, 0, 0
flag = True
for ti, xi, yi in d:
if ti >= x + y:
if (ti - t) % 2 != (abs(xi - x) + abs(yi - y)) % 2:
flag = False
break
t = ti
x = xi
y = yi
else:
flag = False
break
print("Yes" if flag else "No") |
p03457 | s112197341 | Wrong Answer | n = int(input())
prev_t = 0
for i in range(n):
t, x, y=map(int, input().split())
if (x + y) > (t - prev_t) or (x + y + (t - prev_t)) % 2:
print("No")
exit()
prev_t = t
print("Yes") |
p03457 | s978487130 | Wrong Answer | c = input()
data = []
for s in range(0,int(c)):
data.append(list(map(int, input().split())) )
nowtime = 0
nowx = 0
nowy = 0
nexttime = 0
nextx = 0
nexty = 0
costtime = 0
diffx = 0
diffy = 0
for s in range(0, len(data)):
nexttime = data[s][0]
nextx = data[s][1]
nexty = data[s][2]
costtime = nexttime - nowtime
diffx = abs(nextx - nowx)
diffy = abs(nexty - nowy)
if ( (nexttime < nextx+nexty) or ((((nextx + nexty) ) % 2) == (nexttime % 2) ) ):
print("NO")
exit()
nowtime = nexttime
nowx = nextx
nowy = nexty
print("YES")
|
p03457 | s163831521 | Wrong Answer | N = int(input())
t = [0] * N
x = [0] * N
y = [0] * N
for i in range(N):
t[i], x[i], y[i] = map(int, input().split())
for n in range(N):
if n == 0:
if t[n] < abs(x[n] - 0) + abs(y[n] - 0) or (x[n] + y[n]) % 2 != t[n] % 2:
print('No')
exit()
if t[n] < abs(x[n] - x[n - 1]) + abs(y[n] - y[n - 1]) or (x[n] + y[n]) % 2 != t[n] % 2:
print('No')
exit()
print('Yes')
|
p03457 | s210209923 | Wrong Answer | n = int(input())
location = [list(map(int, input().split())) for j in range(n)]
counter = 0
adj_t, adj_x, adj_y = 0,0,0
for i in range(n):
time = location[i][0] - adj_t
x = location[i][1] - adj_x
y = location[i][2] - adj_y
dst = abs(x) + abs(y)
if dst <=time and abs(x + y) in range(time, 0, -2):
counter += 1
adj_t = time
adj_x = x
adj_y = y
if counter == len(location):
print('Yes')
else:
print('No')
|
p03457 | s282923473 | Wrong Answer | #-*- coding: utf-8 -*-
N=int(input())
import numpy as np
t=np.arange(N)
x=np.arange(N)
y=np.arange(N)
for n in range(N):
t[n], x[n], y[n] = map(int, input().split())
kekka=[]
for i in range(N):
kekka.append(t[i]>=x[i]+y[i] and t[i]%2==(x[i]+y[i])%2)
if all(kekka):
print("Yes")
else:
print("No") |
p03457 | s343624671 | Wrong Answer | n = int(input())
txy = [list(map(int, input().split())) for _ in range(n)]
X,Y = 0,0
ans = "Yes"
for t,x,y in txy:
T = abs(x-X) + abs(y-Y)
if T == t: continue
else:
t -= T
if t > 0 and t%2==0: continue
else: ans = "No"
print(ans) |
p03457 | s851865643 | Wrong Answer | n = int(input())
for _ in range(n):
t, x, y = map(int, input().split())
if x + y > t:
status = "No"
break
elif (x+y)%2 != t%2:
status = "No"
break
else:
status = "Yes"
print(status) |
p03457 | s178981340 | Wrong Answer | n = int(input())
prev_t = 0
for i in range(n):
t, x, y = map(int, input().split())
if (x + y) > (t - prev_t) or (x + y + (t - prev_t)) % 2:
print('No')
exit()
prev_t = t
print('Yes') |
p03457 | s365383219 | Wrong Answer | N = int(input())
t = [0]
x = [0]
y = [0]
for _ in range(N):
a, b, c = list(map(int, input().split()))
t.append(a)
x.append(b)
y.append(c)
# print(f"t:{t}\nx:{x}\ny:{y}")
for index in range(1, N + 1):
distance = (x[index] - x[index - 1]) + (y[index] - y[index - 1])
if (t[index] - t[index - 1]) % 2 != distance % 2:
print("No")
break
else:
print("Yes") |
p03457 | s241399937 | Wrong Answer | 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
for i in range(1,N):
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 | s554003162 | Wrong Answer | n=int(input())
num,a,b=0,0,0
for i in range(n):
t,x,y=map(int,input().split())
num,a,b=abs(t-num),abs(x-a),abs(y-b)
su=a+b
if num<su:
ans="No"
break
elif su==0 and num%2==0:
ans="Yes"
break
elif su==0 and num%2!=0:
ans="No"
break
else:
if num%2==0 and su%2==0:
ans="Yes"
elif num%2!=0 and su%2!=0:
ans="Yes"
else:
ans="No"
print(ans)
|
p03457 | s572020059 | Wrong Answer | n=int(input())
x,y=0,0
t=0
for i in range(n):
X,Y,T=map(int,input().split())
if((T-t)>=(abs(X-x)+abs(Y-y)) and abs(t-T)%2==(abs(x-X)+abs(Y-y))%2):
x=X
y=Y
t=T
else:
print("No")
exit()
print("Yes") |
p03457 | s244674605 | Wrong Answer | N=int(input())
a=[list(map(int,input().split())) for _ in range(N)]
dp=[[0,0] for _ in range(N+1)]
dp[0][0]=1
for i in range(1,N+1):
t=a[i-1][0]-dp[i-1][1]
x=a[i-1][1]
y=a[i-1][2]
if t>=x+y and t%2==(x+y+dp[i-1][1])%2 and dp[i-1][0]==1:
dp[i][0]=1
dp[i][1]=a[i-1][0]
if dp[N][0]==1:print("Yes")
else:print("No") |
p03457 | s949773396 | Wrong Answer | num_list=int(input())
a=[1,0,0]
for i in range(num_list):
b=[int(x) for x in input().split()]
if (abs(b[1]-a[1])+abs(b[2]-a[2]))<=(b[0]-a[0]) and (abs(b[1]-a[1])+abs(b[2]-a[2])) != 0:
if i == num_list-1:
print("Yes")
break
a=b
else:
print("No")
break |
p03457 | s797210813 | Wrong Answer | n = int(input())
posdata = [list(map(int,input().split())) for i in range(n)]
nowpos = [0,0,0]
for i in range(n):
diff = posdata[i][1] - nowpos[1] + posdata[i][2] - nowpos[2]
l_parity = diff % 2
t_parity = (posdata[i][0] - nowpos[0]) % 2
if diff > (nowpos[0] - posdata[i][0]) and l_parity == t_parity:
nowpos = posdata[i]
else:
print("No")
exit()
print(nowpos)
print("Yes") |
p03457 | s042519335 | Wrong Answer | N=int(input())
for i in range(N):
t,x,y = map(int,input().split())
if ((x+y+t)%2 == 0) & (abs(x+y)<=t):
continue
else:
print("No")
exit()
print("Yes")
|
p03457 | s800915563 | Wrong Answer | n = int(input())
t=0
x=0
y=0
ans ="Yes"
for i in range(n):
tt,xx,yy = map(int,input().split())
dif = abs(x-xx)
dif +=abs(y-yy)
if dif>(tt-t) or dif ==(tt-t+1)%2:
ans = "No"
break;
t=tt
x=xx
y=yy
print(ans) |
p03457 | s115324700 | Wrong Answer | n = int(input())
x_now, y_now, t_now = 0, 0, 0
for i in range(n):
t, x, y = map(int, input().split())
distance = (t -t_now) - abs(x-x_now) - abs(y-y_now)
if distance > 0 and distance % 2 == 0:
x_now,y_now,t_now = x,y,t
else:
print('No')
exit()
print('Yes')
|
p03457 | s568205404 | Wrong Answer | 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 | s875484372 | Wrong Answer | N = int(input())
time_coor = []
for n in range(N):
time_coor.append(list(map(int, input().split())))
can = True
for n in range(N-1):
dist = abs(time_coor[n+1][1]-time_coor[n][1]) + \
abs(time_coor[n+1][2]-time_coor[n][2])
if dist>time_coor[n][0]:
can = False
break
elif dist%2==(time_coor[n+1][0]-time_coor[n][0])%2:
continue
if can==True:
print("Yes")
else:
print("No") |
p03457 | s885572316 | Wrong Answer | import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np
from functools import reduce
rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7
n = ri()
for li in [rl() for _ in range(n)]:
t, a, b = li
if t < a+b or (t - a - b) & 1:
print('No')
exit()
print('Yes')
|
p03457 | s653043761 | Wrong Answer | n = int(input())
t = [0]
x = []
y = []
for _ in [0]*n:
_t, _x, _y = map(int, input().split())
t += [_t]
x += [_x]
y += [_y]
nx = ny = 0
for i in range(n):
nt = t[i+1] - t[i]
d = x[i]-nx + y[i]-ny
if not (nt%2 == d%2 and nt>=d):
print('No')
break
nx = x[i]
ny = y[i]
else:
print('Yes') |
p03457 | s950797102 | Wrong Answer | import fileinput
def main():
pos = [0, 0]
lines = [line.rstrip() for line in fileinput.input()]
for line in lines[1:]:
t, x, y = map(lambda x: int(x), line.split())
dest = x + y
src = sum(pos)
if (dest - src > t):
return print("No")
else:
arrivable = True if not abs(dest - src - t) % 2 else False
if (arrivable):
pos[0], pos[1] = x, y
next
else:
return print("No")
print("Yes")
main()
|
p03457 | s282462015 | Wrong Answer | n = int(input())
def check(t, x, y):
for i in range(t + 1):
for j in range(t + 1 - i):
for k in range(t + 1 - i - j):
if (i - j == x) and (k - (t - i - j - k)) == y:
return True
return False
if all(check(l[0], l[1], l[2]) for l in [list(map(int, input().split())) for i in range(n)]):
print('Yes')
else:
print('No') |
p03457 | s350667122 | Wrong Answer | # -*- coding: utf-8 -*-
N = int(input())
t_prev = 0
for n in range(N):
t, x, y = map(int, input().split())
if (t - t_prev) >= (x + y) and (t + x + y) % 2 == 0:
t_prev = t
else:
print('No')
break
else:
print('Yes') |
p03457 | s817961328 | Wrong Answer | N = int(input())
a = [list(map(int,input().split())) for i in range(N)]
for i in range(0,N-1):
b = (a[i+1][0]-a[i][0])
c = (abs(a[i+1][1]-a[i][1])+abs(a[i+1][2]-a[i][2]))
if b>=c:
if b%2==0 and c%2==0:
print("Yes")
elif b%2==1 and c%2==1:
print("Yes")
else:
print("No")
else:
print("No") |
p03457 | s589473012 | Wrong Answer | n = int(input())
lst = [list(map(int, input().split())) for _ in range(n)]
ans = 'No'
for line in lst:
t, x, y = line
if t < x + y:
break
if t % 2 == 0 and (x + y) % 2 != 0:
break
if t % 2 != 0 and (x + y) % 2 == 0:
break
print(ans) |
p03457 | s537513651 | Wrong Answer | N = int(input())
t=[0]*(N+1); x=[0]*(N+1); y=[0]*(N+1)
t_diff=0; x_diff=0; y_diff=0
for i in range(1,N+1):
t[i], x[i], y[i] = map(int, input().split())
# print(t, x, y)
for i in range(N):
t_diff = t[i+1]-t[i]
x_diff = x[i+1]-x[i]
y_diff = y[i+1]-y[i]
if t_diff%2 != (x_diff+y_diff)%2 or t[-1] < (x[-1]+y[-1]):
print("No")
exit()
print("Yes")
|
p03457 | s405360974 | Wrong Answer | n = int(input())
pret = 0
prex = 0
prey = 0
flag = True
for i in range(n):
t,x,y = 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 % 4 == 0:
pret = t
prex = x
prey = y
else:
flag = False
if flag:
print('Yes')
else:
print('No')
|
p03457 | s819685675 | Wrong Answer | n = int(input())
for i in range(n):
t,x,y = map(int,input().split())
if (x + y) > t :
print("No")
exit()
print("Yes") |
p03457 | s516243674 | Wrong Answer | N = int(input())
t, x, y = 0, 0, 0
for i in range(N):
t_i, x_i, y_i = map(int, input().split())
T = t_i-t
D = (x_i-x) + (y_i-y)
if T % 2 != D % 2 or D > T:
print("No")
exit()
else:
t = t_i
x = x_i
y = y_i
print("Yes") |
p03457 | s654634492 | Wrong Answer | n = int(input())
count=0
temp=0
for i in range(0,n):
t,x,y = map(int, input().split())
if (t-temp)>=x+y and (x+y-(t-temp))%2==0:
count=count+1
temp=t
if count==n:
print("Yes")
else:
print("No") |
p03457 | s765444709 | Wrong Answer | N = int(input())
time_coor = []
for n in range(N):
time_coor.append(list(map(int, input().split())))
can = True
for n in range(N-1):
if (abs(time_coor[n+1][1])-abs(time_coor[n][1]) + abs(time_coor[n+1][2])-abs(time_coor[n][2]))!=1:
can = False
break
else:
continue
if can==True:
print("Yes")
else:
print("No") |
p03457 | s862180329 | Wrong Answer | n = int(input())
txy = [list(map(int, input().split())) for i in range(n)]
for i in txy:
if i[0] % 2 != (i[1] + i[2]) % 2:
print("No")
exit()
print("Yes") |
p03457 | s762532465 | Wrong Answer | N = int(input())
X = list([int(j) for j in input().split()] for i in range(N))
X.insert(0, [0, 0, 0])
c = 0
while c <= N-1:
R = (X[c+1][0]-X[c][0])-(X[c+1][1]+X[c+1][2]-X[c][1]-X[c][2])
if R<0 or R%2 != 0:
print("No")
break
c += 1
else:
print("Yes") |
p03457 | s266276710 | Wrong Answer | 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 (xi-x+yi-y <= ti-t or (ti-t)%2 == (xi-x+yi-y)%2):
print('No')
exit()
else:
t = ti
x = xi
y = yi
print('Yes')
|
p03457 | s517666053 | Wrong Answer | N = int(input())
t=[0]*(N+1); x=[0]*(N+1); y=[0]*(N+1)
t_diff=0; x_diff=0; y_diff=0
for i in range(1,N+1):
t[i], x[i], y[i] = map(int, input().split())
for i in range(N):
t_diff = t[i+1]-t[i]
x_diff = abs(x[i+1]-x[i])
y_diff = abs(y[i+1]-y[i])
if t_diff%2 != (x_diff+y_diff)%2 or t[i+1] < (x[i+1]+y[i+1]):
print("No")
exit()
print("Yes")
|
p03457 | s821014006 | Wrong Answer | N = int(input())
t0, x0, y0 = 0, 0, 0
flag=True
for i in range(N):
t1,x1,y1 = [int(j) for j in input().split()]
dt = t1 - t0
dist = abs(x0-x1) + abs(y0-y1)
if dist > dt:
print('No')
flag=False
elif (dist%2==0 and dt%2==0) or (dist%2==1 and dt%2==1):
t0, x0, y0 = t1, x1, y1
else:
print('No')
flag=False
if flag:
print('Yes') |
p03457 | s727639277 | Wrong Answer | N = int(input())
TXY = [list(map(int, input().split())) for _ in range(N)]
pre_t, pre_x, pre_y = 0, 0, 0
for t, x, y in TXY:
diff_t = t - pre_t
diff_pos = abs(x-pre_x) + abs(y-pre_y)
if diff_t > diff_pos or diff_pos-diff_t % 2 == 1:
print('No')
exit()
else:
pre_t, pre_x, pre_y = t, x, y
print('Yes') |
p03457 | s362881909 | Wrong Answer | n = int(input())
target_point = [list( map(int,input().split())) for i in range(n)]
current_point = [0, 0, 0]
for i in range(n):
dist = abs(target_point[i][1] - current_point[1]) + abs(target_point[i][2]) - current_point[2]
time = target_point[i][0] - current_point[0]
if (dist == time) or ((time > dist) and (time - dist) % 2 == 0):
current_point = target_point[i]
else:
print('No')
exit()
print('Yes')
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.