結果

問題 No.323 yuki国
ユーザー eitaho
提出日時 2016-01-08 22:20:52
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 720 ms / 5,000 ms
コード長 3,393 bytes
コンパイル時間 1,260 ms
コンパイル使用メモリ 110,080 KB
実行使用メモリ 27,136 KB
最終ジャッジ日時 2024-06-28 12:29:53
合計ジャッジ時間 8,717 ms
ジャッジサーバーID
(参考情報)
judge1 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 6
other AC * 32
権限があれば一括ダウンロードができます
コンパイルメッセージ
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.IO;
using System.Linq;
using System.Text;
using System.Collections.Generic;
using System.Diagnostics;
using System.Numerics;
using Enu = System.Linq.Enumerable;
using System.Drawing;
using System.Threading.Tasks;
class Program
{
static readonly int MaxSize = 1000 + 2500;
static readonly int[] DY = { 0, 1, 0, -1 };
static readonly int[] DX = { 1, 0, -1, 0 };
public void Solve()
{
int H = Reader.Int(), W = Reader.Int();
int A = Reader.Int(), sy = Reader.Int(), sx = Reader.Int();
int B = Reader.Int(), gy = Reader.Int(), gx = Reader.Int();
var grid = Reader.StringArray(H);
Func<int, int, bool> IsInside = (r, c) => r >= 0 && r < H && c >= 0 && c < W;
var seen = new bool[H, W, MaxSize + 1];
seen[sy, sx, A] = true;
var que = new Queue<int>();
que.Enqueue(sy); que.Enqueue(sx); que.Enqueue(A);
while (que.Count > 0)
{
int y = que.Dequeue(), x = que.Dequeue(), size = que.Dequeue();
for (int dir = 0; dir < 4; dir++)
{
int ny = y + DY[dir], nx = x + DX[dir];
if (!IsInside(ny, nx)) continue;
int nsize = size + (grid[ny][nx] == '*' ? 1 : -1);
if (nsize > 0 && nsize <= MaxSize && !seen[ny, nx, nsize])
{
if (ny == gy && nx == gx && nsize == B) { Console.WriteLine("Yes"); return; }
seen[ny, nx, nsize] = true;
que.Enqueue(ny); que.Enqueue(nx); que.Enqueue(nsize);
}
}
}
Console.WriteLine("No");
}
}
class Entry { static void Main() { new Program().Solve(); } }
class Reader
{
private static TextReader reader = Console.In;
private static readonly char[] separator = { ' ' };
private static readonly StringSplitOptions op = StringSplitOptions.RemoveEmptyEntries;
private static string[] A = new string[0];
private static int i;
private static void Init() { A = new string[0]; }
public static void Set(TextReader r) { reader = r; Init(); }
public static void Set(string file) { reader = new StreamReader(file); Init(); }
public static bool HasNext() { return CheckNext(); }
public static string String() { return Next(); }
public static int Int() { return int.Parse(Next()); }
public static long Long() { return long.Parse(Next()); }
public static double Double() { return double.Parse(Next()); }
public static int[] IntLine() { return Array.ConvertAll(Split(Line()), int.Parse); }
public static int[] IntArray(int N) { return Enu.Range(0, N).Select(i => Int()).ToArray(); }
public static int[][] IntTable(int H) { return Enu.Range(0, H).Select(i => IntLine()).ToArray(); }
public static string[] StringArray(int N) { return Enu.Range(0, N).Select(i => Next()).ToArray(); }
public static string Line() { return reader.ReadLine().Trim(); }
private static string[] Split(string s) { return s.Split(separator, op); }
private static string Next() { CheckNext(); return A[i++]; }
private static bool CheckNext()
{
if (i < A.Length) return true;
string line = reader.ReadLine();
if (line == null) return false;
if (line == "") return CheckNext();
A = Split(line);
i = 0;
return true;
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0