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

提出ソース

結果

問題	No.421 しろくろチョコレート
ユーザー	りあん
提出日時	2016-09-09 23:36:49
言語	C#(csc) (csc 3.9.0)
結果	WA
実行時間	-
コード長	7,838 bytes
コンパイル時間	5,126 ms
コンパイル使用メモリ	109,952 KB
実行使用メモリ	19,072 KB
最終ジャッジ日時	2024-11-16 18:41:24
合計ジャッジ時間	6,284 ms
ジャッジサーバーID （参考情報）	judge3 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	25 ms 18,688 KB
testcase_01	WA	-
testcase_02	AC	24 ms 18,944 KB
testcase_03	WA	-
testcase_04	AC	28 ms 18,944 KB
testcase_05	WA	-
testcase_06	AC	27 ms 18,816 KB
testcase_07	WA	-
testcase_08	AC	26 ms 18,688 KB
testcase_09	WA	-
testcase_10	WA	-
testcase_11	WA	-
testcase_12	AC	25 ms 18,688 KB
testcase_13	AC	25 ms 18,688 KB
testcase_14	AC	25 ms 18,944 KB
testcase_15	AC	25 ms 18,944 KB
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-
testcase_19	AC	25 ms 18,944 KB
testcase_20	WA	-
testcase_21	WA	-
testcase_22	WA	-
testcase_23	AC	25 ms 19,072 KB
testcase_24	AC	25 ms 18,688 KB
testcase_25	AC	25 ms 18,688 KB
testcase_26	AC	24 ms 18,688 KB
testcase_27	AC	25 ms 18,560 KB
testcase_28	AC	26 ms 18,944 KB
testcase_29	AC	26 ms 19,072 KB
testcase_30	WA	-
testcase_31	AC	26 ms 18,944 KB
testcase_32	AC	23 ms 18,816 KB
testcase_33	WA	-
testcase_34	AC	25 ms 18,688 KB
testcase_35	AC	25 ms 18,816 KB
testcase_36	WA	-
testcase_37	WA	-
testcase_38	WA	-
testcase_39	WA	-
testcase_40	AC	25 ms 19,072 KB
testcase_41	AC	25 ms 18,688 KB
testcase_42	WA	-
testcase_43	WA	-
testcase_44	AC	24 ms 18,688 KB
testcase_45	WA	-
testcase_46	AC	25 ms 18,944 KB
testcase_47	WA	-
testcase_48	AC	26 ms 18,560 KB
testcase_49	WA	-
testcase_50	WA	-
testcase_51	AC	25 ms 18,944 KB
testcase_52	WA	-
testcase_53	AC	24 ms 18,688 KB
testcase_54	AC	24 ms 18,816 KB
testcase_55	WA	-
testcase_56	WA	-
testcase_57	WA	-
testcase_58	WA	-
testcase_59	WA	-
testcase_60	WA	-
testcase_61	WA	-
testcase_62	AC	25 ms 18,944 KB
testcase_63	AC	24 ms 18,688 KB
testcase_64	AC	22 ms 18,688 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;

class Program
{
    const int M = 1000000007;
    const double eps = 1e-9;
    static int[] dd = { 0, 1, 0, -1, 0 };
    static void Main()
    {
        var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
        var sc = new Scan();
        int n, m;
        sc.Multi(out n, out m);
        var s = new string[n];
        var vis = new bool[n][];
        for (int i = 0; i < n; i++)
        {
            s[i] = sc.Str;
            vis[i] = new bool[m];
        }
        int ans = 0, b = 0, w = 0;
        for (int i = 0; i < n; i++)
        {
            for (int j = 0; j < m; j++)
            {
                if (s[i][j] != '.' && !vis[i][j])
                {
                    var qi = new Queue<int>();
                    var qj = new Queue<int>();
                    int bb = 0, ww = 0;
                    vis[i][j] = true;
                    if (s[i][j] == 'b')
                        ++bb;
                    else
                        ++ww;

                    qi.Enqueue(i);
                    qj.Enqueue(j);
                    while (qi.Any())
                    {
                        int pi = qi.Dequeue(), pj = qj.Dequeue();
                        for (int k = 0; k < 4; k++)
                        {
                            int ti = pi + dd[k], tj = pj + dd[k + 1];
                            if (ti >= 0 && ti < n && tj >= 0 && tj < m && !vis[ti][tj] && s[ti][tj] != '.')
                            {
                                vis[ti][tj] = true;
                                if (s[ti][tj] == 'b')
                                    ++bb;
                                else
                                    ++ww;

                                qi.Enqueue(ti);
                                qj.Enqueue(tj);
                            }
                        }
                    }
                    int mi = Math.Min(bb, ww);
                    ans += mi * 100;
                    b += bb - mi;
                    w += ww - mi;
                }
            }
        }
        ans += Math.Min(b, w) * 8 + b + w;
        sw.WriteLine(ans);
        sw.Flush();
    }

    static void swap<T>(ref T a, ref T b) { var t = a; a = b; b = t; }
    static void swap<T>(IList<T> a, int i, int j) { var t = a[i]; a[i] = a[j]; a[j] = t; }
    static T Max<T>(params T[] a) { return a.Max(); }
    static T Min<T>(params T[] a) { return a.Min(); }
    static void DBG<T>(params T[] a) { Console.WriteLine(string.Join(" ", a)); }
    static void DBG(params object[] a) { Console.WriteLine(string.Join(" ", a)); }
    static T[] copy<T>(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
{
    public int Int { get { return int.Parse(Str); } }
    public long Long { get { return long.Parse(Str); } }
    public double Double { get { return double.Parse(Str); } }
    public string Str { get { return Console.ReadLine().Trim(); } }
    public int[] IntArr { get { return StrArr.Select(int.Parse).ToArray(); } }
    public int[] IntArrWithSep(char sep) { return Str.Split(sep).Select(int.Parse).ToArray(); }
    public long[] LongArr { get { return StrArr.Select(long.Parse).ToArray(); } }
    public double[] DoubleArr { get { return StrArr.Select(double.Parse).ToArray(); } }
    public string[] StrArr { get { return Str.Split(); } }
    T cv<T>(string inp)
    {
        if (typeof(T).Equals(typeof(int)))    return (T)Convert.ChangeType(int.Parse(inp), typeof(T));
        if (typeof(T).Equals(typeof(long)))   return (T)Convert.ChangeType(long.Parse(inp), typeof(T));
        if (typeof(T).Equals(typeof(double))) return (T)Convert.ChangeType(double.Parse(inp), typeof(T));
        if (typeof(T).Equals(typeof(char)))   return (T)Convert.ChangeType(inp[0], typeof(T));
        return (T)Convert.ChangeType(inp, typeof(T));
    }
    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]); }
}
class mymath
{
    static int Mod = 1000000007;
    public void setMod(int m) { Mod = m; }
    public bool isprime(long a)
    {
        if (a < 2) return false;
        for (long i = 2; i * i <= a; i++) if (a % i == 0) return false;
        return true;
    }
    public bool[] sieve(int n)
    {
        var isp = new bool[n + 1];
        for (int i = 2; i <= n; i++) isp[i] = true;
        for (int i = 2; i * i <= n; i++) if (isp[i]) for (int j = i * i; j <= n; j += i) isp[j] = false;
        return isp;
    }
    public List<int> getprimes(int n)
    {
        var prs = new List<int>();
        var isp = sieve(n);
        for (int i = 2; i <= n; i++) if (isp[i]) prs.Add(i);
        return prs;
    }
    public long[][] E(int n)
    {
        var ret = new long[n][];
        for (int i = 0; i < n; i++)
        {
            ret[i] = new long[n];
            ret[i][i] = 1;
        }
        return ret;
    }
    public long[][] powmat(long[][] A, long n)
    {
        if (n == 0) return E(A.Length);
        var t = powmat(A, n / 2);
        if ((n & 1) == 0) return mulmat(t, t);
        return mulmat(mulmat(t, t), A);
    }
    public long[] mulmat(long[][] A, long[] x)
    {
        int n = A.Length, m = x.Length;
        var ans = new long[n];
        for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) ans[i] = (ans[i] + x[j] * A[i][j]) % Mod;
        return ans;
    }
    public long[][] mulmat(long[][] A, long[][] B)
    {
        int n = A.Length, m = B[0].Length, l = B.Length;
        var ans = new long[n][];
        for (int i = 0; i < n; i++)
        {
            ans[i] = new long[m];
            for (int j = 0; j < m; j++) for (int k = 0; k < l; k++) ans[i][j] = (ans[i][j] + A[i][k] * B[k][j]) % Mod;
        }
        return ans;
    }
    public long powmod(long a, long b)
    {
        if (a >= Mod) return powmod(a % Mod, b);
        if (a == 0) return 0;
        if (b == 0) return 1;
        var t = powmod(a, b / 2);
        if ((b & 1) == 0) return t * t % Mod;
        return t * t % Mod * a % Mod;
    }
    public long gcd(long a, long b)
    {
        while (b > 0) { var t = a % b; a = b; b = t; }
        return a;
    }
    public long lcm(long a, long b) { return a * (b / gcd(a, b)); }
    public long Comb(int n, int r)
    {
        if (n < 0 || r < 0 || r > n) return 0;
        if (n - r < r) r = n - r;
        if (r == 0) return 1;
        if (r == 1) return n;
        var numerator = new int[r];
        var denominator = new int[r];
        for (int k = 0; k < r; k++)
        {
            numerator[k] = n - r + k + 1;
            denominator[k] = k + 1;
        }
        for (int p = 2; p <= r; p++)
        {
            int pivot = denominator[p - 1];
            if (pivot > 1)
            {
                int offset = (n - r) % p;
                for (int k = p - 1; k < r; k += p)
                {
                    numerator[k - offset] /= pivot;
                    denominator[k] /= pivot;
                }
            }
        }
        long result = 1;
        for (int k = 0; k < r; k++) if (numerator[k] > 1) result = result * numerator[k] % Mod;
        return result;
    }
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード