Submission #2119378
Source Code Expand
n = int(input()) lis = [0] x = [0] y = [0] for i in range(n): a,b,c = map(int,input().split()) lis.append(a) x.append(b) y.append(c) for m in range(n): time = lis[m+1]-lis[m] idou = abs(x[m+1]-x[m]) + abs(y[m+1]-y[m]) if time < idou or (time - idou)% 2 == 1: print("No") break if m == n-1: print("Yes")
Submission Info
Submission Time | |
---|---|
Task | C - Traveling |
User | pianotile |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 348 Byte |
Status | AC |
Exec Time | 394 ms |
Memory | 11736 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
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 | 3064 KB |
0_001.txt | AC | 17 ms | 3064 KB |
0_002.txt | AC | 17 ms | 3064 KB |
1_003.txt | AC | 17 ms | 3060 KB |
1_004.txt | AC | 394 ms | 11736 KB |
1_005.txt | AC | 309 ms | 10148 KB |
1_006.txt | AC | 394 ms | 8632 KB |
1_007.txt | AC | 73 ms | 4076 KB |
1_008.txt | AC | 18 ms | 3064 KB |
1_009.txt | AC | 77 ms | 4452 KB |
1_010.txt | AC | 18 ms | 3064 KB |
1_011.txt | AC | 55 ms | 3948 KB |
1_012.txt | AC | 18 ms | 3064 KB |