結果
問題 | No.367 ナイトの転身 |
ユーザー | AreTrash |
提出日時 | 2016-05-03 19:37:58 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,409 bytes |
コンパイル時間 | 955 ms |
コンパイル使用メモリ | 117,260 KB |
実行使用メモリ | 33,408 KB |
最終ジャッジ日時 | 2024-10-05 05:18:53 |
合計ジャッジ時間 | 2,892 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 23 ms
23,852 KB |
testcase_01 | AC | 23 ms
25,872 KB |
testcase_02 | AC | 22 ms
21,940 KB |
testcase_03 | AC | 22 ms
23,724 KB |
testcase_04 | AC | 22 ms
25,984 KB |
testcase_05 | WA | - |
testcase_06 | AC | 22 ms
26,000 KB |
testcase_07 | AC | 23 ms
24,244 KB |
testcase_08 | AC | 23 ms
25,988 KB |
testcase_09 | WA | - |
testcase_10 | AC | 121 ms
30,544 KB |
testcase_11 | AC | 170 ms
33,408 KB |
testcase_12 | AC | 91 ms
31,276 KB |
testcase_13 | AC | 80 ms
28,988 KB |
testcase_14 | AC | 84 ms
30,740 KB |
testcase_15 | AC | 26 ms
25,980 KB |
testcase_16 | AC | 76 ms
28,732 KB |
testcase_17 | AC | 30 ms
24,172 KB |
testcase_18 | AC | 32 ms
30,056 KB |
testcase_19 | AC | 38 ms
30,196 KB |
testcase_20 | AC | 30 ms
28,276 KB |
testcase_21 | AC | 40 ms
26,052 KB |
testcase_22 | AC | 22 ms
26,112 KB |
testcase_23 | AC | 24 ms
25,988 KB |
testcase_24 | AC | 26 ms
24,104 KB |
testcase_25 | AC | 24 ms
25,904 KB |
testcase_26 | AC | 24 ms
23,820 KB |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System; using System.Collections.Generic; namespace No367_1{ public class Program{ public static void Main(string[] args){ var move = new[]{ new[]{ new{X = -2, Y = -1}, new{X = -2, Y = +1}, new{X = -1, Y = -2}, new{X = -1, Y = +2}, new{X = +1, Y = -2}, new{X = +1, Y = +2}, new{X = +2, Y = -1}, new{X = +2, Y = +1} }, new[]{ new{X = -1, Y = -1}, new{X = -1, Y = +1}, new{X = +1, Y = -1}, new{X = +1, Y = +1} } }; var input = Console.ReadLine().Split(' '); var w = int.Parse(input[1]); var h = int.Parse(input[0]); var start = new Point(0, 0); var goal = new Point(0, 0); var map = new char[h][]; for(var i = 0; i < h; i++){ map[i] = Console.ReadLine().ToCharArray(); int x; if((x = Array.IndexOf(map[i], 'S')) != -1){ start = new Point(x, i); } else if((x = Array.IndexOf(map[i], 'G')) != -1){ goal = new Point(x, i); } } var result = new int[w, h, 2]; result[start.X, start.Y, 0] = 1; var que = new Queue<Stat>(); que.Enqueue(new Stat(start.X, start.Y, 0)); while(que.Count != 0){ var now = que.Dequeue(); foreach(var m in move[now.Type]){ if(0 <= now.X + m.X && now.X + m.X < w && 0 <= now.Y + m.Y && now.Y + m.Y < h){ var next = new Stat( now.X + m.X, now.Y + m.Y, map[now.Y + m.Y][now.X + m.X] == 'R' ? 1 - now.Type : now.Type ); if(result[next.X, next.Y, next.Type] == 0 || result[next.X, next.Y, next.Type] > result[now.X, now.Y, now.Type] + 1){ que.Enqueue(next); result[next.X, next.Y, next.Type] = result[now.X, now.Y, now.Type] + 1; } } } } if((result[goal.X, goal.Y, 0] == result[goal.X, goal.Y, 1]) && result[goal.X, goal.Y, 0] == 0){ Console.WriteLine(-1); } else{ if(result[goal.X, goal.Y, 0] == 0) result[goal.X, goal.Y, 0] = int.MaxValue; if(result[goal.X, goal.Y, 1] == 0) result[goal.X, goal.Y, 1] = int.MaxValue; Console.WriteLine(Math.Min(result[goal.X, goal.Y, 0], result[goal.X, goal.Y, 1]) - 1); } } public class Stat{ public Stat(int x, int y, int type){ X = x; Y = y; Type = type; } public int X { get; } public int Y { get; } public int Type { get; } } public class Point{ public Point(int x, int y){ X = x; Y = y; } public int X { get; } public int Y { get; } } } }