結果

問題 No.240 ナイト散歩
ユーザー nokonoko
提出日時 2016-11-06 19:10:10
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 30 ms / 2,000 ms
コード長 5,535 bytes
コンパイル時間 1,423 ms
コンパイル使用メモリ 112,256 KB
実行使用メモリ 19,328 KB
最終ジャッジ日時 2024-10-07 21:31:19
合計ジャッジ時間 2,966 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
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 LIB;
using System;
using System.Linq;
using System.Text;
using System.Collections.Generic;
class Program
{
    public static IO IO = new IO();
    static void Main(string[] args)
    {
        int[] n = IO.INT(' ');
        BFSPOINT<int> Q = new BFSPOINT<int>(100, -100);
        POINT<int> goal = new POINT<int>(n[0], n[1], 0);
        string o = "NO";
        Q.PUSH(0, 0, 0, 0);
        while (Q.SIZE() != 0)
        {
            PAIR<POINT<int>, int> b = Q.POP();
            if (b.VALUE >= 4)
            {
                break;
            }
            if (b.KEY.SAME(goal))
            {
                o = "YES";
                break;
            }
            Q.PUSH(b.KEY.X - 2, b.KEY.Y - 1, 0, b.VALUE + 1);
            Q.PUSH(b.KEY.X - 2, b.KEY.Y + 1, 0, b.VALUE + 1);
            Q.PUSH(b.KEY.X - 1, b.KEY.Y - 2, 0, b.VALUE + 1);
            Q.PUSH(b.KEY.X - 1, b.KEY.Y + 2, 0, b.VALUE + 1);
            Q.PUSH(b.KEY.X + 1, b.KEY.Y - 2, 0, b.VALUE + 1);
            Q.PUSH(b.KEY.X + 1, b.KEY.Y + 2, 0, b.VALUE + 1);
            Q.PUSH(b.KEY.X + 2, b.KEY.Y - 1, 0, b.VALUE + 1);
            Q.PUSH(b.KEY.X + 2, b.KEY.Y + 1, 0, b.VALUE + 1);
        }
        IO.WRITE(o);
        IO.FLUSH();
    }
}
#region BFS
namespace LIB
{
    public class BFSPOINT<T> : QUEUE<PAIR<POINT<int>, T>>
    {
        private bool[,,] f;
        private int MIN;
        public BFSPOINT(int max, int min = 0) : base(max) { MIN = min; f = new bool[max - min, max - min, max - min]; }
        public void PUSH(int x, int y, int z, T value) { PUSH(new PAIR<POINT<int>, T>(new POINT<int>(x, y, z), value)); }
        public override void PUSH(PAIR<POINT<int>, T> v)
        {
            POINT<int> k = v.KEY;
            int x = k.X - MIN;
            int y = k.Y - MIN;
            int z = k.Z - MIN;
            int max = m - MIN;
            if (x >= 0 && x < max && y >= 0 && y < max && z >= 0 && z < max && !f[x, y, z])
            {
                f[x, y, z] = true; base.PUSH(v);
            }
        }
    }
}
#endregion
#region QUEUE
namespace LIB
{
    public class QUEUE<T>
    {
        protected int m;
        private int s, e, c;
        private T[] q;
        public QUEUE(int max) { m = max; q = new T[m]; CLEAR(); }
        public void CLEAR() { e = 0; s = 0; c = 0; }
        public int SIZE() { return c; }
        public T TOP() { return q[0]; }
        public T POP() { T r = q[s++]; s %= m; c--; return r; }
        public virtual void PUSH(T v) { q[e++] = v; e %= m; c++; }
        public bool EMPTY() { return SIZE() == 0; }
    }
}
#endregion
#region PAIR
namespace LIB
{
    public class PAIR<T, U> : IEquatable<PAIR<T, U>> where T : IEquatable<T>
    {
        public T KEY;
        public U VALUE;
        public PAIR(T key, U value) { KEY = key; VALUE = value; }
        public bool SAME(PAIR<T, U> b) { return Equals(b); }
        public bool Equals(PAIR<T, U> b) { return KEY.Equals(b.KEY); }
    }
}
#endregion
#region POINT
namespace LIB
{
    public class POINT<T> : IEquatable<POINT<T>> where T : IEquatable<T>
    {
        public T X;
        public T Y;
        public T Z;
        public POINT(T x, T y, T z) { X = x; Y = y; Z = z; }
        public bool SAME(POINT<T> b) { return Equals(b); }
        public bool Equals(POINT<T> b) { return X.Equals(b.X) && Y.Equals(b.Y) && Z.Equals(b.Z); }
    }
}
#endregion
namespace LIB
{
    public class IO
    {
        private const int WMAX = 1000;
        private StringBuilder S = new StringBuilder();
        private T R<T>(Func<string, T> f) { return f(Console.ReadLine()); }
        private T[] R<T>(Func<string, T> f, char c) { return STRING().Split(c).Select(f).ToArray(); }
        private T[] R<T>(Func<string, T> f, int l) { T[] r = new T[l]; for (int i = 0; i < l; i++) { r[i] = R(f); } return r; }
        private T[][] R<T>(Func<string, T> f, int l, char c) { T[][] r = new T[l][]; for (int i = 0; i < l; i++) { r[i] = R<T>(f, c); } return r; }
        private void W<T>(Func<T, string> f, T v, bool lf = true) { S.Append(f(v)); if (lf == true) { S.Append('\n'); } if (S.Length >= WMAX) { FLUSH
            (); } }
        public string STRING() { return R(s => s); }
        public string[] STRING(char c) { return R(s => s, c); }
        public string[] STRING(int l) { return R(s => s, l); }
        public string[][] STRING(int l, char c) { return R(s => s, l, c); }
        public int INT() { return R(int.Parse); }
        public int[] INT(char c) { return R(int.Parse, c); }
        public int[] INT(int l) { return R(int.Parse, l); }
        public int[][] INT(int l, char c) { return R(int.Parse, l, c); }
        public long LONG() { return R(long.Parse); }
        public long[] LONG(char c) { return R(long.Parse, c); }
        public long[] LONG(int l) { return R(long.Parse, l); }
        public long[][] LONG(int l, char c) { return R(long.Parse, l, c); }
        public double DOUBLE() { return R(double.Parse); }
        public double[] DOUBLE(char c) { return R(double.Parse, c); }
        public double[] DOUBLE(int l) { return R(double.Parse, l); }
        public double[][] DOUBLE(int l, char c) { return R(double.Parse, l, c); }
        public void WRITE(string s, bool lf = true) { W(v => v, s, lf); }
        public void WRITE(int s, bool lf = true) { W(v => v.ToString(), s, lf); }
        public void WRITE(long s, bool lf = true) { W(v => v.ToString(), s, lf); }
        public void WRITE(double s, bool lf = true) { W(v => v.ToString(), s, lf); }
        public void FLUSH() { Console.Write(S); S.Length = 0; }
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0