結果

問題 No.421 しろくろチョコレート
ユーザー eitaho
提出日時 2016-09-09 23:06:09
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 42 ms / 2,000 ms
コード長 5,789 bytes
コンパイル時間 1,089 ms
コンパイル使用メモリ 116,012 KB
実行使用メモリ 27,520 KB
最終ジャッジ日時 2024-09-23 07:06:05
合計ジャッジ時間 4,721 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 65
権限があれば一括ダウンロードができます
コンパイルメッセージ
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.IO;
using System.Linq;
using System.Text;
using System.Text.RegularExpressions;
using System.Collections.Generic;
using System.Diagnostics;
using Enu = System.Linq.Enumerable;
public class Program
{
    static readonly char White = 'w', Black = 'b';
    static readonly int[] DR = { 0, 1, 0, -1 };
    static readonly int[] DC = { 1, 0, -1, 0 };
    public void Solve()
    {
        int H = Reader.Int(), W = Reader.Int();
        var grid = Reader.StringArray(H);
        int S = H * W, T = S + 1;
        var dinic = new Dinic(T + 1);
        int numWhite = 0, numBlack = 0;
        for (int r = 0; r < H; r++)
            for (int c = 0; c < W; c++)
                if (grid[r][c] == Black)
                {
                    numBlack++;
                    dinic.AddEdge(r * W + c, T, 1);
                }
                else if (grid[r][c] == White)
                {
                    numWhite++;
                    dinic.AddEdge(S, r * W + c, 1);
                    for (int d = 0; d < DR.Length; d++)
                    {
                        int nr = r + DR[d], nc = c + DC[d];
                        if (nr >= 0 && nr < H && nc >= 0 && nc < W && grid[nr][nc] == Black)
                            dinic.AddEdge(r * W + c, nr * W + nc, 1);
                    }
                }
        int neighbour = dinic.MaxFlow(S, T);
        int ans = neighbour * 100;
        ans += (Math.Min(numWhite, numBlack) - neighbour) * 10;
        ans += Math.Abs(numWhite - numBlack);
        Console.WriteLine(ans);
    }
    public class Dinic
    {
        public static readonly int INF = (int)1e9;
        public List<Edge>[] G;
        int S, T;
        int[] level;
        int[] iter;
        public Dinic(int V)
        {
            G = new List<Edge>[V];
            for (int i = 0; i < V; i++) G[i] = new List<Edge>();
        }
        public void AddEdge(int from, int to, int capacity)
        {
            G[from].Add(new Edge(to, capacity, G[to].Count));
            G[to].Add(new Edge(from, 0, G[from].Count - 1));
        }
        public int MaxFlow(int s, int t)
        {
            S = s; T = t;
            int flow = 0;
            while (true)
            {
                BFS();
                if (level[T] < 0) return flow;
                iter = new int[G.Length];
                int f;
                while ((f = DFS(S, INF)) > 0) { flow += f; }
            }
        }
        private void BFS()
        {
            level = Enumerable.Repeat(-1, G.Length).ToArray();
            Queue<int> que = new Queue<int>();
            que.Enqueue(S);
            level[S] = 0;
            while (que.Count > 0)
            {
                int v = que.Dequeue();
                foreach (Edge e in G[v])
                    if (e.capacity > 0 && level[e.to] < 0)
                    {
                        level[e.to] = level[v] + 1;
                        que.Enqueue(e.to);
                    }
            }
        }
        private int DFS(int v, int flow)
        {
            if (v == T) return flow;
            while (iter[v] < G[v].Count)
            {
                Edge e = G[v][iter[v]];
                if (e.capacity > 0 && level[v] < level[e.to])
                {
                    int d = DFS(e.to, Math.Min(flow, e.capacity));
                    if (d > 0)
                    {
                        e.capacity -= d;
                        G[e.to][e.reverse].capacity += d;
                        return d;
                    }
                }
                iter[v]++;
            }
            return 0;
        }
    }
    public class Edge
    {
        public int to, reverse;
        public int capacity;
        public Edge(int to, int capacity, int reverse)
        {
            this.to = to;
            this.capacity = capacity;
            this.reverse = reverse;
        }
        public override string ToString()
        {
            return "to:" + to + " cap:" + capacity;
        }
    }
}
class Entry { static void Main() { new Program().Solve(); } }
class Reader
{
    static TextReader reader = Console.In;
    static readonly char[] separator = { ' ' };
    static readonly StringSplitOptions op = StringSplitOptions.RemoveEmptyEntries;
    static string[] A = new string[0];
    static int i;
    static void Init() { A = new string[0]; }
    public static void Set(TextReader r) { reader = r; Init(); }
    public static void Set(string file) { reader = new StreamReader(file); Init(); }
    public static bool HasNext() { return CheckNext(); }
    public static string String() { return Next(); }
    public static int Int() { return int.Parse(Next()); }
    public static long Long() { return long.Parse(Next()); }
    public static double Double() { return double.Parse(Next()); }
    public static int[] IntLine() { return Array.ConvertAll(Split(Line()), int.Parse); }
    public static int[] IntArray(int N) { return Range(N, Int); }
    public static int[][] IntTable(int H) { return Range(H, IntLine); }
    public static string[] StringArray(int N) { return Range(N, Next); }
    public static string[][] StringTable(int N) { return Range(N, () => Split(Line())); }
    public static string Line() { return reader.ReadLine().Trim(); }
    static string[] Split(string s) { return s.Split(separator, op); }
    static T[] Range<T>(int N, Func<T> f) { var r = new T[N]; for (int i = 0; i < N; r[i++] = f()) ; return r; }
    static string Next() { CheckNext(); return A[i++]; }
    static bool CheckNext()
    {
        if (i < A.Length) return true;
        string line = reader.ReadLine();
        if (line == null) return false;
        if (line == "") return CheckNext();
        A = Split(line);
        i = 0;
        return true;
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0