結果

問題 No.323 yuki国
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2015-12-17 01:32:47
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 866 ms / 5,000 ms
コード長 7,230 bytes
コンパイル時間 4,041 ms
コンパイル使用メモリ 114,168 KB
実行使用メモリ 48,004 KB
最終ジャッジ日時 2023-09-10 21:20:58
合計ジャッジ時間 23,081 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 204 ms
31,320 KB
testcase_01 AC 205 ms
33,380 KB
testcase_02 AC 206 ms
33,440 KB
testcase_03 AC 228 ms
35,692 KB
testcase_04 AC 206 ms
31,616 KB
testcase_05 AC 209 ms
33,488 KB
testcase_06 AC 206 ms
31,352 KB
testcase_07 AC 204 ms
31,568 KB
testcase_08 AC 773 ms
45,920 KB
testcase_09 AC 773 ms
43,868 KB
testcase_10 AC 206 ms
33,388 KB
testcase_11 AC 207 ms
31,356 KB
testcase_12 AC 207 ms
31,392 KB
testcase_13 AC 782 ms
43,992 KB
testcase_14 AC 785 ms
45,936 KB
testcase_15 AC 368 ms
39,932 KB
testcase_16 AC 767 ms
45,860 KB
testcase_17 AC 826 ms
48,004 KB
testcase_18 AC 401 ms
38,072 KB
testcase_19 AC 580 ms
40,792 KB
testcase_20 AC 863 ms
43,916 KB
testcase_21 AC 862 ms
41,868 KB
testcase_22 AC 866 ms
43,900 KB
testcase_23 AC 853 ms
46,048 KB
testcase_24 AC 380 ms
39,740 KB
testcase_25 AC 380 ms
41,852 KB
testcase_26 AC 810 ms
47,848 KB
testcase_27 AC 828 ms
41,688 KB
testcase_28 AC 824 ms
43,760 KB
testcase_29 AC 814 ms
43,868 KB
testcase_30 AC 205 ms
33,424 KB
testcase_31 AC 206 ms
31,372 KB
testcase_32 AC 208 ms
31,528 KB
testcase_33 AC 208 ms
31,428 KB
testcase_34 AC 209 ms
31,576 KB
testcase_35 AC 208 ms
31,448 KB
testcase_36 AC 207 ms
33,480 KB
testcase_37 AC 207 ms
33,432 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
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.Linq;
using System.Diagnostics;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;
using Number = System.Int64;
namespace Program
{
    //mukou gfaph janai 💢
    public class Solver
    {
        public void Solve()
        {
            var h = sc.Integer();
            var w = sc.Integer();
            var a = sc.Integer();
            var s = sc.Integer(2);
            var b = sc.Integer();
            var g = sc.Integer(2);
            var M = Enumerate(h, x => sc.Char(w));
            //var set = new DisjointSet(h * w * 3500);
            var ok = new bool[h * w * 3500];
            var qx = new Queue<int>();
            var qy = new Queue<int>();
            var qv = new Queue<int>();
            qx.Enqueue(s[0]); qy.Enqueue(s[1]); qv.Enqueue(a);
            ok[a * w * h + s[0] * w + s[1]] = true;
            int[] dx = { 1, 0, -1, 0 };
            int[] dy = { 0, 1, 0, -1 };
            while (qx.Any())
            {
                var i = qx.Dequeue();
                var j = qy.Dequeue();
                var v = qv.Dequeue();
                for (int d = 0; d < 4; d++)
                {
                    var nx = i + dx[d];
                    var ny = j + dy[d];
                    if (nx < 0 || nx >= h || ny < 0 || ny >= w) continue;
                    var nv = v + ((M[nx][ny] == '*') ? 1 : -1);
                    if (nv <= 0 || nv >= 3500) continue;
                    var to = nv * w * h + nx * w + ny;
                    if (ok[to]) continue;
                    ok[to] = true;
                    qx.Enqueue(nx);
                    qy.Enqueue(ny);
                    qv.Enqueue(nv);
                    //set.Unite(v * w * h + i * w + j, nv * w * h + nx * w + ny);
                    Debug.WriteLine("{0} {1} {2}->{3} {4} {5}", i, j, v, nx, ny, nv);

                }
            }
            var st = a * w * h + s[0] * w + s[1];
            var go = b * w * h + g[0] * w + g[1];
            if (ok[go])
                IO.Printer.Out.WriteLine("Yes");
            else IO.Printer.Out.WriteLine("No");




        }

