Submission #7551868


Source Code Expand

N = int(input())

t_b = x_b = y_b = 0 # 直前の時刻と位置保存用

def dist(x, x_b, y, y_b):
    return abs(x-x_b) + abs(y-y_b)

for i in range(N):
    t, x, y = map(int, input().split())
    if dist(x, x_b, y, y_b) > t - t_b or ((t - t_b) + dist(x, x_b, y, y_b))% 2 == 1: # 到達不能もしくは距離と残り時間の偶奇が不一致
        print("NO")
        exit()
    t_b, x_b, y_b = t, x, y

print("Yes")

Submission Info

Submission Time
Task C - Traveling
User Dobato
Language Python (3.4.3)
Score 0
Code Size 440 Byte
Status WA
Exec Time 414 ms
Memory 3064 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 1
WA × 2
AC × 6
WA × 7
Set Name Test Cases
Sample 0_000.txt, 0_001.txt, 0_002.txt
All 0_000.txt, 0_001.txt, 0_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt
Case Name Status Exec Time Memory
0_000.txt AC 17 ms 3060 KB
0_001.txt WA 17 ms 3060 KB
0_002.txt WA 17 ms 3064 KB
1_003.txt AC 17 ms 3064 KB
1_004.txt AC 414 ms 3064 KB
1_005.txt WA 17 ms 3060 KB
1_006.txt AC 396 ms 3060 KB
1_007.txt AC 77 ms 3064 KB
1_008.txt AC 18 ms 3064 KB
1_009.txt WA 17 ms 3064 KB
1_010.txt WA 17 ms 3064 KB
1_011.txt WA 17 ms 3064 KB
1_012.txt WA 17 ms 3060 KB