結果

問題 No.421 しろくろチョコレート
ユーザー AreTrashAreTrash
提出日時 2016-09-26 22:01:50
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 397 ms / 2,000 ms
コード長 5,249 bytes
コンパイル時間 1,190 ms
コンパイル使用メモリ 117,304 KB
実行使用メモリ 27,392 KB
最終ジャッジ日時 2024-09-23 07:09:50
合計ジャッジ時間 5,520 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 31 ms
24,816 KB
testcase_01 AC 38 ms
25,136 KB
testcase_02 AC 33 ms
27,140 KB
testcase_03 AC 31 ms
24,940 KB
testcase_04 AC 32 ms
26,892 KB
testcase_05 AC 31 ms
25,076 KB
testcase_06 AC 31 ms
27,112 KB
testcase_07 AC 35 ms
25,068 KB
testcase_08 AC 33 ms
25,132 KB
testcase_09 AC 32 ms
24,944 KB
testcase_10 AC 32 ms
24,696 KB
testcase_11 AC 34 ms
24,972 KB
testcase_12 AC 31 ms
27,248 KB
testcase_13 AC 31 ms
22,836 KB
testcase_14 AC 31 ms
24,948 KB
testcase_15 AC 31 ms
24,944 KB
testcase_16 AC 47 ms
25,036 KB
testcase_17 AC 51 ms
27,240 KB
testcase_18 AC 54 ms
25,200 KB
testcase_19 AC 31 ms
27,116 KB
testcase_20 AC 41 ms
24,748 KB
testcase_21 AC 46 ms
24,900 KB
testcase_22 AC 34 ms
25,068 KB
testcase_23 AC 31 ms
25,068 KB
testcase_24 AC 31 ms
27,128 KB
testcase_25 AC 31 ms
24,816 KB
testcase_26 AC 30 ms
24,952 KB
testcase_27 AC 31 ms
25,072 KB
testcase_28 AC 35 ms
27,212 KB
testcase_29 AC 34 ms
27,072 KB
testcase_30 AC 36 ms
24,880 KB
testcase_31 AC 38 ms
27,004 KB
testcase_32 AC 35 ms
23,352 KB
testcase_33 AC 38 ms
23,220 KB
testcase_34 AC 30 ms
24,752 KB
testcase_35 AC 31 ms
26,924 KB
testcase_36 AC 36 ms
27,144 KB
testcase_37 AC 53 ms
25,072 KB
testcase_38 AC 64 ms
25,076 KB
testcase_39 AC 33 ms
25,076 KB
testcase_40 AC 45 ms
27,036 KB
testcase_41 AC 31 ms
25,072 KB
testcase_42 AC 31 ms
27,392 KB
testcase_43 AC 34 ms
27,280 KB
testcase_44 AC 104 ms
25,012 KB
testcase_45 AC 31 ms
24,944 KB
testcase_46 AC 32 ms
24,948 KB
testcase_47 AC 38 ms
27,112 KB
testcase_48 AC 397 ms
24,880 KB
testcase_49 AC 33 ms
25,008 KB
testcase_50 AC 32 ms
24,948 KB
testcase_51 AC 106 ms
27,044 KB
testcase_52 AC 35 ms
25,136 KB
testcase_53 AC 32 ms
25,072 KB
testcase_54 AC 32 ms
25,456 KB
testcase_55 AC 33 ms
27,112 KB
testcase_56 AC 31 ms
25,132 KB
testcase_57 AC 31 ms
24,944 KB
testcase_58 AC 37 ms
25,072 KB
testcase_59 AC 32 ms
27,120 KB
testcase_60 AC 184 ms
27,116 KB
testcase_61 AC 63 ms
25,072 KB
testcase_62 AC 31 ms
24,692 KB
testcase_63 AC 29 ms
24,940 KB
testcase_64 AC 30 ms
24,860 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;

