結果

問題 No.240 ナイト散歩
ユーザー suigingin
提出日時 2015-07-10 22:36:57
言語 Java11
(openjdk 11.0.6)
結果
AC  
実行時間 128 ms / 2,000 ms
コード長 3,389 Byte
コンパイル時間 3,922 ms
使用メモリ 24,732 KB
最終ジャッジ日時 2020-05-23 12:45:55

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 116 ms
24,664 KB
testcase_01 AC 124 ms
24,732 KB
testcase_02 AC 121 ms
24,716 KB
testcase_03 AC 121 ms
24,728 KB
testcase_04 AC 126 ms
24,704 KB
testcase_05 AC 123 ms
24,672 KB
testcase_06 AC 128 ms
24,708 KB
testcase_07 AC 124 ms
24,672 KB
testcase_08 AC 121 ms
24,716 KB
testcase_09 AC 124 ms
24,680 KB
testcase_10 AC 116 ms
24,672 KB
testcase_11 AC 118 ms
24,704 KB
testcase_12 AC 122 ms
24,696 KB
testcase_13 AC 120 ms
24,692 KB
testcase_14 AC 117 ms
24,716 KB
testcase_15 AC 125 ms
24,700 KB
testcase_16 AC 121 ms
24,724 KB
testcase_17 AC 118 ms
24,696 KB
testcase_18 AC 123 ms
24,712 KB
testcase_19 AC 116 ms
24,688 KB
testcase_20 AC 123 ms
24,680 KB
testcase_21 AC 116 ms
24,664 KB
testcase_22 AC 117 ms
24,720 KB
testcase_23 AC 115 ms
24,712 KB
testcase_24 AC 115 ms
24,688 KB
testcase_25 AC 116 ms
24,696 KB
testcase_26 AC 123 ms
24,680 KB
testcase_27 AC 125 ms
24,688 KB
testcase_28 AC 124 ms
24,708 KB
testcase_29 AC 118 ms
24,708 KB
testcase_30 AC 117 ms
24,704 KB
testcase_31 AC 116 ms
24,708 KB
testcase_32 AC 114 ms
24,672 KB
testcase_33 AC 118 ms
24,712 KB
権限があれば一括ダウンロードができます

ソースコード

diff #
import java.util.Arrays;
import java.util.Scanner;

public class Main_origin {
	MyScanner sc = new MyScanner();
	Scanner sc2 = new Scanner(System.in);
	long start = System.currentTimeMillis();
	long fin = System.currentTimeMillis();
	final int MOD = 1000000007;
	// int[] dx = { 1, 0, 0, -1 };
	// int[] dy = { 0, 1, -1, 0 };
	int[] dx = { -2, -2, -1, -1, 1, 1, 2, 2, };
	int[] dy = { -1, 1, -2, 2, -2, 2, -1, 1 };

	int x, y;
	boolean ok;

	void run() {
		x = sc.nextInt();
		y = sc.nextInt();
		ok = false;
		dfs(0,0,0);
		System.out.println(ok ? "YES" : "NO");
	}

	void dfs(int d, int xx, int yy) {
		if (d == 4) return;
		if (xx == x && yy == y) ok = true;
		for (int i = 0; i < 8; i++) {
			dfs(d + 1, xx + dx[i], yy + dy[i]);
		}
	}

	public static void main(String[] args) {
		new Main_origin().run();
	}

	void debug(Object... o) {
		System.out.println(Arrays.deepToString(o));
	}

	void debug2(int[][] array) {
		for (int i = 0; i < array.length; i++) {
			for (int j = 0; j < array[i].length; j++) {
				System.out.print(array[i][j]);
			}
			System.out.println();
		}
	}

	boolean inner(int h, int w, int limH, int limW) {
		return 0 <= h && h < limH && 0 <= w && w < limW;
	}

	void swap(int[] x, int a, int b) {
		int tmp = x[a];
		x[a] = x[b];
		x[b] = tmp;
	}

	// find minimum i (a[i] >= border)
	int lower_bound(int a[], int border) {
		int l = -1;
		int r = a.length;
		while (r - l > 1) {
			int mid = (l + r) / 2;
			if (border <= a[mid]) {
				r = mid;
			} else {
				l = mid;
			}
		}
		// r = l + 1
		return r;
	}

	boolean palindrome(String s) {
		for (int i = 0; i < s.length() / 2; i++) {
			if (s.charAt(i) != s.charAt(s.length() - 1 - i)) {
				return false;
			}
		}
		return true;
	}

	class MyScanner {
		int nextInt() {
			try {
				int c = System.in.read();
				while (c != '-' && (c < '0' || '9' < c))
					c = System.in.read();
				if (c == '-')
					return -nextInt();
				int res = 0;
				do {
					res *= 10;
					res += c - '0';
					c = System.in.read();
				} while ('0' <= c && c <= '9');
				return res;
			} catch (Exception e) {
				return -1;
			}
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		long nextLong() {
			return Long.parseLong(next());
		}

		String next() {
			try {
				StringBuilder res = new StringBuilder("");
				int c = System.in.read();
				while (Character.isWhitespace(c))
					c = System.in.read();
				do {
					res.append((char) c);
				} while (!Character.isWhitespace(c = System.in.read()));
				return res.toString();
			} catch (Exception e) {
				return null;
			}
		}

		int[] nextIntArray(int n) {
			int[] in = new int[n];
			for (int i = 0; i < n; i++) {
				in[i] = nextInt();
			}
			return in;
		}

		int[][] nextInt2dArray(int n, int m) {
			int[][] in = new int[n][m];
			for (int i = 0; i < n; i++) {
				in[i] = nextIntArray(m);
			}
			return in;
		}

		double[] nextDoubleArray(int n) {
			double[] in = new double[n];
			for (int i = 0; i < n; i++) {
				in[i] = nextDouble();
			}
			return in;
		}

		long[] nextLongArray(int n) {
			long[] in = new long[n];
			for (int i = 0; i < n; i++) {
				in[i] = nextLong();
			}
			return in;
		}

		char[][] nextCharField(int n, int m) {
			char[][] in = new char[n][m];
			for (int i = 0; i < n; i++) {
				String s = sc.next();
				for (int j = 0; j < m; j++) {
					in[i][j] = s.charAt(j);
				}
			}
			return in;
		}
	}
}
0