#30724 (C#(csc)) No.214 素数サイコロと合成数サイコロ (3-Medium)

• 問題: No.214 素数サイコロと合成数サイコロ (3-Medium)
• ユーザー: 紙ぺーぱー
• 提出日時: 2015-06-04 09:01:12
• 言語: C#(csc) (csc 3.9.0)
• 結果: TLE (最新)
  AC
  (最初)
• 実行時間: -
• コード長: 7,962 bytes
• コンパイル時間: 1,177 ms
• コンパイル使用メモリ: 120,488 KB
• 実行使用メモリ: 26,264 KB
• 最終ジャッジ日時: 2024-07-06 14:06:34
• 合計ジャッジ時間: 11,892 ms
• ジャッジサーバーID （参考情報）: judge2 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2,182 ms; 23,928 KB
testcase_01	AC	2,874 ms; 24,292 KB
testcase_02	TLE	-

コンパイルメッセージ

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

ソースコード

using System;
using System.Linq;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;
//using System.Threading.Tasks;
namespace Program
{

    public class Solver
    {
        public void Solve()
        {
            var n = sc.Long();
            var p = sc.Integer();
            var c = sc.Integer();
            var a = new int[] { 2, 3, 5, 7, 11, 13 };
            var b = new int[] { 4, 6, 8, 9, 10, 12 };
            var max = 13 * p + 12 * c;
            const int w = 13 * 50 + 1;
            const int h = 12 * 50 + 1;
            const uint mod = (int)1e9 + 7;
            var C = new uint[max];
            var A = new uint[51 * (13 * 50 + 1)];
            var B = new uint[51 * (12 * 50 + 1)];
            A[0] = B[0] = 1;
            for (int k = 0; k < 6; k++)
                for (int i = 0; i < 50; i++)
                    for (int j = 0; j < w; j++)
                        if (A[i * w + j] > 0) A[(i + 1) * w + j + a[k]] += A[i * w + j];
            for (int k = 0; k < 6; k++)
                for (int i = 0; i < 50; i++)
                    for (int j = 0; j < h; j++)
                        if (B[i * h + j] > 0) B[(i + 1) * h + j + b[k]] += B[i * h + j];
            for (int i = 0; i < w; i++) if (A[p * w + i] > 0)
                    for (int j = 0; j < h; j++)
                        if (B[c * h + j] > 0)
                            C[max - i - j] = ((C[max - i - j] + (uint)(1ul * A[p * w + i] * B[c * h + j]) % mod)) % mod;
            var A0 = Enumerate(max, x => 1u);
            var ans = Polynomial.Get(n + max - 1, A0, C, 0);
            IO.Printer.Out.WriteLine(ans);
        }
        public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());
        static T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; }
        static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }
    }
}
#region main
static class Ex
{
    static public string AsString(this IEnumerable<char> ie) { return new string(System.Linq.Enumerable.ToArray(ie)); }
    static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") { return string.Join(st, ie); }
    static public void Main()
    {
        var solver = new Program.Solver();
        solver.Solve();
        Program.IO.Printer.Out.Flush();
    }
}
#endregion
#region Ex
namespace Program.IO
{
    using System.IO;
    using System.Text;
    using System.Globalization;
    public class Printer : StreamWriter
    {
        static Printer() { Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false }; }
        public static Printer Out { get; set; }
        public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
        public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
        public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { }
        public void Write<T>(string format, T[] source) { base.Write(format, source.OfType<object>().ToArray()); }
        public void WriteLine<T>(string format, T[] source) { base.WriteLine(format, source.OfType<object>().ToArray()); }
    }
    public class StreamScanner
    {
        public StreamScanner(Stream stream) { str = stream; }
        public readonly Stream str;
        private readonly byte[] buf = new byte[1024];
        private int len, ptr;
        public bool isEof = false;
        public bool IsEndOfStream { get { return isEof; } }
        private byte read()
        {
            if (isEof) return 0;
            if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } }
            return buf[ptr++];
        }
        public char Char() { byte b = 0; do b = read(); while ((b < 33 || 126 < b) && !isEof); return (char)b; }

        public string Scan()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
                sb.Append(b);
            return sb.ToString();
        }
        public string ScanLine()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b != '\n'; b = (char)read())
                if (b == 0) break;
                else if (b != '\r') sb.Append(b);
            return sb.ToString();
        }
        public long Long()
        {
            if (isEof) return long.MinValue;
            long ret = 0; byte b = 0; var ng = false;
            do b = read();
            while (b != '-' && (b < '0' || '9' < b));
            if (b == '-') { ng = true; b = read(); }
            for (; true; b = read())
            {
                if (b < '0' || '9' < b)
                    return ng ? -ret : ret;
                else ret = ret * 10 + b - '0';
            }
        }
        public int Integer() { return (isEof) ? int.MinValue : (int)Long(); }
        public double Double() { return double.Parse(Scan(), CultureInfo.InvariantCulture); }
        private T[] enumerate<T>(int n, Func<T> f)
        {
            var a = new T[n];
            for (int i = 0; i < n; ++i) a[i] = f();
            return a;
        }

        public char[] Char(int n) { return enumerate(n, Char); }
        public string[] Scan(int n) { return enumerate(n, Scan); }
        public double[] Double(int n) { return enumerate(n, Double); }
        public int[] Integer(int n) { return enumerate(n, Integer); }
        public long[] Long(int n) { return enumerate(n, Long); }
    }
}
#endregion
#region Polynomial
public static class Polynomial
{
    const uint mod = (uint)1e9 + 7;
    static public ulong Get(long n, uint[] A, uint[] C, uint Const)
    {
        var k = C.Length;
        var m = k * 2 - 1;
        polynomial p = new polynomial(k, 0), ret = new polynomial(k, 0), bas = new polynomial(C, Const);
        p.a[1] = ret.a[0] = 1;
        for (; n > 1; n >>= 1)
        {
            if ((n & 1) == 1) ret = multiply(ret, p, bas);
            p = multiply(p, p, bas);
        }
        if ((n & 1) == 1) ret = multiply(ret, p, bas);
        return substitute(ret, A);
    }
    static polynomial multiply(polynomial l, polynomial r, polynomial bas)
    {


        var k = l.a.Length;
        var ret = new uint[k << 1];
        ulong val = 0;
        for (int i = 0; i < k; i++)
        {
            if (l.a[i] == 0) continue;
            for (int j = 0; j < k; j++)
                ret[i + j] = (uint)((ret[i + j] + 1ul * l.a[i] * r.a[j]) % mod);
        }
        /*
        var sum = 0ul;
        for (int i = 0; i < k; i++)
        {
            sum += l.a[i];
            if (sum >= mod) sum -= mod;
        }
        val = (sum * r.val + l.val) % mod;
        */

        for (int i = (k << 1) - 1; i >= k; i--)
        {
            for (int j = 1; j <= k; j++)
            {
                if (bas.a[k - j] == 0) continue;
                ret[i - j] = (uint)((ret[i - j] + 1ul * ret[i] * bas.a[k - j]) % mod);
            }
        }
        /*
        sum = 0ul;
        for (int i = k; i < ret.Length; i++)
        {
            sum += ret[i];
            if (sum >= mod) sum -= mod;
        }
        val = (val + sum * bas.val) % mod;
        */
        var ans = new polynomial();
        ans.a = new uint[k];
        Buffer.BlockCopy(ret, 0, ans.a, 0, sizeof(uint) * k);
        ans.val = val;
        return ans;
    }
    static ulong substitute(polynomial val, uint[] init)
    {
        var ret = val.val;
        for (int i = 0; i < val.a.Length; i++)
            ret = (ret + init[i] * val.a[i]) % mod;
        return ret;
    }
    struct polynomial
    {
        public uint[] a;
        public ulong val;
        public polynomial(int len, ulong v) : this() { a = new uint[len]; val = v; }
        public polynomial(uint[] b, ulong v) : this() { a = b; val = v; }
    }

}

#endregion