Submission #6516025
Source Code Expand
import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.NoSuchElementException; public class Main { static FastScanner sc = new FastScanner(); static PrintWriter out = new PrintWriter(System.out); public static void main(String[] args) { int N = sc.nextInt(); int t = 0; int x = 0; int y = 0; boolean ans = true; for (int i=0; i<N; i++) { int ti = sc.nextInt(); int xi = sc.nextInt(); int yi = sc.nextInt(); int diff = Math.abs(x-xi)+Math.abs(y-yi); if (diff>(ti-t)) { ans = false; //break; } else { if (diff%2==(ti-t)%2) { t+=ti; x = xi; y = yi; } else { ans = false; //break; } } } if (ans) out.println("Yes"); else out.println("No"); out.flush(); } static class FastScanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; private boolean hasNextByte() { if (ptr < buflen) { return true; } else { ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1; } private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126; } private void skipUnprintable() { while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; } public boolean hasNext() { skipUnprintable(); return hasNextByte(); } public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while (isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while (true) { if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; } else if (b == -1 || !isPrintableChar(b)) { return minus ? -n : n; } else { throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { return (int) nextLong(); } public int[] nextIntArray(int N, boolean oneBased) { if (oneBased) { int[] array = new int[N + 1]; for (int i = 1; i <= N; i++) { array[i] = sc.nextInt(); } return array; } else { int[] array = new int[N]; for (int i = 0; i < N; i++) { array[i] = sc.nextInt(); } return array; } } public long[] nextLongArray(int N, boolean oneBased) { if (oneBased) { long[] array = new long[N + 1]; for (int i = 1; i <= N; i++) { array[i] = sc.nextLong(); } return array; } else { long[] array = new long[N]; for (int i = 0; i < N; i++) { array[i] = sc.nextLong(); } return array; } } } }
Submission Info
Submission Time | |
---|---|
Task | C - Traveling |
User | nh11092 |
Language | Java8 (OpenJDK 1.8.0) |
Score | 0 |
Code Size | 3885 Byte |
Status | WA |
Exec Time | 107 ms |
Memory | 22100 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 | AC | 72 ms | 20944 KB |
0_001.txt | AC | 70 ms | 19412 KB |
0_002.txt | AC | 70 ms | 18260 KB |
1_003.txt | AC | 67 ms | 21204 KB |
1_004.txt | WA | 106 ms | 19204 KB |
1_005.txt | AC | 105 ms | 21220 KB |
1_006.txt | WA | 107 ms | 21140 KB |
1_007.txt | WA | 95 ms | 22100 KB |
1_008.txt | WA | 71 ms | 21332 KB |
1_009.txt | AC | 98 ms | 19664 KB |
1_010.txt | AC | 70 ms | 17620 KB |
1_011.txt | AC | 91 ms | 19664 KB |
1_012.txt | AC | 71 ms | 21460 KB |