結果

問題 No.240 ナイト散歩
ユーザー 14番
提出日時 2016-05-08 22:22:14
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 29 ms / 2,000 ms
コード長 2,523 bytes
コンパイル時間 908 ms
コンパイル使用メモリ 116,856 KB
実行使用メモリ 27,568 KB
最終ジャッジ日時 2024-10-07 21:24:53
合計ジャッジ時間 2,809 ms
ジャッジサーバーID
(参考情報)
judge3 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 4
other AC * 30
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff #
プレゼンテーションモードにする

using System;
using System.Collections.Generic;
using System.Linq;
class Program
{
public void Proc()
{
Reader.IsDebug = false;
long[] inpt = Reader.ReadLine().Split(' ').Select(a=>long.Parse(a)).ToArray();
this.goalX = inpt[0];
this.goalY = inpt[1];
bool canReach = this.GetAns(0,0, 3);
string ans = "NO";
if(canReach) {
ans = "YES";
}
Console.WriteLine(ans);
}
private bool GetAns(long x, long y, int remain) {
if(x == this.goalX && y == this.goalY) {
return true;
}
if(remain == 0) {
return false;
}
List<long[]> nextPos = new List<long[]>();
nextPos.Add(new long[] {x+1, y+2});
nextPos.Add(new long[] {x-1, y+2});
nextPos.Add(new long[] {x+1, y-2});
nextPos.Add(new long[] {x-1, y-2});
nextPos.Add(new long[] {x+2, y-1});
nextPos.Add(new long[] {x+2, y+1});
nextPos.Add(new long[] {x-2, y-1});
nextPos.Add(new long[] {x-2, y+1});
foreach (long[] pos in nextPos)
{
long nextX = pos[0];
long nextY = pos[1];
if(GetAns(nextX, nextY, remain - 1)) {
return true;
}
}
return false;
}
private long goalX = 0;
private long goalY = 0;
public class Reader
{
public static bool IsDebug = true;
private static String PlainInput = @"
0 0
";
private static System.IO.StringReader Sr = null;
public static string ReadLine()
{
if (IsDebug)
{
if (Sr == null)
{
Sr = new System.IO.StringReader(PlainInput.Trim());
}
return Sr.ReadLine();
}
else
{
return Console.ReadLine();
}
}
public static int[] GetInt(char delimiter = ' ', bool trim = false)
{
string inptStr = ReadLine();
if (trim)
{
inptStr = inptStr.Trim();
}
string[] inpt = inptStr.Split(delimiter);
int[] ret = new int[inpt.Length];
for (int i = 0; i < inpt.Length; i++)
{
ret[i] = int.Parse(inpt[i]);
}
return ret;
}
}
static void Main()
{
Program prg = new Program();
prg.Proc();
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0