結果
問題 | No.240 ナイト散歩 |
ユーザー | uwi |
提出日時 | 2015-07-11 01:12:03 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 55 ms / 2,000 ms |
コード長 | 3,144 bytes |
コンパイル時間 | 3,815 ms |
コンパイル使用メモリ | 81,076 KB |
実行使用メモリ | 50,396 KB |
最終ジャッジ日時 | 2024-04-16 19:29:56 |
合計ジャッジ時間 | 6,462 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 53 ms
50,044 KB |
testcase_01 | AC | 53 ms
50,160 KB |
testcase_02 | AC | 53 ms
50,248 KB |
testcase_03 | AC | 53 ms
50,392 KB |
testcase_04 | AC | 53 ms
50,040 KB |
testcase_05 | AC | 54 ms
50,060 KB |
testcase_06 | AC | 53 ms
50,100 KB |
testcase_07 | AC | 53 ms
50,268 KB |
testcase_08 | AC | 54 ms
50,296 KB |
testcase_09 | AC | 53 ms
50,112 KB |
testcase_10 | AC | 54 ms
50,028 KB |
testcase_11 | AC | 53 ms
50,112 KB |
testcase_12 | AC | 53 ms
50,396 KB |
testcase_13 | AC | 53 ms
50,372 KB |
testcase_14 | AC | 53 ms
49,920 KB |
testcase_15 | AC | 53 ms
50,272 KB |
testcase_16 | AC | 53 ms
49,788 KB |
testcase_17 | AC | 53 ms
50,312 KB |
testcase_18 | AC | 54 ms
50,112 KB |
testcase_19 | AC | 54 ms
50,376 KB |
testcase_20 | AC | 54 ms
50,200 KB |
testcase_21 | AC | 52 ms
50,280 KB |
testcase_22 | AC | 52 ms
50,312 KB |
testcase_23 | AC | 53 ms
49,876 KB |
testcase_24 | AC | 54 ms
50,264 KB |
testcase_25 | AC | 54 ms
49,988 KB |
testcase_26 | AC | 52 ms
50,308 KB |
testcase_27 | AC | 51 ms
50,036 KB |
testcase_28 | AC | 55 ms
50,212 KB |
testcase_29 | AC | 54 ms
49,800 KB |
testcase_30 | AC | 52 ms
50,128 KB |
testcase_31 | AC | 53 ms
50,200 KB |
testcase_32 | AC | 53 ms
50,280 KB |
testcase_33 | AC | 53 ms
49,908 KB |
ソースコード
package contest; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class Q303 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int x = ni(), y = ni(); out.println(dfs(3, x, y) ? "YES" : "NO"); } boolean dfs(int rem, int x, int y) { if(x == 0 && y == 0)return true; if(rem <= 0)return false; for(int k = 0;k < 8;k++){ if(dfs(rem-1, x+DRK[k], y+DCK[k]))return true; } return false; } static int[] DRK = {-2,-2,-1,-1,1,1,2,2}; static int[] DCK = {-1,1,-2,2,-2,2,-1,1}; void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); } public static void main(String[] args) throws Exception { new Q303().run(); } private byte[] inbuf = new byte[1024]; private int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private int ni() { int num = 0, b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }