#116124 (C#(csc)) No.421 しろくろチョコレート

提出ソース

結果

問題	No.421 しろくろチョコレート
ユーザー	紙ぺーぱー
提出日時	2016-09-09 23:50:31
言語	C#(csc) (csc 3.9.0)
結果	AC
実行時間	43 ms / 2,000 ms
コード長	8,993 bytes
コンパイル時間	4,174 ms
コンパイル使用メモリ	118,812 KB
実行使用メモリ	28,696 KB
最終ジャッジ日時	2024-09-23 07:07:24
合計ジャッジ時間	5,011 ms
ジャッジサーバーID （参考情報）	judge4 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	30 ms 24,348 KB
testcase_01	AC	34 ms 24,680 KB
testcase_02	AC	32 ms 24,548 KB
testcase_03	AC	31 ms 24,420 KB
testcase_04	AC	32 ms 24,548 KB
testcase_05	AC	32 ms 24,676 KB
testcase_06	AC	30 ms 24,680 KB
testcase_07	AC	34 ms 26,296 KB
testcase_08	AC	32 ms 24,364 KB
testcase_09	AC	32 ms 26,532 KB
testcase_10	AC	31 ms 24,480 KB
testcase_11	AC	33 ms 24,244 KB
testcase_12	AC	31 ms 26,520 KB
testcase_13	AC	30 ms 24,496 KB
testcase_14	AC	31 ms 24,484 KB
testcase_15	AC	29 ms 24,420 KB
testcase_16	AC	38 ms 22,580 KB
testcase_17	AC	39 ms 26,552 KB
testcase_18	AC	38 ms 24,288 KB
testcase_19	AC	30 ms 24,476 KB
testcase_20	AC	36 ms 24,420 KB
testcase_21	AC	37 ms 26,584 KB
testcase_22	AC	33 ms 24,748 KB
testcase_23	AC	31 ms 26,656 KB
testcase_24	AC	30 ms 24,416 KB
testcase_25	AC	30 ms 24,416 KB
testcase_26	AC	31 ms 24,364 KB
testcase_27	AC	32 ms 28,444 KB
testcase_28	AC	33 ms 24,440 KB
testcase_29	AC	33 ms 24,676 KB
testcase_30	AC	35 ms 26,464 KB
testcase_31	AC	34 ms 24,632 KB
testcase_32	AC	36 ms 24,708 KB
testcase_33	AC	36 ms 24,804 KB
testcase_34	AC	31 ms 24,536 KB
testcase_35	AC	31 ms 26,456 KB
testcase_36	AC	34 ms 24,752 KB
testcase_37	AC	38 ms 22,584 KB
testcase_38	AC	43 ms 28,696 KB
testcase_39	AC	34 ms 26,680 KB
testcase_40	AC	36 ms 24,292 KB
testcase_41	AC	31 ms 24,620 KB
testcase_42	AC	31 ms 26,516 KB
testcase_43	AC	33 ms 26,552 KB
testcase_44	AC	41 ms 26,764 KB
testcase_45	AC	32 ms 26,288 KB
testcase_46	AC	31 ms 24,568 KB
testcase_47	AC	34 ms 24,400 KB
testcase_48	AC	37 ms 26,584 KB
testcase_49	AC	32 ms 24,624 KB
testcase_50	AC	32 ms 24,540 KB
testcase_51	AC	39 ms 26,572 KB
testcase_52	AC	33 ms 24,392 KB
testcase_53	AC	31 ms 24,496 KB
testcase_54	AC	31 ms 24,672 KB
testcase_55	AC	31 ms 26,524 KB
testcase_56	AC	31 ms 24,420 KB
testcase_57	AC	32 ms 26,656 KB
testcase_58	AC	35 ms 24,668 KB
testcase_59	AC	33 ms 26,528 KB
testcase_60	AC	43 ms 26,556 KB
testcase_61	AC	41 ms 26,668 KB
testcase_62	AC	31 ms 24,676 KB
testcase_63	AC	32 ms 28,576 KB
testcase_64	AC	30 ms 24,496 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.Linq;
using System.Linq.Expressions;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;
using Number = System.Int64;
namespace Program
{
    public class Solver
    {
        public void Solve()
        {
            var n = sc.Integer();
            var m = sc.Integer();
            var a = new int[2];
            var s = Enumerate(n, x => sc.Char(m));
            var src = n * m;
            var sink = n * m + 1;
            var G = Enumerate(n * m + 2, x => new List<Edge<int>>());
            int[] dx = { 1, 0, -1, 0 };
            int[] dy = { 0, 1, 0, -1 };
            for (int i = 0; i < n; i++)
            {
                for (int j = 0; j < m; j++)
                {
                    if (s[i][j] == 'b')
                    {
                        G.AddDirectedEdge(src, i * m + j, 1);
                        for (int k = 0; k < 4; k++)
                        {
                            var nx = i + dx[k];
                            var ny = j + dy[k];
                            if (nx < 0 || nx >= n || ny < 0 || ny >= m) continue;
                            G.AddDirectedEdge(i * m + j, nx * m + ny, 1);
                        }

                        a[0]++;
                    }
                    else if (s[i][j] == 'w')
                    {
                        G.AddDirectedEdge(i * m + j, sink, 1);
                        a[1]++;
                    }
                }
            }
            var f = Flow.GetMaxFlow(G, src, sink);
            var ans = 0;
            ans += f * 100;
            a[0] -= f; a[1] -= f;
            IO.Printer.Out.WriteLine(ans + 10 * a.Min() + (a.Max() - a.Min()));
        }
        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()
    {
        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(s, 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 Edge
public class Edge<T>
{
    public int to, rev;
    public T cap;
    public Edge(int t, int r, T _cap) { to = t; rev = r; cap = _cap; }
    public override string ToString() { return string.Format("{0}: Capacity {1}", to, cap); }
}
#endregion
#region AddEdge
static public partial class Flow
{
    static public void AddDirectedEdge(this List<Edge<int>>[] G, int from, int to, int cap)
    {
        G[from].Add(new Edge<int>(to, G[to].Count, cap));
        G[to].Add(new Edge<int>(from, G[from].Count - 1, 0));
    }
    static public void AddUndirectedEdge(this List<Edge<int>>[] G, int from, int to, int cap)
    {
        G[from].Add(new Edge<int>(to, G[to].Count, cap));
        G[to].Add(new Edge<int>(from, G[from].Count - 1, cap));
    }
    static public void AddDirectedEdge(this List<Edge<long>>[] G, int from, int to, long cap)
    {
        G[from].Add(new Edge<long>(to, G[to].Count, cap));
        G[to].Add(new Edge<long>(from, G[from].Count - 1, 0));
    }
    static public void AddUndirectedEdge(this List<Edge<long>>[] G, int from, int to, long cap)
    {
        G[from].Add(new Edge<long>(to, G[to].Count, cap));
        G[to].Add(new Edge<long>(from, G[from].Count - 1, cap));
    }
}
#endregion


//MaxFlow
#region Dinic
static public partial class Flow
{
    static public int GetMaxFlow(List<Edge<int>>[] G, int s, int t, int INF = -1)
    {
        var n = G.Length;
        var level = new int[n];
        var iter = new int[n];


        Action<int> bfs = p =>
        {
            Array.Clear(level, 0, n);
            var q = new Queue<int>();
            level[s] = 1;
            q.Enqueue(s);
            while (q.Any())
            {
                var v = q.Dequeue();
                foreach (var e in G[v])
                    if (e.cap > 0 && level[e.to] == 0)
                    {
                        level[e.to] = level[v] + 1;
                        q.Enqueue(e.to);
                    }
            }
        };


        Func<int, int, int, int> dfs = null;
        dfs = (v, u, f) =>
        {
            if (v == t) return f;
            for (; iter[v] < G[v].Count; iter[v]++)
            {
                var e = G[v][iter[v]];
                if (e.cap <= 0 || level[v] >= level[e.to]) continue;
                var d = dfs(e.to, u, Math.Min(f, e.cap));
                if (d <= 0) continue;
                e.cap -= d;
                G[e.to][e.rev].cap += d;
                return d;
            }
            return 0;
        };


        var flow = 0;
        if (INF == -1)
        {
            while (true)
            {
                bfs(s);
                if (level[t] == 0) return flow;
                Array.Clear(iter, 0, iter.Length);
                int f;
                while ((f = dfs(s, t, 1 << 30)) > 0) { flow += f; }
            }
        }
        else
        {
            while (INF > 0)
            {
                bfs(s);
                if (level[t] == 0) return flow;
                Array.Clear(iter, 0, iter.Length);
                int f;
                while ((f = dfs(s, t, 1 << 30)) > 0) { flow += f; INF -= f; }
            }
            return flow;
        }
    }
}
#endregion

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード