Submission #3225828


Source Code Expand

N = int(input())
t = []
x = []
y = []
for i in range(N):
    n = list(map(int, input().split()))
    t.append(n[0])
    x.append(n[1])
    y.append(n[2])
    n.clear()

answer = "YES"

for i in range(N-1):
    if  (t[i+1]-t[i])%2 != (abs(x[i+1]-x[i])+abs(y[i+1]-y[i]))%2:
        answer = "NO"
    if t[i+1]-t[i] < abs(x[i+1]-x[i])+abs(y[i+1]-y[i]):
        answer = "NO"
print(answer)                         
    
        

Submission Info

Submission Time
Task C - Traveling
User kojidooon
Language Python (3.4.3)
Score 0
Code Size 444 Byte
Status WA
Exec Time 487 ms
Memory 11752 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
WA × 3
WA × 13
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 WA 17 ms 3064 KB
0_001.txt WA 17 ms 3064 KB
0_002.txt WA 17 ms 3064 KB
1_003.txt WA 17 ms 3064 KB
1_004.txt WA 479 ms 11752 KB
1_005.txt WA 487 ms 10236 KB
1_006.txt WA 468 ms 8708 KB
1_007.txt WA 88 ms 4068 KB
1_008.txt WA 18 ms 3064 KB
1_009.txt WA 111 ms 4580 KB
1_010.txt WA 18 ms 3064 KB
1_011.txt WA 77 ms 3948 KB
1_012.txt WA 18 ms 3064 KB