namespace No421{
    public class Program{
        public static void Main(string[] args){
            var sr = new StreamReader();
            //---------------------------------
            var H = sr.Next<int>();
            var W = sr.Next<int>();
            var S = sr.Next<string>(H);

            var dx = new[]{0, 1, 0, -1};
            var dy = new[]{1, 0, -1, 0};
            Func<int, int, bool> isInside = (x, y) => 0 <= x && x < W && 0 <= y && y < H;
            Func<int, int, int> hash = (x, y) => x + y * W + 1;

            var dinic = new Dinic(H * W + 2);
            for(var y = 0; y < H; y++){
                for(var x = 0; x < W; x++){
                    if((x + y) % 2 == 1){
                        if(S[y][x] != '.') dinic.AddEdge(hash(x, y), H * W + 1, 1);
                        continue;
                    }

                    if(S[y][x] != '.') dinic.AddEdge(0, hash(x, y), 1);
                    for(var i = 0; i < 4; i++){
                        var nx = x + dx[i];
                        var ny = y + dy[i];
                        if(isInside(nx, ny) && S[y][x] != '.' && S[ny][nx] != '.'){
                            dinic.AddEdge(hash(x, y), hash(nx, ny), 1);
                        }
                    }
                }
            }

            var w = S.Sum(s => s.Count(c => c == 'w'));
            var b = S.Sum(s => s.Count(c => c == 'b'));

            var m3 = dinic.MaxFlow(0, H * W + 1);
            var m2 = Math.Min(w, b) - m3;
            var m1 = Math.Max(w, b) - m3 - m2;

            Console.WriteLine(m1 + m2 * 10 + m3 * 100);
            //---------------------------------
        }
    }

    public class Dinic{//🐜P194
        public class Edge{
            public int To;
            public int Cap;
            public int Rev;
        }

        private readonly List<Edge>[] _adj;
        private readonly int[] _level;
        private readonly int[] _iter;

        public Dinic(int v){
            _adj = new List<Edge>[v];
            for(var i = 0; i < v; i++) _adj[i] = new List<Edge>();
            _level = new int[v];
            _iter = new int[v];
        }

        public void AddEdge(int from, int to, int cap){
            _adj[from].Add(new Edge{To = to, Cap = cap, Rev = _adj[to].Count});
            _adj[to].Add(new Edge{To = from, Cap = 0, Rev = _adj[from].Count - 1});
        }

        public int MaxFlow(int s, int t){
            var flow = 0;
            while(true){
                Bfs(s);
                if(_level[t] < 0) return flow;
                for(var i = 0; i < _iter.Length; i++) _iter[i] = 0;
                int f;
                while((f = Dfs(s, t, int.MaxValue)) > 0) flow += f;
            }
        }

        private void Bfs(int s){
            for(var i = 0; i < _level.Length; i++) _level[i] = -1;
            var que = new Queue<int>();
            _level[s] = 0;
            que.Enqueue(s);

            while(que.Count > 0){
                var v = que.Dequeue();
                for(var i = 0; i < _adj[v].Count; i++){
                    var e = _adj[v][i];
                    if(e.Cap > 0 && _level[e.To] < 0){
                        _level[e.To] = _level[v] + 1;
                        que.Enqueue(e.To);
                    }
                }
            }
        }

        private int Dfs(int v, int t, int f){
            if(v == t) return f;
            for(var i = _iter[v]; i < _adj[v].Count; i++){
                var e = _adj[v][i];
                if(e.Cap > 0 && _level[v] < _level[e.To]){
                    var d = Dfs(e.To, t, Math.Min(f, e.Cap));
                    if(d > 0){
                        e.Cap -= d;
                        _adj[e.To][e.Rev].Cap += d;
                        return d;
                    }
                }
            }
            return 0;
        }
    }

    public class StreamReader{
        private readonly char[] _c = {' '};
        private int _index = -1;
        private string[] _input = new string[0];
        private readonly System.IO.StreamReader _sr = new System.IO.StreamReader(Console.OpenStandardInput());

        public T Next<T>(){
            if(_index == _input.Length - 1){
                _index = -1;
                while(true){
                    string rl = _sr.ReadLine();
                    if(rl == null){
                        if(typeof(T).IsClass) return default(T);
                        return (T)typeof(T).GetField("MinValue").GetValue(null);
                    }
                    if(rl != ""){
                        _input = rl.Split(_c, StringSplitOptions.RemoveEmptyEntries);
                        break;
                    }
                }
            }
            return (T)Convert.ChangeType(_input[++_index], typeof(T), System.Globalization.CultureInfo.InvariantCulture);
        }

        public T[] Next<T>(int x){
            var ret = new T[x];
            for(var i = 0; i < x; ++i) ret[i] = Next<T>();
            return ret;
        }

        public T[][] Next<T>(int y, int x){
            var ret = new T[y][];
            for(var i = 0; i < y; ++i) ret[i] = Next<T>(x);
            return ret;
        }
    }
}
0