#628809 (C#(csc)) No.1427 Simplified Tetris

提出ソース

結果

問題	No.1427 Simplified Tetris
ユーザー	りあん
提出日時	2021-03-12 22:54:38
言語	C#(csc) (csc 3.9.0)
結果	RE
実行時間	-
コード長	12,221 bytes
コンパイル時間	1,330 ms
コンパイル使用メモリ	123,604 KB
実行使用メモリ	33,808 KB
最終ジャッジ日時	2024-04-22 14:22:08
合計ジャッジ時間	6,399 ms
ジャッジサーバーID （参考情報）	judge5 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	40 ms 19,712 KB
testcase_01	RE	-
testcase_02	AC	50 ms 23,552 KB
testcase_03	AC	28 ms 19,072 KB
testcase_04	AC	28 ms 18,944 KB
testcase_05	AC	40 ms 19,712 KB
testcase_06	AC	38 ms 19,968 KB
testcase_07	AC	29 ms 18,944 KB
testcase_08	AC	28 ms 18,688 KB
testcase_09	AC	45 ms 22,144 KB
testcase_10	RE	-
testcase_11	RE	-
testcase_12	RE	-
testcase_13	AC	39 ms 19,840 KB
testcase_14	AC	40 ms 19,712 KB
testcase_15	AC	40 ms 19,456 KB
testcase_16	AC	29 ms 18,944 KB
testcase_17	AC	40 ms 19,456 KB
testcase_18	AC	28 ms 18,816 KB
testcase_19	AC	49 ms 23,424 KB
testcase_20	RE	-
testcase_21	AC	29 ms 19,072 KB
testcase_22	AC	40 ms 19,840 KB
testcase_23	AC	40 ms 19,328 KB
testcase_24	AC	42 ms 19,968 KB
testcase_25	AC	44 ms 21,376 KB
testcase_26	AC	29 ms 18,944 KB
testcase_27	AC	29 ms 18,944 KB
testcase_28	RE	-
testcase_29	AC	40 ms 19,584 KB
testcase_30	AC	40 ms 19,584 KB
testcase_31	RE	-
testcase_32	RE	-
testcase_33	AC	47 ms 22,400 KB
testcase_34	AC	38 ms 19,200 KB
testcase_35	AC	30 ms 19,200 KB
testcase_36	RE	-
testcase_37	AC	45 ms 21,888 KB
testcase_38	RE	-
testcase_39	RE	-
testcase_40	RE	-

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

コンパイルメッセージ

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;
        sc.Multi(out h, out w);
        var s = new string[h];
        for (int i = 0; i < h; i++)
        {
            s[i] = sc.Str;
        }
        for (int i = 0; i < h; i++)
        {
            if (i > 0 && s[i - 1].Any(x => x == '#') && s[i].All(x => x == '.')) {
                Prt("No");
                return;
            }
            if (s[i].All(x => x == '#')) {
                Prt("No");
                return;
            }
        }
        if (s.All(x => x.All(y => y == '.'))) {
            Prt("Yes");
            foreach (var item in s)
            {
                Prt(item);
            }
            return;
        }
        int n = h + 1;
        for (int i = 0; i < (1 << n); i++)
        {
            var t = new List<bool[]>();
            for (int j = 0; j < n; j++)
            {
                if (((i >> j) & 1) == 1) {
                    t.Add(Enumerable.Repeat(true, w).ToArray());
                }
                if (j < h) {
                    t.Add(s[j].Select(x => x == '#').ToArray());
                }
            }
            while (t.Any()) {
                if (t.First().All(x => !x)) {
                    t.RemoveAt(0);
                }
                else {
                    break;
                }
            }
            if (t.Count > h) continue;
            var res = solve(t);
            if (res != null) {
                Prt("Yes");
                for (int j = 0; j < h - t.Count; j++)
                {
                    Prt(new string('.', w));
                }
                foreach (var item in res)
                {
                    Prt(item);
                }
                return;
            }
        }
        Assert(false);
        Prt("No");


    }
    string[] solve(IList<bool[]> s) {
        int h = s.Count;
        int w = s[0].Length;
        var mf = new MaxFlow(h * w + 2);
        int S = h * w, T = h * w + 1;
        int c = 0;
        for (int i = 0; i < h; i++)
        {
            for (int j = 0; j < w; j++)
            {
                if ((i + j) % 2 == 0) {
                    if (s[i][j]) {
                        ++c;
                        mf.add_edge(S, i * w + j, 1);
                    }
                    if (i > 0) {
                        mf.add_edge(i * w + j, (i - 1) * w + j, 1);
                    }
                    if (j > 0) {
                        mf.add_edge(i * w + j, i * w + (j - 1), 1);
                    }
                }
                else {
                    if (s[i][j]) {
                        ++c;
                        mf.add_edge(i * w + j, T, 1);
                    }
                    if (i > 0) {
                        mf.add_edge((i - 1) * w + j, i * w + j, 1);
                    }
                    if (j > 0) {
                        mf.add_edge(i * w + (j - 1), i * w + j, 1);
                    }
                }
            }
        }
        if (c % 2 != 0) return null;
        long f = mf.run(S, T);
        if (f * 2 != c) return null;
        var edges = mf.getEdges();
        var res = new char[h][];
        for (int i = 0; i < h; i++)
        {
            res[i] = new char[w];
            for (int j = 0; j < w; j++)
            {
                res[i][j] = '.';
            }
        }
        int k = 0;
        for (int i = 0; i < h; i++)
        {
            for (int j = 0; j < w; j++)
            {
                if ((i + j) % 2 != 0) continue;
                foreach (var e in edges[i * w + j])
                {
                    if (e.to == S || e.to == T) continue;
                    if (e.cap == 0) {
                        char ch = k < 26 ? (char)('A' + k) : (char)('a' + k - 26);
                        ++k;
                        res[i][j] = ch;
                        res[e.to / w][e.to % w] = ch;
                    }
                }
            }
        }
        if (k > 52) return null;
        return res.Select(x => new string(x)).ToArray();
    }

}

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) {
        for (int k = 0; k < 4; k++) yield return new P(i + dd[k], j + dd[k ^ 1]);
    }
    public static IEnumerable<P> adjacents(int i, int j, int h, int w) {
        for (int k = 0; k < 4; k++) if (inside(i + dd[k], j + dd[k ^ 1], h, w))
            yield return new P(i + dd[k], j + dd[k ^ 1]);
    }
    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]);
    }
}

class MaxFlow {
    public class edge {
        public int to;
        public long cap;
        public int rev;
        public edge(int t, long c, int r) { to = t; cap = c; rev = r; }
    }
    int V;
    List<edge>[] G;
    int[] itr, lev;
    public List<edge>[] getEdges() => G;

    public MaxFlow(int v) {
        V = v; G = new List<edge>[v];
        for (int i = 0; i < v; ++i) G[i] = new List<edge>();
    }
    public void add_edge(int frm, int to, long c) => add_edge(frm, to, c, true);
    public void add_edge(int frm, int to, long c, bool dir) {
        G[frm].Add(new edge(to, c, G[to].Count));
        G[to].Add(new edge(frm, dir ? 0 : c, G[frm].Count - 1));
    }
    void bfs(int s) {
        lev = new int[V];
        for (int i = 0; i < V; ++i) lev[i] = -1;
        var q = new Queue<int>();
        lev[s] = 0;
        q.Enqueue(s);
        while (q.Count > 0) {
            int v = q.Dequeue();
            foreach (var e in G[v]) {
                if (e.cap > 0 && lev[e.to] < 0) {
                    lev[e.to] = lev[v] + 1;
                    q.Enqueue(e.to);
                }
            }
        }
    }
    long dfs(int v, int t, long f) {
        if (v == t) return f;
        for (; itr[v] < G[v].Count; ++itr[v]) {
            var e = G[v][itr[v]];
            if (e.cap > 0 && lev[v] < lev[e.to]) {
                long d = dfs(e.to, t, f < e.cap ? f : e.cap);
                if (d > 0) {
                    e.cap -= d;
                    G[e.to][e.rev].cap += d;
                    return d;
                }
            }
        }
        return 0;
    }

    public long run(int s, int t) {
        long ret = 0;
        bfs(s);
        while (lev[t] >= 0) {
            itr = new int[V];
            long f;
            while ((f = dfs(s, t, util.LM)) > 0) ret += f;
            bfs(s);
        }
        return ret;
    }
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード