Submission #3225839
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(len(N)-1): if t%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 | 438 Byte |
Status | RE |
Exec Time | 376 ms |
Memory | 11872 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | RE | 17 ms | 3064 KB |
0_001.txt | RE | 17 ms | 3064 KB |
0_002.txt | RE | 17 ms | 3064 KB |
1_003.txt | RE | 17 ms | 3064 KB |
1_004.txt | RE | 369 ms | 11872 KB |
1_005.txt | RE | 374 ms | 10272 KB |
1_006.txt | RE | 376 ms | 8900 KB |
1_007.txt | RE | 71 ms | 4068 KB |
1_008.txt | RE | 18 ms | 3064 KB |
1_009.txt | RE | 89 ms | 4516 KB |
1_010.txt | RE | 17 ms | 3064 KB |
1_011.txt | RE | 62 ms | 3948 KB |
1_012.txt | RE | 18 ms | 3064 KB |