結果

問題 No.323 yuki国
ユーザー りあんりあん
提出日時 2016-10-18 23:38:15
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 30 ms / 5,000 ms
コード長 10,434 bytes
コンパイル時間 1,129 ms
コンパイル使用メモリ 116,432 KB
実行使用メモリ 26,340 KB
最終ジャッジ日時 2024-06-28 12:39:07
合計ジャッジ時間 3,267 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 27 ms
24,312 KB
testcase_01 AC 28 ms
25,964 KB
testcase_02 AC 27 ms
24,168 KB
testcase_03 AC 27 ms
24,244 KB
testcase_04 AC 27 ms
24,032 KB
testcase_05 AC 27 ms
24,236 KB
testcase_06 AC 28 ms
24,288 KB
testcase_07 AC 27 ms
24,160 KB
testcase_08 AC 27 ms
26,332 KB
testcase_09 AC 28 ms
22,320 KB
testcase_10 AC 28 ms
24,312 KB
testcase_11 AC 28 ms
24,112 KB
testcase_12 AC 28 ms
26,104 KB
testcase_13 AC 28 ms
24,032 KB
testcase_14 AC 28 ms
26,204 KB
testcase_15 AC 30 ms
24,064 KB
testcase_16 AC 28 ms
24,036 KB
testcase_17 AC 28 ms
24,156 KB
testcase_18 AC 28 ms
23,980 KB
testcase_19 AC 27 ms
24,032 KB
testcase_20 AC 28 ms
24,112 KB
testcase_21 AC 28 ms
26,072 KB
testcase_22 AC 29 ms
24,112 KB
testcase_23 AC 28 ms
26,332 KB
testcase_24 AC 30 ms
24,032 KB
testcase_25 AC 28 ms
26,340 KB
testcase_26 AC 30 ms
24,112 KB
testcase_27 AC 28 ms
24,312 KB
testcase_28 AC 30 ms
24,184 KB
testcase_29 AC 30 ms
24,164 KB
testcase_30 AC 29 ms
26,232 KB
testcase_31 AC 29 ms
26,196 KB
testcase_32 AC 29 ms
24,288 KB
testcase_33 AC 28 ms
24,164 KB
testcase_34 AC 28 ms
24,180 KB
testcase_35 AC 27 ms
24,184 KB
testcase_36 AC 28 ms
24,052 KB
testcase_37 AC 28 ms
24,160 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.Collections.Generic;
using System.Linq;
using System.IO;

class Program
{
    const int M = 1000000007;
    const double eps = 1e-9;
    static int[] dd = { 0, 1, 0, -1, 0 };
    static void Main()
    {
        var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
        var sc = new Scan();
        int h, w, a, si, sj, b, gi, gj;
        sc.Multi(out h, out w);
        sc.Multi(out a, out si, out sj);
        sc.Multi(out b, out gi, out gj);
        if ((Math.Abs(si - gi) + Math.Abs(sj - gj)) % 2 != Math.Abs(a - b) % 2)
        {
            Console.WriteLine("No");
            return;
        }
        var m = new string[h];
        var bigger = new bool[h][];
        var smaller = new bool[h][];
        var max = new int[h][];
        var min = new int[h][];
        for (int i = 0; i < h; i++)
        {
            bigger[i] = new bool[w];
            smaller[i] = new bool[w];
            max[i] = new int[w];
            min[i] = new int[w];
            m[i] = sc.Str;
        }
        for (int i = 0; i < h; i++)
        {
            for (int j = 0; j < w; j++)
            {
                min[i][j] = M;

                if (m[i][j] == '*')
                {
                    for (int k = 0; k < 4; k++)
                    {
                        int p = i + dd[k], q = j + dd[k + 1];
                        if (0 <= p && p < h && 0 <= q && q < w && m[p][q] == '*')
                        {
                            bigger[i][j] = true;
                            break;
                        }
                    }
                }
                else
                {
                    for (int k = 0; k < 4; k++)
                    {
                        int p = i + dd[k], q = j + dd[k + 1];
                        if (0 <= p && p < h && 0 <= q && q < w && m[p][q] == '.')
                        {
                            smaller[i][j] = true;
                            break;
                        }
                    }
                }
            }
        }
        max[si][sj] = a;
        min[si][sj] = a;
        var qi = new Queue<int>();
        var qj = new Queue<int>();
        qi.Enqueue(si);
        qj.Enqueue(sj);
        bool allinf = false;
        while (qi.Count > 0)
        {
            int pi = qi.Dequeue(), pj = qj.Dequeue();
            if (bigger[pi][pj])
                allinf = true;
            if (smaller[pi][pj])
                min[pi][pj] = 2 - min[pi][pj] % 2;

            for (int k = 0; k < 4; k++)
            {
                int i = pi + dd[k], j = pj + dd[k + 1];
                if (0 <= i && i < h && 0 <= j && j < w)
                {
                    int d = ((m[i][j] == '*') ? 1 : -1);
                    bool changed = false;
                    if (allinf && max[i][j] < M)
                    {
                        max[i][j] = M;
                        changed = true;
                    }
                    else if (!allinf && max[i][j] < max[pi][pj] + d)
                    {
                        max[i][j] = max[pi][pj] + d;
                        changed = true;
                    }
                    if (min[i][j] > min[pi][pj] + d)
                    {
                        if (min[pi][pj] + d > 0)
                        {
                            min[i][j] = min[pi][pj] + d;
                            changed = true;
                        }
                        else if (allinf || max[pi][pj] > 2)
                        {
                            min[i][j] = 2;
                            changed = true;
                        }
                    }
                    if (changed)
                    {
                        qi.Enqueue(i);
                        qj.Enqueue(j);
                    }
                }
            }
        }
        sw.WriteLine(b >= min[gi][gj] && b <= max[gi][gj] ? "Yes" : "No");
        sw.Flush();
    }

    static void swap<T>(ref T a, ref T b) { var t = a; a = b; b = t; }
    static void swap<T>(IList<T> a, int i, int j) { var t = a[i]; a[i] = a[j]; a[j] = t; }
    static T Max<T>(params T[] a) { return a.Max(); }
    static T Min<T>(params T[] a) { return a.Min(); }
    static string con<T>(IEnumerable<T> a) { return string.Join(" ", a); }
    static void DBG<T>(params T[] a) { Console.WriteLine(string.Join(" ", a)); }
    static void DBG(params object[] a) { Console.WriteLine(string.Join(" ", a)); }
    static T[] copy<T>(IList<T> a)
    {
        int n = a.Count;
        var ret = new T[n];
        for (int i = 0; i < n; i++) ret[i] = a[i];
        return ret;
    }
}
class ScanCHK : Scan
{
    public new string Str
    {
        get
        {
            var s = Console.ReadLine();
            return s == s.Trim() ? s : "";
        }
    }
}
class Scan
{
    public int Int { get { return int.Parse(Str); } }
    public long Long { get { return long.Parse(Str); } }
    public double Double { get { return double.Parse(Str); } }
    public string Str { get { return Console.ReadLine().Trim(); } }
    public int[] IntArr { get { return StrArr.Select(int.Parse).ToArray(); } }
    public int[] IntArrWithSep(char sep) { return Str.Split(sep).Select(int.Parse).ToArray(); }
    public long[] LongArr { get { return StrArr.Select(long.Parse).ToArray(); } }
    public double[] DoubleArr { get { return StrArr.Select(double.Parse).ToArray(); } }
    public string[] StrArr { get { return Str.Split(); } }
    T cv<T>(string inp)
    {
        if (typeof(T).Equals(typeof(int)))    return (T)Convert.ChangeType(int.Parse(inp), typeof(T));
        if (typeof(T).Equals(typeof(long)))   return (T)Convert.ChangeType(long.Parse(inp), typeof(T));
        if (typeof(T).Equals(typeof(double))) return (T)Convert.ChangeType(double.Parse(inp), typeof(T));
        if (typeof(T).Equals(typeof(char)))   return (T)Convert.ChangeType(inp[0], typeof(T));
        return (T)Convert.ChangeType(inp, typeof(T));
    }
    public void Multi<T>(out T a) { a = cv<T>(Str); }
    public void Multi<T, U>(out T a, out U b)
    { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); }
    public void Multi<T, U, V>(out T a, out U b, out V c)
    { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); }
    public void Multi<T, U, V, W>(out T a, out U b, out V c, out W d)
    { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); }
    public void Multi<T, U, V, W, X>(out T a, out U b, out V c, out W d, out X e)
    { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); e = cv<X>(ar[4]); }
}
class mymath
{
    int Mod = 1000000007;
    public void setMod(int m) { Mod = m; }
    public bool isprime(long a)
    {
        if (a < 2) return false;
        for (long i = 2; i * i <= a; i++) if (a % i == 0) return false;
        return true;
    }
    public bool[] sieve(int n)
    {
        var p = new bool[n + 1];
        for (int i = 2; i <= n; i++) p[i] = true;
        for (int i = 2; i * i <= n; i++) if (p[i]) for (int j = i * i; j <= n; j += i) p[j] = false;
        return p;
    }
    public List<int> getprimes(int n)
    {
        var prs = new List<int>();
        var p = sieve(n);
        for (int i = 2; i <= n; i++) if (p[i]) prs.Add(i);
        return prs;
    }
    public long[][] E(int n)
    {
        var ret = new long[n][];
        for (int i = 0; i < n; i++)
        {
            ret[i] = new long[n];
            ret[i][i] = 1;
        }
        return ret;
    }
    public long[][] pow(long[][] A, long n)
    {
        if (n == 0) return E(A.Length);
        var t = pow(A, n / 2);
        if ((n & 1) == 0) return mul(t, t);
        return mul(mul(t, t), A);
    }
    public long dot(long[] x, long[] y)
    {
        int n = x.Length;
        long ret = 0;
        for (int i = 0; i < n; i++) ret = (ret + x[i] * y[i]) % Mod;
        return ret;
    }
    public long[][] trans(long[][] A)
    {
        int n = A[0].Length, m = A.Length;
        var ret = new long[n][];
        for (int i = 0; i < n; i++)
        {
            ret[i] = new long[m];
            for (int j = 0; j < m; j++) ret[i][j] = A[j][i];
        }
        return ret;
    }
    public long[] mul(long[][] A, long[] x)
    {
        int n = A.Length;
        var ret = new long[n];
        for (int i = 0; i < n; i++) ret[i] = dot(x, A[i]);
        return ret;
    }
    public long[][] mul(long[][] A, long[][] B)
    {
        int n = A.Length;
        var Bt = trans(B);
        var ret = new long[n][];
        for (int i = 0; i < n; i++) ret[i] = mul(Bt, A[i]);
        return ret;
    }
    public long[] add(long[] x, long[] y)
    {
        int n = x.Length;
        var ret = new long[n];
        for (int i = 0; i < n; i++) ret[i] = (x[i] + y[i]) % Mod;
        return ret;
    }
    public long[][] add(long[][] A, long[][] B)
    {
        int n = A.Length;
        var ret = new long[n][];
        for (int i = 0; i < n; i++) ret[i] = add(A[i], B[i]);
        return ret;
    }
    public long pow(long a, long b)
    {
        if (a >= Mod) return pow(a % Mod, b);
        if (a == 0) return 0;
        if (b == 0) return 1;
        var t = pow(a, b / 2);
        if ((b & 1) == 0) return t * t % Mod;
        return t * t % Mod * a % Mod;
    }
    public long inv(long a) { return pow(a, Mod - 2); }
    public long gcd(long a, long b)
    {
        while (b > 0) { var t = a % b; a = b; b = t; }
        return a;
    }
    public long lcm(long a, long b) { return a * (b / gcd(a, b)); }
    public long comb(int n, int r)
    {
        if (n < 0 || r < 0 || r > n) return 0;
        if (n - r < r) r = n - r;
        if (r == 0) return 1;
        if (r == 1) return n;
        var numer = new int[r];
        var denom = new int[r];
        for (int k = 0; k < r; k++)
        {
            numer[k] = n - r + k + 1;
            denom[k] = k + 1;
        }
        for (int p = 2; p <= r; p++)
        {
            int piv = denom[p - 1];
            if (piv > 1)
            {
                int ofst = (n - r) % p;
                for (int k = p - 1; k < r; k += p)
                {
                    numer[k - ofst] /= piv;
                    denom[k] /= piv;
                }
            }
        }
        long ret = 1;
        for (int k = 0; k < r; k++) if (numer[k] > 1) ret = ret * numer[k] % Mod;
        return ret;
    }
}
0