結果

問題 No.240 ナイト散歩
ユーザー yuya178yuya178
提出日時 2017-11-26 16:40:43
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,323 bytes
コンパイル時間 2,911 ms
コンパイル使用メモリ 83,632 KB
実行使用メモリ 37,148 KB
最終ジャッジ日時 2024-05-05 13:49:12
合計ジャッジ時間 5,449 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 56 ms
36,508 KB
testcase_01 AC 56 ms
37,128 KB
testcase_02 AC 54 ms
36,708 KB
testcase_03 AC 56 ms
37,148 KB
testcase_04 AC 51 ms
36,696 KB
testcase_05 AC 53 ms
36,884 KB
testcase_06 AC 56 ms
36,824 KB
testcase_07 AC 51 ms
36,892 KB
testcase_08 AC 58 ms
36,860 KB
testcase_09 AC 56 ms
36,764 KB
testcase_10 AC 54 ms
37,004 KB
testcase_11 AC 57 ms
37,128 KB
testcase_12 AC 56 ms
36,860 KB
testcase_13 AC 56 ms
36,796 KB
testcase_14 AC 57 ms
37,068 KB
testcase_15 AC 56 ms
36,660 KB
testcase_16 AC 59 ms
36,832 KB
testcase_17 AC 58 ms
36,904 KB
testcase_18 AC 53 ms
36,852 KB
testcase_19 AC 52 ms
36,956 KB
testcase_20 AC 53 ms
36,352 KB
testcase_21 AC 52 ms
36,992 KB
testcase_22 AC 53 ms
36,844 KB
testcase_23 AC 51 ms
36,780 KB
testcase_24 AC 52 ms
36,672 KB
testcase_25 AC 52 ms
36,588 KB
testcase_26 AC 52 ms
36,888 KB
testcase_27 AC 52 ms
37,008 KB
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 AC 57 ms
36,744 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;
import java.math.*;
import java.awt.Point;

public class Main {
    InputStream is;
    PrintWriter out;
    String INPUT = "";
    void solve()
    {
        int x = ni();
        int y = ni();
        int[] dx = {-2,-2,-1,-1,1,1,2,2,0};
        int[] dy = {-1,1,-2,2,-2,2,-1,1,0};
        Deque<int[]> q = new ArrayDeque<>();
        Deque<Integer> c = new ArrayDeque<>();
        int[] cur = {0,0};
        q.add(cur);
        int count = 0;
        c.add(count);
        while(!q.isEmpty()){
            cur = q.pop();
            count = c.pop();
            if(cur[0]==x && cur[1]==y){
                out.println("YES");
                return;
            }
            if(count>3) continue;
            for(int i = 0; i < 8; i++){
                int[] ncur = {cur[0]+dx[i], cur[1]+dy[i]};
                q.add(ncur);
                c.add(count+1);
            }
        }
        out.println("NO");
    }
    
    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 Main().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) && 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)); }

    static class ArrayUtils {
        public static void fill(double[][] array, double value) {
            for (double[] a : array) Arrays.fill(a, value);
        }
 
        public static void fill(double[][][] array, double value) {
            for (double[][] l : array) fill(l, value);
        } 
    }
}
0