#595676 (C#(csc)) No.1323 うしらずSwap

提出ソース

結果

問題	No.1323 うしらずSwap
ユーザー	りあん
提出日時	2020-12-20 05:45:08
言語	C#(csc) (csc 3.9.0)
結果	AC
実行時間	780 ms / 3,000 ms
コード長	10,895 bytes
コンパイル時間	2,424 ms
コンパイル使用メモリ	122,688 KB
実行使用メモリ	128,348 KB
最終ジャッジ日時	2024-04-27 08:52:34
合計ジャッジ時間	23,397 ms
ジャッジサーバーID （参考情報）	judge3 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	24 ms 25,076 KB
testcase_01	AC	30 ms 25,652 KB
testcase_02	AC	27 ms 23,352 KB
testcase_03	AC	26 ms 24,816 KB
testcase_04	AC	24 ms 25,008 KB
testcase_05	AC	25 ms 27,196 KB
testcase_06	AC	28 ms 27,708 KB
testcase_07	AC	27 ms 25,572 KB
testcase_08	AC	26 ms 25,328 KB
testcase_09	AC	27 ms 24,940 KB
testcase_10	AC	24 ms 25,064 KB
testcase_11	AC	25 ms 25,012 KB
testcase_12	AC	25 ms 24,888 KB
testcase_13	AC	28 ms 25,456 KB
testcase_14	AC	28 ms 27,492 KB
testcase_15	AC	25 ms 22,964 KB
testcase_16	AC	300 ms 79,192 KB
testcase_17	AC	374 ms 64,856 KB
testcase_18	AC	270 ms 62,816 KB
testcase_19	AC	375 ms 60,916 KB
testcase_20	AC	286 ms 64,996 KB
testcase_21	AC	578 ms 128,348 KB
testcase_22	AC	780 ms 128,092 KB
testcase_23	AC	543 ms 99,556 KB
testcase_24	AC	734 ms 100,188 KB
testcase_25	AC	538 ms 99,680 KB
testcase_26	AC	481 ms 95,844 KB
testcase_27	AC	558 ms 120,804 KB
testcase_28	AC	379 ms 63,068 KB
testcase_29	AC	426 ms 96,864 KB
testcase_30	AC	578 ms 97,120 KB
testcase_31	AC	430 ms 96,736 KB
testcase_32	AC	572 ms 96,356 KB
testcase_33	AC	564 ms 63,204 KB
testcase_34	AC	581 ms 61,412 KB
testcase_35	AC	590 ms 63,976 KB
testcase_36	AC	599 ms 65,756 KB
testcase_37	AC	596 ms 63,584 KB
testcase_38	AC	633 ms 66,268 KB
testcase_39	AC	634 ms 64,236 KB
testcase_40	AC	632 ms 66,652 KB
testcase_41	AC	655 ms 64,096 KB
testcase_42	AC	626 ms 63,972 KB
testcase_43	AC	202 ms 78,960 KB
testcase_44	AC	238 ms 62,944 KB
testcase_45	AC	292 ms 81,144 KB
testcase_46	AC	247 ms 66,908 KB
testcase_47	AC	221 ms 63,084 KB
testcase_48	AC	321 ms 117,488 KB
testcase_49	AC	384 ms 90,844 KB
testcase_50	AC	257 ms 89,068 KB
testcase_51	AC	151 ms 92,896 KB
testcase_52	AC	201 ms 91,116 KB
testcase_53	AC	372 ms 93,152 KB
testcase_54	AC	202 ms 90,872 KB
testcase_55	AC	421 ms 90,972 KB
testcase_56	AC	171 ms 93,028 KB
testcase_57	AC	475 ms 119,512 KB
testcase_58	AC	28 ms 27,236 KB
testcase_59	AC	27 ms 25,056 KB
testcase_60	AC	26 ms 23,224 KB
testcase_61	AC	28 ms 23,608 KB

権限があれば一括ダウンロードができます

コンパイルメッセージ

Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

raw source code

using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Threading;
using System.Text;
using System.Text.RegularExpressions;
using System.Diagnostics;
using static util;
using P = pair<int, int>;

class Program {
    static void Main(string[] args) {
        var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
        var solver = new Solver(sw);
        // var t = new Thread(solver.solve, 1 << 28); // 256 MB
        // t.Start();
        // t.Join();
        solver.solve();
        sw.Flush();
    }
}

class Solver {
    StreamWriter sw;
    Scan sc;
    void Prt(string a) => sw.WriteLine(a);
    void Prt<T>(IEnumerable<T> a) => Prt(string.Join(" ", a));
    void Prt(params object[] a) => Prt(string.Join(" ", a));
    public Solver(StreamWriter sw) {
        this.sw = sw;
        this.sc = new Scan();
    }

    public void solve() {
        int h, w, ai, aj, bi, bj;
        sc.Multi(out h, out w, out ai, out aj, out bi, out bj);
        --ai;
        --aj;
        --bi;
        --bj;
        var s = new char[h][];
        for (int i = 0; i < h; i++)
        {
            s[i] = sc.Str.ToCharArray();
        }
        var (d1, c1) = calc(s, ai, aj);
        var (d2, c2) = calc(s, bi, bj);
        int d = d1[bi][bj];
        if (d == M) {
            Prt(-1);
            return;
        }
        if (c1[bi][bj] > 1) {
            Prt(d * 2);
            return;
        }
        for (int i = 0; i < h; i++)
        {
            for (int j = 0; j < w; j++)
            {
                if (d1[i][j] + d2[i][j] == d && d1[i][j] > 0 && d2[i][j] > 0) {
                    int c = 0;
                    foreach (var item in adjacents(i, j))
                    {
                        if (s[item.v1][item.v2] != '#') {
                            ++c;
                        }
                    }
                    if (c > 2) {
                        Prt(d * 2 + 2);
                        return;
                    }
                }
            }
        }
        for (int i = 0; i < h; i++)
        {
            for (int j = 0; j < w; j++)
            {
                if (d1[i][j] + d2[i][j] == d && d1[i][j] > 0 && d2[i][j] > 0) {
                    s[i][j] = '#';
                }
            }
        }
        (d1, c1) = calc(s, ai, aj, bi, bj);
        (d2, c2) = calc(s, bi, bj, ai, aj);
        int ans = M;
        if (d1[bi][bj] != M) {
            ans = Math.Min(ans, d + d1[bi][bj]);
        }
        var cc1 = new int[h * w];
        var cc2 = new int[h * w];
        for (int i = 0; i < h; i++)
        {
            for (int j = 0; j < w; j++)
            {
                if (d1[i][j] != M) {
                    ++cc1[d1[i][j]];
                }
                if (d2[i][j] != M) {
                    ++cc2[d2[i][j]];
                }
            }
        }
        for (int i = 0; i < h * w; i++)
        {
            if (cc1[i] > 1 || cc2[i] > 1) {
                ans = Math.Min(ans, d * 2 + i * 4);
                break;
            }
        }
        Prt(ans == M ? -1 : ans);
    }
    (int[][], int[][]) calc(char[][] s, int si, int sj) {
        int h = s.Length;
        int w = s[0].Length;
        var dist = new int[h][];
        var cnt = new int[h][];
        for (int i = 0; i < h; i++)
        {
            dist[i] = new int[w];
            cnt[i] = new int[w];
            for (int j = 0; j < w; j++)
            {
                dist[i][j] = M;
            }
        }
        dist[si][sj] = 0;
        cnt[si][sj] = 1;
        var q = new Queue<P>();
        q.Enqueue(new P(si, sj));
        while (q.Any()) {
            var p = q.Dequeue();
            for (int k = 0; k < 4; k++)
            {
                int ti = p.v1 + dd[k];
                int tj = p.v2 + dd[k ^ 1];
                if (s[ti][tj] == '#') continue;
                if (dist[ti][tj] == M) {
                    dist[ti][tj] = dist[p.v1][p.v2] + 1;
                    cnt[ti][tj] = cnt[p.v1][p.v2];
                    q.Enqueue(new P(ti, tj));
                }
                else if (dist[ti][tj] == dist[p.v1][p.v2] + 1) {
                    cnt[ti][tj] = Math.Min(cnt[ti][tj] + cnt[p.v1][p.v2], M);
                }
            }
        }
        return (dist, cnt);
    }
    (int[][], int[][]) calc(char[][] s, int si, int sj, int gi, int gj) {
        int h = s.Length;
        int w = s[0].Length;
        var dist = new int[h][];
        var cnt = new int[h][];
        for (int i = 0; i < h; i++)
        {
            dist[i] = new int[w];
            cnt[i] = new int[w];
            for (int j = 0; j < w; j++)
            {
                dist[i][j] = M;
            }
        }
        dist[si][sj] = 0;
        cnt[si][sj] = 1;
        var q = new Queue<P>();
        q.Enqueue(new P(si, sj));
        while (q.Any()) {
            var p = q.Dequeue();
            for (int k = 0; k < 4; k++)
            {
                int ti = p.v1 + dd[k];
                int tj = p.v2 + dd[k ^ 1];
                if (s[ti][tj] == '#') continue;
                if (ti == gi && tj == gj && p.v1 == si && p.v2 == sj) continue;
                if (dist[ti][tj] == M) {
                    dist[ti][tj] = dist[p.v1][p.v2] + 1;
                    cnt[ti][tj] = cnt[p.v1][p.v2];
                    q.Enqueue(new P(ti, tj));
                }
                else if (dist[ti][tj] == dist[p.v1][p.v2] + 1) {
                    cnt[ti][tj] = Math.Min(cnt[ti][tj] + cnt[p.v1][p.v2], M);
                }
            }
        }
        return (dist, cnt);
    }
}

