結果

問題 No.240 ナイト散歩
ユーザー suigingin
提出日時 2015-07-10 22:36:57
言語 Java8
(openjdk 1.8.0.222)
結果
AC  
実行時間 120 ms
コード長 3,389 Byte
コンパイル時間 2,776 ms
使用メモリ 21,376 KB
最終ジャッジ日時 2019-10-06 00:34:49

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
99_challenge01.txt AC 114 ms
21,340 KB
99_challenge02.txt AC 115 ms
21,344 KB
challenge01.txt AC 114 ms
21,108 KB
challenge02.txt AC 115 ms
21,108 KB
sample1.txt AC 116 ms
21,136 KB
sample2.txt AC 116 ms
21,136 KB
sample3.txt AC 113 ms
21,112 KB
sample4.txt AC 114 ms
21,108 KB
system_test1.txt AC 114 ms
21,108 KB
system_test2.txt AC 112 ms
21,108 KB
system_test3.txt AC 114 ms
21,108 KB
system_test4.txt AC 115 ms
21,112 KB
system_test5.txt AC 120 ms
21,376 KB
system_test6.txt AC 118 ms
21,340 KB
system_test7.txt AC 114 ms
21,144 KB
system_test8.txt AC 113 ms
21,344 KB
system_test9.txt AC 112 ms
21,108 KB
system_test10.txt AC 114 ms
21,340 KB
test1.txt AC 116 ms
21,344 KB
test2.txt AC 119 ms
21,104 KB
test3.txt AC 115 ms
21,104 KB
test4.txt AC 113 ms
21,136 KB
test5.txt AC 114 ms
21,340 KB
test6.txt AC 112 ms
21,096 KB
test7.txt AC 114 ms
21,340 KB
test8.txt AC 113 ms
21,336 KB
test9.txt AC 115 ms
21,344 KB
test10.txt AC 117 ms
21,340 KB
test11.txt AC 116 ms
21,100 KB
test12.txt AC 120 ms
21,336 KB
test13.txt AC 115 ms
21,112 KB
test14.txt AC 119 ms
21,176 KB
test15.txt AC 114 ms
21,104 KB
test16.txt AC 116 ms
21,336 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