        public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());
        static T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; }
        static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }
    }
}

#region main
static class Ex
{
    static public string AsString(this IEnumerable<char> ie) { return new string(System.Linq.Enumerable.ToArray(ie)); }
    static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") { return string.Join(st, ie); }
    static public void Main()
    {
        Debug.Listeners.Add(new TextWriterTraceListener(Program.IO.Printer.Out));
        var solver = new Program.Solver();
        solver.Solve();
        Program.IO.Printer.Out.Flush();
    }
}
#endregion
#region Ex
namespace Program.IO
{
    using System.IO;
    using System.Text;
    using System.Globalization;
    public class Printer : StreamWriter
    {
        static Printer() { Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false }; }
        public static Printer Out { get; set; }
        public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
        public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
        public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { }
        public void Write<T>(string format, T[] source) { base.Write(format, source.OfType<object>().ToArray()); }
        public void WriteLine<T>(string format, T[] source) { base.WriteLine(format, source.OfType<object>().ToArray()); }
    }
    public class StreamScanner
    {
        public StreamScanner(Stream stream) { str = stream; }
        public readonly Stream str;
        private readonly byte[] buf = new byte[1024];
        private int len, ptr;
        public bool isEof = false;
        public bool IsEndOfStream { get { return isEof; } }
        private byte read()
        {
            if (isEof) return 0;
            if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } }
            return buf[ptr++];
        }
        public char Char() { byte b = 0; do b = read(); while ((b < 33 || 126 < b) && !isEof); return (char)b; }

        public string Scan()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
                sb.Append(b);
            return sb.ToString();
        }
        public string ScanLine()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b != '\n'; b = (char)read())
                if (b == 0) break;
                else if (b != '\r') sb.Append(b);
            return sb.ToString();
        }
        public long Long()
        {
            if (isEof) return long.MinValue;
            long ret = 0; byte b = 0; var ng = false;
            do b = read();
            while (b != 0 && b != '-' && (b < '0' || '9' < b));
            if (b == 0) return long.MinValue;
            if (b == '-') { ng = true; b = read(); }
            for (; true; b = read())
            {
                if (b < '0' || '9' < b)
                    return ng ? -ret : ret;
                else ret = ret * 10 + b - '0';
            }
        }
        public int Integer() { return (isEof) ? int.MinValue : (int)Long(); }
        public double Double() { var s = Scan(); return s != "" ? double.Parse(Scan(), CultureInfo.InvariantCulture) : double.NaN; }
        private T[] enumerate<T>(int n, Func<T> f)
        {
            var a = new T[n];
            for (int i = 0; i < n; ++i) a[i] = f();
            return a;
        }

        public char[] Char(int n) { return enumerate(n, Char); }
        public string[] Scan(int n) { return enumerate(n, Scan); }
        public double[] Double(int n) { return enumerate(n, Double); }
        public int[] Integer(int n) { return enumerate(n, Integer); }
        public long[] Long(int n) { return enumerate(n, Long); }
    }
}
#endregion

#region DisjointSet
public class DisjointSet
{
    public int[] par, ranks, count;
    public DisjointSet(int n)
    {
        par = new int[n];
        count = new int[n];
        for (int i = 0; i < n; i++)
        {
            par[i] = i;
            count[i] = 1;
        }
        ranks = new int[n];
    }
    public int this[int id] { get { return (par[id] == id) ? id : this[par[id]]; } }
    public bool Unite(int x, int y)
    {
        x = this[x]; y = this[y];
        if (x == y) return false;
        if (ranks[x] < ranks[y])
        {
            par[x] = y;
            count[y] += count[x];
        }
        else
        {
            par[y] = x;
            count[x] += count[y];
            if (ranks[x] == ranks[y])
                ranks[x]++;
        }
        return true;
    }
    public int Size(int x) { return count[this[x]]; }
    public bool IsUnited(int x, int y) { return this[x] == this[y]; }

}
#endregion
0