problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03457 | s578920606 | Wrong Answer | print("Yes") |
p03457 | s086121171 | 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 - x - y - pret + prex + 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 | s181205928 | 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("No")
exit()
print("Yes") |
p03457 | s540748020 | 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%2:
print('No')
exit()
prev_t = t
print('Yes') |
p03457 | s638415153 | 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("No")
exit()
print("Yes") |
p03457 | s926095369 | Wrong Answer | N = int(input())
L = [list(map(int, input().split())) for i in range(N)]
l = [[0, 0, 0]]
l.extend(L)
flag = True
for c in range(1, len(L)):
dt = l[c][0] - l[c-1][0]
dist = abs(l[c][1] - l[c-1][1]) + abs(l[c][2] - l[c-1][2])
if dist > dt or dist % 2 != dt % 2:
flag = False
print("YES" if flag else "NO")
|
p03457 | s851334744 | Wrong Answer | n = int(input())
ans = 'Yes'
pre_t = 0
pre_d = 0
for _ in range(n):
a,b,c = map(int,input().split())
t = a - pre_t
d = abs((b+c) - pre_d)
if (t%2) == 0 and (d%2) == 0 and t >= d:
continue
elif (t%2) != 0 and (d%2) != 0 and t >= d:
continue
else:
ans = 'No'
break
pre_t = t
pre_d = d
print(ans) |
p03457 | s171373421 | Wrong Answer | n=int(input())
for i in range(n):
z,x,y=map(int, input().split())
dist=abs(z+1-z)
dt=abs(x+1-x)+abs(y+1-y)
if dist<z or (dist%2) != (dt%2):
print("No")
exit()
print("Yes") |
p03457 | s921819880 | Wrong Answer | import sys
n = int(input())
pos = [list(map(int,input().split())) for p in range(n)]
for i in range(len(pos)-1):
diff = pos[i+1][0]-pos[i][0]
num = abs(pos[i][1]-pos[i+1][1]) + abs(pos[i][2]-pos[i+1][2])
if diff%2 == num%2 and num <= diff ** (diff%2) :
pass
else:
print("No")
sys.exit()
print("Yes")
|
p03457 | s573362867 | Wrong Answer | N = int(input())
t, n = [], []
for i in range(N):
temp = list(map(int, input().split()))
t.append(temp[0])
n.append(abs(temp[1]) + abs(temp[2]))
nowTime, nowPoint = 0, 0
f = True
for i in range(N):
time, point = t[i]-nowTime, n[i]-nowPoint
if time%2 != point%2:
f = False
break
if time < point:
f = False
break
nowTime, nowPoint = t[i], n[i]
if f:
print('Yes')
else:
print('No') |
p03457 | s759471653 | Wrong Answer | n = int(input())
ans = True
for i in range(n):
t,x,y = map(int,input().split())
if (x+y)%2 != t%2:
ans = False
if ans:
print("Yes")
else:
print("No") |
p03457 | s022262598 | Wrong Answer | n = int(input())
curx, cury = 0, 0
ans = 'Yes'
prev_t = 0
for _ in range(n):
t, x, y = map(int, input().split())
d = abs(x - curx) + abs(y - cury)
if d > (t - prev_t) or (t - prev_t) % 2 != d % 2:
ans = 'No'
break
prev_t = t
print(ans)
|
p03457 | s803901451 | Wrong Answer | ans = "Yes"
N = int(input())
t = []
x = []
y = []
for i in range(N):
tmp = input().split(" ")
t.append(int(tmp[0]))
x.append(int(tmp[1]))
y.append(int(tmp[2]))
for j in range(N-1):
dt = t[j+1] - t[j]
dx = abs(x[j+1] - x[j])
dy = abs(y[j+1] - y[j])
if dt >= dx + dy and dt % 2 == (dx + dy) % 2:
continue
else:
ans = "No"
break
print(ans) |
p03457 | s715208864 | Wrong Answer | N = int(input())
now_t = 0
now_x = 0
now_y = 0
flag = 0
for i in range(N):
t,x,y = map(int,input().split())
if abs(x-now_x)+abs(y-now_y) %2 ==(now_t-t)%2:
now_t = t
now_x = x
now_y = y
else:
flag += 1
break
if flag == 0:
print("Yes")
else:
print("No") |
p03457 | s963038246 | 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("NO")
exit()
print("YES") |
p03457 | s185963610 | 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 abs(t) < abs(a) + abs(b) or (t - a - b) & 1:
print('No')
exit()
print('Yes')
|
p03457 | s102361298 | 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:
f = False
print('Yes' if f else 'No')
|
p03457 | s270948550 | Wrong Answer | N=int(input())
t1 = 0
x1 = 0
y1 = 0
for i in range(N):
t2,x2,y2=map(int,input().split())
d = abs(x1 - x2) + abs(y1 - y2)
dt = t2 - t1
if d > dt:
print('No')
exit()
if dt%2!=0 and d==0:
print('No')
exit()
if dt%2==0 and d==1:
print('No')
exit()
t1,x1,y1=t2,x2,y2
print('Yes')
|
p03457 | s524305130 | Wrong Answer | N=int(input())
pre_t=0
pre_x=0
pre_y=0
flg=0
for i in range(N-1):
t,x,y=map(int,input().split())
t_tmp = t
t=t-pre_t
dist=abs(x-pre_x) + abs(y - pre_y)
pre_t=t_tmp
pre_x=x
pre_y=y
if(dist > t ):
flg=1
break
if((dist)%2 != t%2):
flg=1
break
if(flg == 0):
print("Yes")
else:
print("No") |
p03457 | s137100243 | Wrong Answer | N = int(input())
x = [list(map(int, input().split())) for i in range(N)]
cnt = 0
sum = 0
flag = 0
for i in range(N):
if i == 0:
cnt = x[i][0]
sum = x[i][1]
else:
cnt = x[i][0] - x[i-1][0]
sum = abs(x[i][1]-x[i-1][1]) + abs(x[i][2]-x[i-1][2])
if cnt < sum or cnt % 2 != sum % 2:
flag = 1
break
if flag == 0:
print("Yes")
else:
print("No")
|
p03457 | s278014798 | 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 | s129588948 | 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!=0:
print("No")
exit()
prev_t = t
print("Yes") |
p03457 | s890239002 | Wrong Answer | n=int(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)>t1+t2:
print('No')
exit()
if (abs(x1-x2)+abs(y1-y2))%2!=(t1+t2)%2:
print('No')
exit()
print('Yes') |
p03457 | s284795957 | Wrong Answer | N = int(input())
[t, x, y] = [[],[],[]]
for i in range(N):
input_line = list(map(int, input().split()))
t.append(input_line[0])
x.append(input_line[1])
y.append(input_line[2])
can = True
for i in range(0, N-1):
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 == True:
print("Yes")
else:
print("No") |
p03457 | s264831549 | Wrong Answer | n = int(input())
t_ = 0
xy_ = [0,0]
for _ in range(n):
t, *xy = map(int, input().split())
ta = t - t_
xya = [abs(xy[0]-xy_[0]), abs(xy[1]-xy_[1])]
if sum(xya) > ta or (ta - sum(xya))%2 != 0:
print("No")
break
else:
print("Yes") |
p03457 | s173220574 | 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("No")
exit()
print("Yes") |
p03457 | s680519849 | Wrong Answer | N, *T = map(int, open(0).read().split())
d_t, d_x, d_y = 0, 0, 0
for t, x, y in zip(T[::3], T[1::3], T[2::3]):
dist = abs(d_x - x) + abs(d_y - y)
if (t - d_t - dist) % 2:
print("No")
break
d_t, d_x, d_y = t, x, y
else:
print("Yes")
|
p03457 | s476710304 | 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 | s524497184 | Wrong Answer | import numpy as np
N = int(input())
txy = [[0,0,0]]
for i in range(N):
txy.append(list(map(int,input().split())))
out='Yes'
for i in range(1,N+1):
x = np.array(txy[i])
y = np.array(txy[i-1])
mv = x-y
# print(mv)
dam = mv[0] - (mv[1] + mv[2])
if dam%2==1 or dam<0:
out='No'
print(out)
|
p03457 | s147664033 | 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 (xi+yi <= abs(ti) and abs(xi)+abs(yi) <= abs(ti) and ti%2 == (xi+yi)%2):
print('No')
exit()
print('Yes') |
p03457 | s138557888 | Wrong Answer | N=int(input())
x=y=t=0
flag=True
for i in range(N):
ti, xi, yi = map(int, input().split())
dist = abs(xi-x)+abs(yi-y)
dt = ti-t
x, y = xi, yi
if dist<=dt and dist%2==dt%2:
continue
else:
flag=False
print("Yes") if flag else print("No") |
p03457 | s648096468 | Wrong Answer | n = int(input())
x0, y0 = 0, 0
for _ in range(n):
t, x, y = map(int, input().split())
if abs(x-x0) + abs(y-y0) > t or (x+y)%2 != t%2:
status = "No"
break
else:
status = "Yes"
x0, y0 = x, y
print(status) |
p03457 | s137549553 | Wrong Answer | N = int(input())
bt, bx, by = 0, 0, 0
flg = True
for i in range(N):
t, x, y = map(int, input().split())
dist = abs(x-bx)+abs(y-by)
if t<bt:
flg = False
break
time = t-bt
if time>=dist and (time-dist)%2==0:
bt, bx, xy = t, x, y
else:
flg = False
break
if flg:
print('Yes')
else:
print('No') |
p03457 | s106345868 | Wrong Answer | n = int(input())
res = 0
for i in range(n):
t, x, y = map(int, input().split())
if x+y<=t-res and t%2==(x+y)%2:
res = res+t-x-y
else:
print('No')
exit()
print('Yes') |
p03457 | s999682018 | Wrong Answer | 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 | s342936068 | 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 t[n] < abs(x[n]) + abs(y[n]) or (x[n] + y[n]) % 2 != t[n] % 2:
print('No')
exit()
print('Yes')
|
p03457 | s349719836 | Wrong Answer | n=int(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
print(ans) |
p03457 | s585773190 | Wrong Answer | N=int(input())
for i in range(N):
t,x,y = map(int,input().split())
z=t+x+y
if (z>2*t) or (z%2 != 0):
print("No")
exit()
print("Yes")
|
p03457 | s025866648 | 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 != su%2:
ans="No"
else:
ans="Yes"
print(ans)
|
p03457 | s557291602 | Wrong Answer | N = int(input())
pt, px, py = 0, 0, 0
for _ in range(N):
ct, cx, cy = map(int, input().split())
diff_t = ct-pt
diff_x = cx - px
diff_y = cy - py
diff_xy = abs(diff_x+diff_y)
if diff_xy > diff_t:
print('No')
exit()
if (diff_xy + diff_t) % 2 == 0:
print('No')
exit()
px = cx
py = cy
pt = ct
print('Yes') |
p03457 | s476955897 | Wrong Answer | n=int(input())
T,X,Y=0,0,0
a='Yes'
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:
a='NO'
break
T,X,Y=t,x,y
print(a)
|
p03457 | s894405717 | Wrong Answer | n = int(input())
t,x,y = map(int,input().split())
No = 0
for i in range(n):
if (x + y) > t or (x + y + t) % 2 == 1:
No = No + 1
if No == 0:
print("Yes")
else:
print("No") |
p03457 | s913768729 | Wrong Answer | N=int(input())
t0=0
x0=0
y0=0
ans=True
for i in range(N):
t,x,y=map(int,input().split())
l=(t-t0)-abs(x+y-x0-y0)
if l%2==0 and l>=0:
continue
else:
ans=False
if ans==True:
print("Yes")
else:
print("No") |
p03457 | s488947388 | Wrong Answer | N = int(input())
now_t = 0
now_x = 0
now_y = 0
flag = 0
for i in range(N):
t,x,y = map(int,input().split())
if abs(x-now_x)+abs(y-now_y)<= t and (abs(x-now_x)+abs(y-now_y))%2 == abs(t-now_t)%2:
now_t = t
now_x = x
now_y = y
else:
flag += 1
break
if flag == 0:
print("Yes")
else:
print("No") |
p03457 | s740086171 | Wrong Answer | n = int(input())
apple = []
for _ in range(n):
apple.append(list(map(int, input().split())))
a = [0, 0]
count = 0
for i in apple:
t = i[0]
b = i[1:]
if abs(b[0]) + abs(b[1]) <= t:
if (abs(b[0]) + abs(b[1]))%2 == t%2:
count += 1
else:
count = 0
break
else:
count = 0
break
print("Yes" if count == n else "No") |
p03457 | s871395102 | Wrong Answer | n = int(input())
flag = True
for i in range(n):
t,x,y=map(int,input().split())
if x + y <= t and (x + y) % 2 == t % 2:
print("Yes")
flag = False
break
if flag:
print("No")
|
p03457 | s249183332 | 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())
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:
print("NO")
exit(0)
if dist % 2 != dt % 2:
print("NO")
exit(0)
print("YES") |
p03457 | s674467173 | 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 (T-t)%2==(abs(x-X)+abs(Y-y))%2):
x=X
y=Y
t=T
else:
print("No")
exit()
print("Yes")
|
p03457 | s173455375 | Wrong Answer | N = int(input())
xy=[]
try :
while True:
t = input().split()
t = list(map(int,t))
xy.append(t)
except EOFError:
pass
loc = [0,0]
time = 0
for i in range(N):
a = xy[i]
time = a[0]-time
dis = abs(loc[0]-a[1])+abs(loc[1]-a[2])
if (time-dis)<0 :
print("No")
exit()
elif (time-dis)%2 == 1:
print("No")
exit()
else :
loc = [a[1],a[2]]
else :
print("Yes") |
p03457 | s590786375 | 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 | s889943807 | 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):
f = False
print('Yes' if f else 'No')
|
p03457 | s747178605 | Wrong Answer | N = int(input())
pairs = [list(map(int, input().split())) for _ in range(N)]
x0 = 0
y0 = 0
t0 = 0
res = "Yes"
for t, x, y in pairs:
dx = x - x0
dy = y - y0
dt = t - t0
# if abs(dx) + abs(dy) != dt:
tmp = dt - (abs(dx) + abs(dy))
if tmp <= 0 or tmp % 2 != 0:
res = "No"
break
x0 = x
y0 = y
t0 = t
print(res) |
p03457 | s030518823 | Wrong Answer | N = int(input())
P = [list(map(int, input().split())) for i in range(N)]
P.insert(0,[0,0,0])
ans = "YES"
for i in range(N):
norm = abs(P[i+1][1]-P[i][1])+abs(P[i+1][2]-P[i][2])
if (P[i+1][0]-P[i][0])%2 != norm%2:
ans = "NO"
break
#else:
# if norm %2 == 0:
# ans = "NO"
# break
print(ans) |
p03457 | s309699566 | 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 | s341569421 | Wrong Answer | N=int(input())
t=[]
x=[]
y=[]
flag=False
for i in range(N):
t1,x1,y1=[int(i) for i in input().split()]
t.append(t1)
x.append(x1)
y.append(y1)
for i in range(N):
if(i>0):
t[i]=t[i]-t[i-1]
x[i]=x[i]-x[i-1]
y[i]=y[i]-y[i-1]
for i in range(N):
if((x[i]+y[i])%2==t[i] or abs(x[i])+abs(y[i])<=t[i]):
flag=True
else:
flag=False
break
if(flag):
print("Yes")
else:
print("No") |
p03457 | s214713036 | Wrong Answer | N = int(input())
D = [list(map(int, input().split())) for _ in range(N)]
for i in range(1, N - 1):
t = D[i][0] - D[i - 1][0]
d = D[i][1] - D[i - 1][1] + D[i][2] - D[i - 1][2]
if t < d or t % 2 != d % 2:
print('No')
break
print('Yes') |
p03457 | s367241009 | Wrong Answer | N=int(input())
flag='Yes'
p,q,r=0,0,0
for _ in range(N):
t,x,y=map(int,input().split())
a=x+y-p-q
e=t-r
if a<=e:
if (e-a)%2!=0:
flag='No'
break
else:
flag='No'
break
p=x
q=y
r=t
print(flag) |
p03457 | s925125396 | Wrong Answer | N = int(input())
t = [0]
x = [0]
y = [0]
for i in range(N):
l = [int(c) for c in input().split()]
t.append(l[0])
x.append(l[1])
y.append(l[2])
for i in range(N):
move = x[i+1]-x[i] + y[i+1]-y[i]
time = t[i+1]-t[i]
if time%2 ^ move%2 == 1 or time < move:
print("No")
exit()
print("Yes") |
p03457 | s589940107 | Wrong Answer | import numpy
N=int(input())
S = numpy.zeros(N*3,dtype=int).reshape(N,3)
for i in range(N):
S[i,:]= list(map(int,input().split()))
t=0
x=0
y=0
i=0
while i <N:
L=(S[i,0]-t) - abs(S[i,1]-x) - abs(S[i,2]-y)
if L<0:
break
elif L%2==0:
t=S[i,0]
x=S[i,1]
y=S[i,2]
i+=1
else:
break
if i ==N:
print("YES")
else:
print("NO")
|
p03457 | s944689779 | Wrong Answer | N=int(input())
position=[[0,0,0]]
judge=[0]
for i in range(N):
t,x,y = map(int,input().split())
position.append([t,x,y])
for j in range(N):
if ((position[1+j][1]+position[1+j][2]-position[1+j][0])%2 == 0) & (abs(x+y)<=t):
judge.append(0)
else:
judge.append(1)
if sum(judge) == 0:
print("Yes")
else:
print("No") |
p03457 | s963376634 | 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")
break
print("Yes") |
p03457 | s618364640 | Wrong Answer | n = int(input())
def check(t, x, y):
for i in range(t + 1):
for j in range(t + 1 - i):
if i - j != x:
break
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 | s679554249 | 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%su==0:
ans="Yes"
else:
ans="No"
print(ans)
|
p03457 | s055822270 | Wrong Answer | def main():
N = int(input())
posi = [0, 0]
time = 0
txy = [[int(i) for i in input().split()] for _ in range(N)]
for t, x, y in txy:
move = abs(posi[0] - x) + abs(posi[1] - y)
if (t - time) >= move and (move > 0 and (t - time) % move):
return print("No")
time = t
posi = [x, y]
print("Yes")
if __name__ == '__main__':
main()
|
p03457 | s637229455 | Wrong Answer |
n = int(input())
data = []
data.append([0, 0, 0])
for i in range(n):
t, x, y = map(int, input().split())
data.append([t, x, y])
for i in range(1, n + 1):
if ( (data[i][0] - data[i - 1][0]) % 2 == 0 and (abs(data[i][1] - data[i - 1][1]) + abs(data[i][2] - data[i- 1][2]) % 2 != 0) or (data[i][0] - data[i - 1][0]) % 2 == 1 and (abs(data[i][1] - data[i - 1][1]) + abs(data[i][2] - data[i- 1][2]) % 2 != 1)):
print("No")
exit()
print("Yes") |
p03457 | s839436202 | 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 == 1:
print("No")
exit()
print("Yes") |
p03457 | s007919570 | Wrong Answer | # -*- coding:utf-8 -*-
n = int(input())
t, x, y = [0], [0], [0]
for i in range(n):
t_i, x_i, y_i = map(int, input().strip().split())
t.append(t_i)
x.append(x_i)
y.append(y_i)
can = "YES"
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):
can = "NO"
if (dist % 2 != dt % 2):
can = "NO"
print(can) |
p03457 | s141793358 | Wrong Answer | n = int(input())
nt, nx, ny = 0, 0, 0
for i in range(n):
t, x, y = map(int, input().split())
t = t-nt
location = abs(nx-x) + abs(ny-y)
if location <= t and (t-location)%2 == 0:
nt, nx, ny = t, x, y
else:
print('No')
exit()
print('Yes') |
p03457 | s720995550 | Wrong Answer | n = int(input())
for _ in range(n):
t, x, y = map(int, input().split())
if t < x + y:
print('No')
break
else:
if (t - x - y)%2 == 1:
print('No')
break
else:
print('Yes') |
p03457 | s269215407 | Wrong Answer | 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:
print('Yes') |
p03457 | s072068674 | Wrong Answer | n=int(input())
start=[0,0,0]
ans=0
for i in range(n):
cont=list(map(int,input().split()))
if abs(start[0]-cont[0])!=abs(start[1]-cont[1])+abs(start[2]-cont[2]):
print('No')
ans=1
start=cont
if ans==0:
print('Yes') |
p03457 | s787805082 | 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) <= ti and abs(xi)+abs(yi) <= ti and ti%2 == (xi+yi)%2):
print('No')
exit()
print('Yes')
|
p03457 | s929475139 | Wrong Answer | N=int(input())
pre_t=0
pre_x=0
pre_y=0
flg=0
for i in range(N-1):
t,x,y=map(int,input().split())
t_tmp = t
t=t-pre_t
dist=abs(x-pre_x) + abs(y - pre_y)
pre_t=t_tmp
pre_x=x
pre_y=y
if(dist > t ):
flg=1
break
if((dist)%2 != pre_t%2):
flg=1
break
if(flg == 0):
print("Yes")
else:
print("No") |
p03457 | s807696714 | Wrong Answer | N = int(input())
bt, bx, by = 0, 0, 0
flg = True
for i in range(N):
t, x, y = map(int, input().split())
dist = abs(x-bx)+abs(y-by)
time = t-bt
if time>=dist and (time-dist)%2==0:
bt, bx, xy = t, x, y
else:
flg = False
break
if flg:
print('Yes')
else:
print('No') |
p03457 | s877434709 | 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][0] - posdata[i - 1][0]) and l_parity == t_parity:
nowpos = posdata[i]
else:
print("No")
exit()
print("Yes") |
p03457 | s406957609 | 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 | s608930851 | Wrong Answer | N=int(input())
t1 = 0
x1 = 0
y1 = 0
for i in range(N):
t2,x2,y2=map(int,input().split())
d = abs(x1 - x2) + abs(y1 - y2)
dt = t2 - t1
if d > dt:
print('No')
exit()
if dt%2!=0 and d==0:
print('No')
exit()
t1,x1,y1=t2,x2,y2
print('Yes')
|
p03457 | s586593128 | Wrong Answer | N = int(input())
TXY = [tuple(map(int,input().split())) for i in range(N)]
ct = cx = cy = 0
for t,x,y in TXY:
d = abs(cx-x) + abs(cy-y)
if d > t-ct or d%2 != (t-ct)%2:
print('No')
exit()
ct,cx,xy = t,x,y
print('Yes') |
p03457 | s515325395 | Wrong Answer | import sys
N = int(input())
for i in sys.stdin:
a = list(map(int, i.split(' ')))
t = a[0]
x = a[1]
y = a[2]
if (a[1] > N or a[2] > N):
print('No')
sys.exit(0)
if ((x + y) > t + 1):
print('No')
sys.exit(0)
if (t % 2 != (x + y) % 2):
print('No')
sys.exit(0)
print('Yes') |
p03457 | s129181301 | Wrong Answer | N=int(input())
tn,xn,yn=0,0,0
judge=[]
for i in range(N):
t1,x1,y1=map(int,input().split())
td=t1-tn
xd=x1-xn
yd=y1-yn
if td%2==(xd+yd)%2 and td>=xd+yd:
judge.append(True)
else:
judge.append(False)
tn,xn,yn=t1,x1,y1
print('Yes' if all(judge) else 'No')
|
p03457 | s571742348 | Wrong Answer | n = int(input())
found = True
for _ in range(n):
t,x,y = map(int,input().split())
if x==0 and y==0:
if t&1:
found = False
elif x==0:
if t%y == 0:
m = t//y
if (m&1) == 0:
found = False
else:
found = False
elif y==0:
if t%x == 0:
m = t//x
if (m&1) == 0:
found = False
else:
found = False
else:
if t%(x+y) != 0:
found = False
print("Yes" if found else "No") |
p03457 | s987128968 | Wrong Answer | N = int(input())
pairs = [list(map(int, input().split())) for _ in range(N)]
x0 = 0
y0 = 0
t0 = 0
res = "Yes"
for t, x, y in pairs:
dx = x - x0
dy = y - y0
dt = t - t0
if abs(dx) + abs(dy) != dt:
tmp = dt - (abs(dx) + abs(dy))
if tmp <= 0 or tmp % 2 != 0:
res = "No"
break
x0 += x
y0 += y
t0 += t
print(res) |
p03457 | s761654735 | 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 | s890530819 | Wrong Answer | # -*- coding:utf-8 -*-
n = int(input())
t, x, y = [0], [0], [0]
for i in range(n):
t_i, x_i, y_i = map(int, input().strip().split())
t.append(t_i)
x.append(x_i)
y.append(y_i)
can = "YES"
for i in range(n):
dt = t[i+1] - t[i]
dist = abs(x[i+1] - x[i]) + abs(y[i+1] - y[i])
can = "NO" if dt < dist else "YES"
can = "NO" if dist % 2 != dt % 2 else "YES"
print(can) |
p03457 | s335734887 | Wrong Answer | prev = (0,0)
pt = 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 (t - pt) < f((x,y), prev):
b = False
break
prev,pt = (x,y),t
print 'Yes' if b else 'No'
|
p03457 | s106768352 | Wrong Answer | n = int(input())
apple = []
for _ in range(n):
apple.append(list(map(int, input().split())))
a = [0, 0]
count = 0
for i in apple:
t = i[0]
b = i[1:]
if sum(b) <= t:
if sum(b)%2 == t%2:
count += 1
else:
count = 0
break
else:
count = 0
break
print("Yes" if count == n else "No") |
p03457 | s842947617 | Wrong Answer | N = int(input())
P = [list(map(int,input().split())) for i in range(N)]
for tmp in P:
t,x,y = tmp
sum_ = x + y
if t % 2 == 0 and sum_ % 2 == 0:
print("Yes")
elif t % 2 != 0 and sum_ % 2 != 0:
print("Yes")
else:
print("No")
|
p03457 | s186227115 | Wrong Answer | N = int(input())
ans = 'Yes'
tt, tx, ty = 0, 0, 0,
for _ in range(N):
t, x, y = map(int, input().split())
ct = t-tt
cx = x-tx
cy = y-ty
if ct < (cx+cy):
ans = 'No'
break
if cx+cy == 0:
ans = 'No'
break
if ct%2 != (cx+cy)%2:
ans = 'No'
break
tt, tx, ty = t, x, y
print(ans) |
p03457 | s682894024 | Wrong Answer | N=int(input())
x=y=t=0
flag=True
for i in range(N):
ti, xi, yi = map(int, input().split())
dist = abs(xi-x)+abs(yi-y)
dt = ti-t
x, y, t = xi, yi, ti
if dist<=dt and dist%2==dt%2:
continue
else:
print(i,dist,dt)
flag=False
print("Yes") if flag else print("No") |
p03457 | s318656264 | Wrong Answer | N = int(input())
t = [0]*100001
x = [0]*100001
y = [0]*100001
for n in range(N):
t[n+1], x[n+1], y[n+1] = map(int, input().split())
ans = True
for n in range(1, N):
dt = t[n+1] - t[n]
dist = (x[n+1] - x[n]) + (y[n+1] - y[n])
if dt < dist:
ans = False
if dt % 2 != dist % 2:
ans = False
if ans:
print('Yes')
else:
print('No') |
p03457 | s173421888 | Wrong Answer | n = int(input())
s = [map(int,input().split()) for i in range(n)]
t,x,y = (0,0,0)
for next_pos in s:
t_next,x_next,y_next = next_pos
dist = abs(x_next - x) + abs(y_next - y)
if dist > t_next - t:
print('No')
break
else:
t,x,y = t_next,x_next,y_next
else:
print('Yes') |
p03457 | s876981877 | Wrong Answer | N = int(input())
for _ in range(N):
t,x,y = map(int, input().split())
if (t+x+y)%2 or t<(x+y):
print('No')
exit()
print('Yes') |
p03457 | s055917693 | Wrong Answer | N = int(input())
txy = [[0,0,0] for i in range(N+1)]
for i in range(1,N+1):
txy[i] = list(map(int,input().split()))
ans = 'Yes'
for i in range(1,N+1):
dist = (txy[i][1]-txy[i-1][1])+(txy[i][2]-txy[i-1][2])
dt = txy[i][0]-txy[i-1][0]
if dist%2 != dt%2 or dist>dt:
ans = 'No'
print(ans) |
p03457 | s438468984 | Wrong Answer | N = int(input())
T,X,Y = 0,0,0
ans = "Yes"
for _ in range(N):
t,x,y = map(int,input().split())
t_need = abs(x - X) + abs(y - Y)
if t - T < t_need:
ans = "no"
break
if t - T > t_need:
if ((t - T) - t_need) % 2 == 1:
ans = "no"
break
T,X,Y = t,x,y
print(ans) |
p03457 | s700711437 | Wrong Answer | # AtCoder
N = int(input())
pt, px, py = 0, 0, 0
for _ in range(N):
ct, cx, cy = map(int, input().split())
diff_t = ct-pt
diff_x = cx - px
diff_y = cy - py
diff_xy = abs(diff_x+diff_y)
if diff_xy > diff_t:
print('No')
exit()
if (diff_xy + diff_t) % 2 == 0:
print('No')
exit()
px = diff_x
py = diff_y
pt = diff_t
print('Yes')
|
p03457 | s573127477 | Wrong Answer | import sys
N = int(input())
arr = [list(map(int,input().split())) for i in range(N)]
for i in range(len(arr)-1):
if arr[i+1][0]-arr[i][0] < abs(arr[i+1][1]-arr[i][1])+abs(arr[i+1][2]-arr[i][2]) or (arr[i+1][0]-arr[i][0])%2 != (abs(arr[i+1][1]-arr[i][1])+abs(arr[i+1][2]-arr[i][2]))%2:
print("No")
exit()
print("Yes") |
p03457 | s149105577 | Wrong Answer | N = int(input())
xy=[]
try :
while True:
t = input().split()
t = list(map(int,t))
xy.append(t)
except EOFError:
pass
loc = [0,0]
for i in range(N):
a = xy[i]
time = a[0]
dis = abs(loc[0]-a[1])+abs(loc[1]-a[2])
if (time-dis)<0 :
print("No")
break
elif (time-dis)%2 == 0:
loc = [a[1],a[2]]
else :
print("No")
break
else :
print("Yes") |
p03457 | s941684264 | Wrong Answer | import sys
N = int(input())
for i in range(N):
t, x, y = map(int, input().split())
if (x + y) > t or ((x + y + t)%2) != 0 :
print('No')
sys.exit()
print('Yes') |
p03457 | s392608718 | Wrong Answer | N = int(input())
xy=[]
try :
while True:
t = input().split()
t = list(map(int,t))
xy.append(t)
except EOFError:
pass
loc = [0,0]
time = 0
for i in range(N):
a = xy[i]
time = a[0]-time
dis = abs(loc[0]-a[1])+abs(loc[1]-a[2])
if (time-dis)<0 :
print("No")
break
elif time%2 == dis%2:
loc = [a[1],a[2]]
else :
print("No")
break
else :
print("Yes") |
p03457 | s695253675 | Wrong Answer | N = int(input())
scedule = []
scedule.append([0, 0, 0])
for i in range(N):
scedule.append(list(map(int,input().split())))
print(scedule)
for i in range(N):
timelimit = scedule[i+1][0] - scedule[i][0]
x_distance = abs(scedule[i+1][1] - scedule[i][1])
y_distance = abs(scedule[i+1][2] - scedule[i][2])
if timelimit < (x_distance + y_distance):
print("No")
exit()
if timelimit % (x_distance + y_distance) != 0:
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.