#61240 (C#(csc)) No.240 ナイト散歩

• 問題: No.240 ナイト散歩
• ユーザー: nuwasogi
• 提出日時: 2015-11-29 00:33:20
• 言語: C#(csc) (csc 3.9.0)
• 結果: AC
• 実行時間: 33 ms / 2,000 ms
• コード長: 3,895 bytes
• コンパイル時間: 2,693 ms
• コンパイル使用メモリ: 112,152 KB
• 実行使用メモリ: 27,544 KB
• 最終ジャッジ日時: 2024-10-07 21:16:24
• 合計ジャッジ時間: 4,692 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

ファイルパターン	結果
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.

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
using System;
using System.Collections.Generic;
using System.Linq;
namespace KnightSanpo_CS
{
    class Program
    {
        static void Main(string[] args)
        {
            Solution mysol = new Solution();
            if (mysol.Solve()) Console.WriteLine("YES");
            else Console.WriteLine("NO");
        }
    }
    class Solution
    {
        static Vector[] Moves = { new Vector(1, 2), new Vector(2, 1), new Vector(2, -1), new Vector(1, -2), new Vector(-1, -2), new Vector(-2, -1), 
            new Vector(-2, 1), new Vector(-1, 2) };
        Vector Destination;
        static int SDThreshold = 45;
        public bool Solve()
        {
            if (Destination.SquareDistance > SDThreshold || Math.Abs(Destination.X) > 8 || Math.Abs(Destination.Y) > 8)
            {
                return false;
            }
            else if (Destination.SquareDistance <= 1 || Destination.SquareDistance == 5 || Destination.SquareDistance == 20 || Destination
                .SquareDistance == SDThreshold)
            {
                return true;
            }
            else
            {
                Queue<Vector> q = new Queue<Vector>();
                q.Enqueue(new Vector(0, 0));
                while (q.Count() != 0)
                {
                    Vector loc = q.Dequeue();
                    foreach (Vector m in Moves)
                    {
                        Vector moved = loc + m;
                        moved.n = loc.n + 1;
                        if (moved == Destination)
                        {
                            return true;
                        }
                        else
                        {
                            if (!q.Contains(moved) && moved.n <=2)
                            {
                                q.Enqueue(moved);
                            }
                        }
                    }
                }
                return false;
            }
        }
        public Solution()
        {
            int[] xy = ria();
            Destination = new Vector(xy[0], xy[1]);
        }
        static String rs() { return Console.ReadLine(); }
        static int ri() { return int.Parse(Console.ReadLine()); }
        static long rl() { return long.Parse(Console.ReadLine()); }
        static double rd() { return double.Parse(Console.ReadLine()); }
        static String[] rsa() { return Console.ReadLine().Split(' '); }
        static int[] ria() { return Console.ReadLine().Split(' ').Select(e => int.Parse(e)).ToArray(); }
        static long[] rla() { return Console.ReadLine().Split(' ').Select(e => long.Parse(e)).ToArray(); }
        static double[] rda() { return Console.ReadLine().Split(' ').Select(e => double.Parse(e)).ToArray(); }
    }
    struct Vector
    {
        public int X, Y;
        public int n;
        public Vector(int x, int y)
        {
            X = x;
            Y = y;
            n = 0;
        }
        public Vector(Vector a)
        {
            X = a.X;
            Y = a.Y;
            n = a.n;
        }
        public static Vector operator +(Vector a, Vector b)
        {
            Vector c = new Vector(a.X + b.X, a.Y + b.Y);
            return c;
        }
        public static Vector operator -(Vector a, Vector b)
        {
            Vector c = new Vector(a.X - b.X, a.Y - b.Y);
            return c;
        }
        public static Vector operator -(Vector a)
        {
            Vector c = new Vector(-a.X, -a.Y);
            return c;
        }
        public static bool operator ==(Vector a, Vector b)
        {
            return (a.X == b.X && a.Y == b.Y);
        }
        public static bool operator !=(Vector a, Vector b)
        {
            return (a.X != b.X || a.Y != b.Y);
        }
        public int SquareDistance
        {
            get
            {
                return (X * X + Y * Y);
            }
        }
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX