#51772 (Java21) No.240 ナイト散歩

提出ソース

結果

問題	No.240 ナイト散歩
ユーザー	しらっ亭
提出日時	2015-10-02 17:35:26
言語	Java21 (openjdk 21)
結果	AC
実行時間	56 ms / 2,000 ms
コード長	5,806 bytes
コンパイル時間	4,103 ms
コンパイル使用メモリ	90,892 KB
実行使用メモリ	50,584 KB
最終ジャッジ日時	2024-10-07 21:12:51
合計ジャッジ時間	5,718 ms
ジャッジサーバーID （参考情報）	judge5 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	55 ms 50,524 KB
testcase_01	AC	55 ms 50,484 KB
testcase_02	AC	56 ms 50,488 KB
testcase_03	AC	53 ms 50,356 KB
testcase_04	AC	54 ms 50,444 KB
testcase_05	AC	55 ms 50,416 KB
testcase_06	AC	55 ms 50,536 KB
testcase_07	AC	55 ms 50,292 KB
testcase_08	AC	54 ms 49,924 KB
testcase_09	AC	54 ms 50,448 KB
testcase_10	AC	56 ms 50,520 KB
testcase_11	AC	55 ms 50,180 KB
testcase_12	AC	55 ms 50,116 KB
testcase_13	AC	55 ms 50,404 KB
testcase_14	AC	55 ms 50,144 KB
testcase_15	AC	54 ms 50,356 KB
testcase_16	AC	55 ms 50,508 KB
testcase_17	AC	54 ms 50,432 KB
testcase_18	AC	54 ms 50,244 KB
testcase_19	AC	54 ms 50,320 KB
testcase_20	AC	55 ms 50,360 KB
testcase_21	AC	55 ms 50,584 KB
testcase_22	AC	55 ms 50,116 KB
testcase_23	AC	55 ms 50,012 KB
testcase_24	AC	55 ms 50,472 KB
testcase_25	AC	55 ms 50,520 KB
testcase_26	AC	56 ms 50,152 KB
testcase_27	AC	55 ms 50,072 KB
testcase_28	AC	55 ms 50,156 KB
testcase_29	AC	54 ms 50,160 KB
testcase_30	AC	55 ms 50,220 KB
testcase_31	AC	55 ms 50,040 KB
testcase_32	AC	55 ms 50,372 KB
testcase_33	AC	54 ms 50,480 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

package problems303;

import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.ByteArrayOutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintStream;
import java.io.StringReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

public class Main {
    List<int[]> ps = new ArrayList<>();

    int[] dxs = {-2, -2, -1, -1, +1, +1, +2, +2};
    int[] dys = {-1, +1, -2, +2, -2, +2, -1, +1};

    public void dfs(int x, int y, int depth) {
        if (depth < 0) {
            return;
        }
        ps.add(new int[]{x, y});
        for (int i = 0; i < 8; i++) {
            int dx = dxs[i];
            int dy = dys[i];
            dfs(x + dx, y + dy, depth - 1);
        }
    }

    public void run() throws IOException {
        int X = io.nextInt();
        int Y = io.nextInt();
        dfs(0, 0, 3);
        for (int[] p : ps) {
            if (p[0] == X && p[1] == Y) {
                System.out.println("YES");
                return;
            }
        }
        System.out.println("NO");
    }

    // @formatter:off
    private static final int mod = (int) 1e9 + 7;
    final IOFast io = new IOFast();

    void main() throws IOException { try { run(); } catch (RuntimeException ignore) { } finally { System.out.flush(); } }
    public static void main(String[] args) throws IOException { new Main().main(); }

    public static String dtos(double x, int n) {
        StringBuilder sb = new StringBuilder();
        if (x < 0) {
            sb.append('-');
            x = -x;
        }
        x += Math.pow(10, -n) / 2;
        sb.append((long) x);
        sb.append(".");
        x -= (long) x;
        for (int i = 0; i < n; i++) {
            x *= 10;
            sb.append((int) x);
            x -= (int) x;
        }
        return sb.toString();
    }

    public static class IOFast {
        private BufferedReader in = new BufferedReader(new InputStreamReader(System.in));

        void setStringIn(String input) throws IOException {
            in.close();
            in = new BufferedReader(new StringReader(input));
        }

        void setStringOut(ByteArrayOutputStream output) throws IOException { System.out.flush(); System.setOut(new PrintStream(output)); }
        void setStringIO(String input, ByteArrayOutputStream output) throws IOException { setStringIn(input); setStringOut(output); }

        private static int pos, readLen;
        private static final char[] buffer = new char[1024 * 8];
        private static char[] str = new char[500*8*2];
        private static boolean[] isDigit = new boolean[256];
        private static boolean[] isSpace = new boolean[256];
        private static boolean[] isLineSep = new boolean[256];

        static {
            System.setOut(new PrintStream(new BufferedOutputStream(System.out)));
            for(int i = 0; i < 10; i++) { isDigit['0' + i] = true; } isDigit['-'] = true; isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true; isLineSep['\r'] = isLineSep['\n'] = true;
        }
        public int read() throws IOException { if(pos >= readLen) { pos = 0; readLen = in.read(buffer); if(readLen <= 0) { throw new RuntimeException(); } } return buffer[pos++]; }
        public int nextInt() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; int ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
        public long nextLong() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; long ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
        public char nextChar() throws IOException { while(true) { final int c = read(); if(!isSpace[c]) { return (char)c; } } }
        int reads(int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } if(str.length == len) { char[] rep = new char[str.length * 3 / 2]; System.arraycopy(str, 0, rep, 0, str.length); str = rep; } str[len++] = (char)c; } } catch(RuntimeException e) { ; } return len; }
        public char[] nextLine() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isLineSep); try { if(str[len-1] == '\r') { len--; read(); } } catch(RuntimeException e) { ; } return Arrays.copyOf(str, len); }
        public String nextString() throws IOException { return new String(next()); }
        public char[] next() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); return Arrays.copyOf(str, len); }
        public double nextDouble() throws IOException { return Double.parseDouble(nextString()); }
        public long[] nextLongArray(final int n) throws IOException { final long[] res = new long[n]; for(int i = 0; i < n; i++) { res[i] = nextLong(); } return res; }
        public int[] nextIntArray(final int n) throws IOException { final int[] res = new int[n]; for(int i = 0; i < n; i++) { res[i] = nextInt(); } return res; }
        public int[][] nextIntArray2D(final int n, final int k) throws IOException { final int[][] res = new int[n][]; for(int i = 0; i < n; i++) { res[i] = nextIntArray(k); } return res; }
        public int[][] nextIntArray2DWithIndex(final int n, final int k) throws IOException { final int[][] res = new int[n][k+1]; for(int i = 0; i < n; i++) { for(int j = 0; j < k; j++) { res[i][j] = nextInt(); } res[i][k] = i; } return res; }
        public double[] nextDoubleArray(final int n) throws IOException { final double[] res = new double[n]; for(int i = 0; i < n; i++) { res[i] = nextDouble(); } return res; }
    }
    // @formatter:on
}

yukicoder

結果

テストケース

ソースコード