結果
問題 | No.240 ナイト散歩 |
ユーザー |
![]() |
提出日時 | 2016-07-13 16:05:14 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 51 ms / 2,000 ms |
コード長 | 3,572 bytes |
コンパイル時間 | 2,332 ms |
コンパイル使用メモリ | 78,144 KB |
実行使用メモリ | 50,220 KB |
最終ジャッジ日時 | 2024-10-07 21:27:05 |
合計ジャッジ時間 | 4,669 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 30 |
ソースコード
import java.io.*;import java.math.*;import java.util.*;import java.util.Map.Entry;class Main {static int[] vy = {1,0,-1,0};static int[] vx = {0,1,0,-1};static long mod = 1000000007;static int[][] v = {{-2,-1},{-2,+1},{-1,-2},{-1,+2},{+1,-2},{+1,+2},{+2,-1},{+2,+1}};static HashMap<String,Boolean> map = new HashMap<String,Boolean>();public static void main(String[] args) {FastScanner sc = new FastScanner();//Scanner sc = new Scanner(System.in);int X = sc.nextInt();int Y = sc.nextInt();boolean ok = dfs(0,0,X,Y,0);if(ok) System.out.println("YES");else System.out.println("NO");}static boolean dfs(int x, int y, int GX, int GY, int c) {if(x == GX && y == GY) return true;if(c == 3) return false;for(int i = 0; i < v.length; i++) {int tx = x + v[i][0];int ty = y + v[i][1];if(dfs(tx,ty,GX,GY,c+1)) return true;}return false;}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() {if (!hasNext()) throw new NoSuchElementException();int 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();}}}}