Submission #2122857
Source Code Expand
import java.util.Scanner; class C { public static void main(String...args) { final Scanner sc = new Scanner(System.in); final int N = sc.nextInt(); final int[] x = new int[N + 1]; final int[] y = new int[N + 1]; final int[] t = new int[N + 1]; for(int i = 1; i <= N; i++) { t[i] = sc.nextInt(); x[i] = sc.nextInt(); y[i] = sc.nextInt(); } for(int i = 1; i <= N; i++) { final int dist = Math.abs(x[i] - x[i - 1]) + Math.abs(y[i] - y[i - 1]); if(dist > t[i] - t[i - 1] || (dist - t[i] + t[i - 1]) % 2 != 0) { System.err.println(dist + " " + i); System.out.println("No"); return; } } System.out.println("Yes"); } } public class Main { public static void main(String... args) { C.main(args); } }
Submission Info
Submission Time | |
---|---|
Task | C - Traveling |
User | eomole |
Language | Java8 (OpenJDK 1.8.0) |
Score | 300 |
Code Size | 945 Byte |
Status | AC |
Exec Time | 585 ms |
Memory | 92040 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 | 92 ms | 20052 KB |
0_001.txt | AC | 94 ms | 19540 KB |
0_002.txt | AC | 94 ms | 16976 KB |
1_003.txt | AC | 94 ms | 19412 KB |
1_004.txt | AC | 585 ms | 92040 KB |
1_005.txt | AC | 570 ms | 87208 KB |
1_006.txt | AC | 547 ms | 91128 KB |
1_007.txt | AC | 301 ms | 45476 KB |
1_008.txt | AC | 124 ms | 22228 KB |
1_009.txt | AC | 333 ms | 44012 KB |
1_010.txt | AC | 117 ms | 18768 KB |
1_011.txt | AC | 294 ms | 42064 KB |
1_012.txt | AC | 111 ms | 17620 KB |