class pair<T, U> : IComparable<pair<T, U>> {
    public T v1;
    public U v2;
    public pair() : this(default(T), default(U)) {}
    public pair(T v1, U v2) { this.v1 = v1; this.v2 = v2; }
    public int CompareTo(pair<T, U> a) {
        int c = Comparer<T>.Default.Compare(v1, a.v1);
        return c != 0 ? c : Comparer<U>.Default.Compare(v2, a.v2);
    }
    public override string ToString() => v1 + " " + v2;
    public void Deconstruct(out T a, out U b) { a = v1; b = v2; }
}
static class util {
    public static readonly int M = 1000000007;
    // public static readonly int M = 998244353;
    public static readonly long LM = 1L << 60;
    public static readonly double eps = 1e-11;
    public static void DBG(string a) => Console.Error.WriteLine(a);
    public static void DBG<T>(IEnumerable<T> a) => DBG(string.Join(" ", a));
    public static void DBG(params object[] a) => DBG(string.Join(" ", a));
    public static void Assert(params bool[] conds) {
        if (conds.Any(x => !x)) throw new Exception();
    }
    public static pair<T, U> make_pair<T, U>(T v1, U v2) => new pair<T, U>(v1, v2);
    public static int CompareList<T>(IList<T> a, IList<T> b) where T : IComparable<T> {
        for (int i = 0; i < a.Count && i < b.Count; i++)
            if (a[i].CompareTo(b[i]) != 0) return a[i].CompareTo(b[i]);
        return a.Count.CompareTo(b.Count);
    }
    public static bool inside(int i, int j, int h, int w) => i >= 0 && i < h && j >= 0 && j < w;
    public static readonly int[] dd = { 0, 1, 0, -1 };
    // static readonly string dstring = "RDLU";
    public static IEnumerable<P> adjacents(int i, int j)
        => Enumerable.Range(0, dd.Length).Select(k => new P(i + dd[k], j + dd[k ^ 1]));
    public static IEnumerable<P> adjacents(int i, int j, int h, int w)
        => adjacents(i, j).Where(p => inside(p.v1, p.v2, h, w));
    public static IEnumerable<P> adjacents(this P p) => adjacents(p.v1, p.v2);
    public static IEnumerable<P> adjacents(this P p, int h, int w) => adjacents(p.v1, p.v2, h, w);
    public static IEnumerable<int> all_subset(this int p) {
        for (int i = 0; ; i = i - p & p) {
            yield return i;
            if (i == p) break;
        }
    }
    public static Dictionary<T, int> compress<T>(this IEnumerable<T> a)
        => a.Distinct().OrderBy(v => v).Select((v, i) => new { v, i }).ToDictionary(p => p.v, p => p.i);
    public static Dictionary<T, int> compress<T>(params IEnumerable<T>[] a) => compress(a.SelectMany(x => x));
    public static T[] inv<T>(this Dictionary<T, int> dic) {
        var res = new T[dic.Count];
        foreach (var item in dic) res[item.Value] = item.Key;
        return res;
    }
    public static void swap<T>(ref T a, ref T b) where T : struct { var t = a; a = b; b = t; }
    public static void swap<T>(this IList<T> a, int i, int j) where T : struct { var t = a[i]; a[i] = a[j]; a[j] = t; }
    public static T[] copy<T>(this IList<T> a) {
        var ret = new T[a.Count];
        for (int i = 0; i < a.Count; i++) ret[i] = a[i];
        return ret;
    }
}

class Scan {
    StreamReader sr;
    public Scan() { sr = new StreamReader(Console.OpenStandardInput()); }
    public Scan(string path) { sr = new StreamReader(path); }
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public string Str => ReadLine.Trim();
    public string ReadLine => sr.ReadLine();
    public pair<T, U> Pair<T, U>() {
        T a; U b;
        Multi(out a, out b);
        return new pair<T, U>(a, b);
    }
    public P P => Pair<int, int>();
    public int[] IntArr => StrArr.Select(int.Parse).ToArray();
    public long[] LongArr => StrArr.Select(long.Parse).ToArray();
    public double[] DoubleArr => StrArr.Select(double.Parse).ToArray();
    public string[] StrArr => Str.Split(new[]{' '}, StringSplitOptions.RemoveEmptyEntries);
    bool eq<T, U>() => typeof(T).Equals(typeof(U));
    T ct<T, U>(U a) => (T)Convert.ChangeType(a, typeof(T));
    T cv<T>(string s) => eq<T, int>()    ? ct<T, int>(int.Parse(s))
                       : eq<T, long>()   ? ct<T, long>(long.Parse(s))
                       : eq<T, double>() ? ct<T, double>(double.Parse(s))
                       : eq<T, char>()   ? ct<T, char>(s[0])
                                         : ct<T, string>(s);
    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]);
    }
    public void Multi<T, U, V, W, X, Y>(out T a, out U b, out V c, out W d, out X e, out Y f) {
        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]); f = cv<Y>(ar[5]);
    }
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード