#419752 (C#(csc)) No.346 チワワ数え上げ問題

• 問題: No.346 チワワ数え上げ問題
• ユーザー: eSeF
• 提出日時: 2020-01-19 03:30:46
• 言語: C#(csc) (csc 3.9.0)
• 結果: WA
• 実行時間: -
• コード長: 5,351 bytes
• コンパイル時間: 1,037 ms
• コンパイル使用メモリ: 111,616 KB
• 実行使用メモリ: 19,200 KB
• 最終ジャッジ日時: 2024-06-28 18:53:38
• 合計ジャッジ時間: 6,633 ms
• ジャッジサーバーID （参考情報）: judge2 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	185 ms; 18,688 KB
testcase_01	AC	185 ms; 18,816 KB
testcase_02	AC	181 ms; 18,816 KB
testcase_03	AC	177 ms; 18,816 KB
testcase_04	AC	177 ms; 18,688 KB
testcase_05	AC	180 ms; 18,688 KB
testcase_06	AC	180 ms; 18,816 KB
testcase_07	AC	178 ms; 18,688 KB
testcase_08	AC	178 ms; 18,688 KB
testcase_09	AC	180 ms; 18,816 KB
testcase_10	AC	185 ms; 19,200 KB
testcase_11	AC	180 ms; 18,944 KB
testcase_12	AC	181 ms; 19,200 KB
testcase_13	AC	181 ms; 18,944 KB
testcase_14	AC	183 ms; 18,688 KB
testcase_15	AC	184 ms; 18,816 KB
testcase_16	AC	182 ms; 18,944 KB
testcase_17	AC	184 ms; 18,944 KB
testcase_18	AC	185 ms; 19,072 KB
testcase_19	AC	188 ms; 19,072 KB
testcase_20	AC	196 ms; 18,944 KB
testcase_21	WA	-
testcase_22	WA	-
testcase_23	AC	199 ms; 18,816 KB
testcase_24	AC	192 ms; 18,816 KB
testcase_25	AC	185 ms; 18,688 KB

コンパイルメッセージ

Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Text;
using static System.Math;
using static System.Array;
using static AtCoder.Tool;
using static AtCoder.CalcL;
namespace AtCoder
{
    class AC
    {
        const int MOD = 1000000007;
        const int INF = int.MaxValue / 2;
        const long SINF = long.MaxValue / 2;
        const double EPS = 1e-8;
        static readonly int[] dI = { 0, 1, 0, -1 };
        static readonly int[] dJ = { 1, 0, -1, 0 };
        //static List<List<int>> G = new List<List<int>>();
        //static List<List<Edge>>G = new List<List<Edge>>();
        //static List<Edge> E = new List<Edge>();
        static void Main(string[] args)
        {
            //var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
            //Console.SetOut(sw);
            var cin = new Scanner();

            var s = Console.ReadLine();
            long w = s.Count(x => x == 'w');
            var md = new Modulo(100010);
            var ncr = new long[100010];
            for (var i = 0; i < 100010; i++) ncr[i] = md.Ncr(i, 2);
            long ans = 0;
            for(var i = 0; i < s.Length; i++)
            {
                if (s[i] == 'w') { w--; }
                else if (s[i] == 'c')
                {
                    ans += ncr[w];
                }
            }
            Console.WriteLine(ans);
            


            //Console.Out.Flush();
        }
        struct Edge
        {
            public int from;

            public int to;
            public long dist;
            public Edge(int t, long c)
            {
                from = -1;
                to = t;
                dist = c;
            }
            public Edge(int f, int t, long c)
            {
                from = f;
                to = t;
                dist = c;
            }

        }
    }
    public class Scanner
    {
        public int[] ReadSplitInt()
        {
            return ConvertAll(Console.ReadLine().Split(), int.Parse);
        }
        public long[] ReadSplitLong()
        {
            return ConvertAll(Console.ReadLine().Split(), long.Parse);
        }
        public double[] ReadSplit_Double()
        {
            return ConvertAll(Console.ReadLine().Split(), double.Parse);
        }
    }
    public static class Tool
    {
        static public void Initialize<T>(ref T[] array, T initialvalue)
        {
            for (var i = 0; i < array.Length; i++)
            {
                array[i] = initialvalue;
            }
        }
        static public void Swap<T>(ref T a, ref T b)
        {
            T keep = a;
            a = b;
            b = keep;
        }

        static public void Display<T>(T[,] array2d, int n, int m)
        {
            for (var i = 0; i < n; i++)
            {
                for (var j = 0; j < m; j++)
                {
                    Console.Write($"{array2d[i, j]} ");
                }
                Console.WriteLine();
            }
        }

        static public long LPow(int a, int b)
        {
            return (long)Pow(a, b);
        }
    }
    static public class CalcI
    {
        public static int Gcd(int a, int b)
        {
            if (a * b == 0) { return Max(a, b); }
            return a % b == 0 ? b : Gcd(b, a % b);
        }
        public static int Lcm(int a, int b)
        {
            int g = Gcd(a, b);
            return a / g * b;
        }
        public static int Ceil(int n, int div)
        {
            return (n + div - 1) / div;
        }
    }
    static public class CalcL
    {
        public static long Gcd(long a, long b)
        {
            if (a * b == 0) { return Max(a, b); }
            return a % b == 0 ? b : Gcd(b, a % b);
        }
        public static long Lcm(long a, long b)
        {
            long g = Gcd(a, b);
            return a / g * b;
        }
        public static long Ceil(long n, long div)
        {
            return (n + div - 1) / div;
        }
    }
    class Modulo
    {
        private const int M = 1000000007;
        private readonly int[] m_facs;
        public int Mul(int a, int b)
        {
            return (int)(Math.BigMul(a, b) % M);
        }
        public Modulo(int n)
        {
            m_facs = new int[n + 1];
            m_facs[0] = 1;
            for (int i = 1; i <= n; ++i)
            {
                m_facs[i] = Mul(m_facs[i - 1], i);
            }
        }
        public int Fac(int n)
        {
            return m_facs[n];
        }
        public int Pow(int a, int m)
        {
            switch (m)
            {
                case 0:
                    return 1;
                case 1:
                    return a;
                default:
                    int p1 = Pow(a, m / 2);
                    int p2 = Mul(p1, p1);
                    return ((m % 2) == 0) ? p2 : Mul(p2, a);
            }
        }
        public int Div(int a, int b)
        {
            return Mul(a, Pow(b, M - 2));
        }
        public int Ncr(int n, int r)
        {
            if (n < r) { return 0; }
            if (n == r) { return 1; }
            int res = Fac(n);
            res = Div(res, Fac(r));
            res = Div(res, Fac(n - r));
            return res;
        }
        public Modulo() { }
    }
}