#1197645 (C#) No.584 赤、緑、青の色塗り

• 問題: No.584 赤、緑、青の色塗り
• ユーザー: 👑 kakel-san
• 提出日時: 2026-11-08 00:44:17
• 言語: C# (.NET 10.0.403 + ACL)
• 結果: WA
• 実行時間: -
• コード長: 3,930 bytes
• コンパイル時間: 11,958 ms
• コンパイル使用メモリ: 174,344 KB
• 実行使用メモリ: 33,536 KB
• 最終ジャッジ日時: 2026-11-08 00:44:33
• 合計ジャッジ時間: 11,708 ms
• ジャッジサーバーID （参考情報）: judge1_0 / judge4_0

ファイルパターン	結果
sample	AC * 6
other	AC * 14 WA * 2

コンパイルメッセージ

  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (187 ミリ秒)。
  main -> /home/judge/data/code/bin/Release/net10.0/main.dll
  main -> /home/judge/data/code/bin/Release/net10.0/publish/

ソースコード

using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, r, g, b) = (c[0], c[1], c[2], c[3]);
        WriteLine(Draw(n, r, g, b));
    }
    static long Draw(int n, int r, int g, int b)
    {
        var wmin = n / 3;
        if (n - wmin < r + g + b) return 0;
        if (r + g + b == 0) return 0;
        var w = n - r - g - b;
        var mod = 1_000_000_007;
        var ncr = new NCR(n, mod);
        var memo = new long[(r + g + b) / 2 + 1];
        var ans = 0L;
        for (var two = 0; two * 2 <= r + g + b; ++two)
        {
            var groups = r + g + b - two;
            for (var r2 = 0; r2 * 2 <= r && r2 <= two; ++r2) for (var g2 = 0; g2 * 2 <= g && r2 + g2 <= two; ++g2)
            {
                var b2 = two - r2 - g2;
                if (b2 * 2 > b) continue;
                var count = ncr.Calc(two, r2) * ncr.Calc(two - r2, g2) % mod;
                memo[two] = (memo[two] + ncr.Calc(r - r2 * 2 + g - g2 * 2 + b - b2 * 2, r - r2 * 2)
                    * ncr.Calc(g - g2 * 2 + b - b2 * 2, g - g2 * 2) % mod * count % mod) % mod;
            }
            if (w < groups - 1) continue;
            var sub = ncr.Calc(r + g + b, r) * ncr.Calc(g + b, g) % mod;
            for (var i = 1; i <= two; ++i)
            {
                if (i % 2 == 0) sub = (sub + memo[i] * ncr.Calc(two, i) % mod) % mod;
                else sub = (sub - memo[i] * ncr.Calc(two, i) % mod + mod) % mod;
            }
            ans = (ans + sub * ncr.Calc(groups, two) % mod * ncr.Calc(w + 1, groups) % mod) % mod;
        }
        return ans;
    }
    class NCR
    {
        int[] facts;
        int[] revFacts;
        int mod;
        public NCR(int n, int mod)
        {
            facts = new int[n + 1];
            revFacts = new int[n + 1];
            this.mod = mod;
            facts[0] = 1;
            var tmp = 1L;
            for (var i = 1; i <= n; ++i)
            {
                tmp = tmp * i % mod;
                facts[i] = (int)tmp;
            }
            tmp = Exp(facts[n], mod - 2);
            revFacts[n] = (int)tmp;
            for (var i = n; i > 1; --i)
            {
                tmp = tmp * i % mod;
                revFacts[i - 1] = (int)tmp;
            }
            revFacts[0] = 1;
        }
        public long Exp(long n, long k)
        {
            n = n % mod;
            if (k == 0) return 1;
            if (k == 1) return n;
            var half = Exp(n, k / 2);
            var result = half * half % mod;
            return ((k % 2) == 0) ? result : (result * n % mod);
        }
        public long Calc(int n, int r)
        {
            return (long)facts[n] * revFacts[r] % mod * revFacts[n - r] % mod;
        }
        /// <summary>nが大きくrが小さい場合の計算</summary>
        public long Calc2(int n, int r)
        {
            var tmp = 1L;
            for (var i = 0; i < r; ++i)
            {
                tmp = tmp * (n - i) % mod;
            }
            return tmp * revFacts[r] % mod;
        }
        public long NPR(int n, int r)
        {
            return (long)facts[n] * revFacts[n - r] % mod;
        }
        public long Fact(int n)
        {
            return facts[n];
        }
        public long RevFact(int n)
        {
            return revFacts[n];
        }
        public long Inverse(int n)
        {
            return (long)revFacts[n] * facts[n - 1] % mod;
        }
    }
}