結果
| 問題 | No.214 素数サイコロと合成数サイコロ (3-Medium) |
| ユーザー |
 紙ぺーぱー
|
| 提出日時 | 2015-05-24 19:36:55 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 8,155 bytes |
| コンパイル時間 | 4,077 ms |
| コンパイル使用メモリ | 121,124 KB |
| 実行使用メモリ | 28,056 KB |
| 最終ジャッジ日時 | 2024-07-06 08:04:39 |
| 合計ジャッジ時間 | 13,227 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge5 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2,225 ms
24,988 KB |
| testcase_01 | AC | 2,777 ms
28,044 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.Collections.Generic;
using System.Linq;
using Debug = System.Diagnostics.Debug;
using Watch = System.Diagnostics.Stopwatch;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;
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;
var A = Enumerate(p + 1, x => new int[max + 1]);
var B = Enumerate(c + 1, x => new int[max + 1]);
A[0][0] = B[0][0] = 1;
for (int k = 0; k < 6; k++)
for (int i = 0; i < p; i++)
for (int j = 0; j < p * 13; j++)
if (A[i][j] > 0) A[i + 1][j + a[k]] += A[i][j];
for (int k = 0; k < 6; k++)
for (int i = 0; i < c; i++)
for (int j = 0; j < c * 12; j++)
if (B[i][j] > 0) B[i + 1][j + b[k]] += B[i][j];
var C = new ModInteger[max];
for (int i = 0; i <= max; i++)
for (int j = 0; j <= max; j++)
if (A[p][i] > 0 && B[c][j] > 0) C[max - i - j] += A[p][i] * B[c][j];
var V = Enumerate(max, x => new ModInteger(1));
var res = Polynomial.Get(n + max - 1, V, C, 0);
IO.Printer.Out.WriteLine(res);
}
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 void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }
}
}
#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, IEnumerable<T> source) { base.Write(format, source.OfType<object>().ToArray()); }
public void WriteLine<T>(string format, IEnumerable<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); 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 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); }
}
}
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 Polynomial
public static class Polynomial
{
static public ModInteger Get(long n, ModInteger[] A, ModInteger[] C, ModInteger Const)
{
var k = C.Length;
var m = k * 2 - 1;
var c = new ulong[k];
for (int i = 0; i < k; i++)
c[i] = (ulong)C[i].num;
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 > 0; n >>= 1)
{
if ((n & 1) == 1) ret = multiply(ret, p, bas);
p = multiply(p, p, bas);
}
return new ModInteger((long)substitute(ret, A));
}
static polynomial multiply(polynomial l, polynomial r, polynomial bas)
{
const ulong mod = ModInteger.Mod;
var k = l.a.Length;
var ret = new ulong[k << 1];
ulong val = 0;
for (int i = 0; i < k; i++)
for (int j = 0; j < k; j++)
ret[i + j] = (ret[i + j] + l.a[i] * r.a[j]) % mod;
/*
var sum = 0ul;
for (int i = 0; i < k; i++)
sum = (sum + l.a[i]) % mod;
val = ((sum % mod) * r.val + l.val) % mod;
//*/
for (int i = k; i < k << 1; i++)
ret[i] %= mod;
for (int i = (k << 1) - 1; i >= k; i--)
for (int j = 1; j <= k; j++)
ret[i - j] = (ret[i - j] + ret[i] * bas.a[k - j]) % mod;
/*
sum = 0ul;
for (int i = k; i < ret.a.Length; i++)
sum = (sum + ret.a[i]) % mod;
val = (ret.val + (sum % mod) * bas.val) % mod;
//*/
var ans = new polynomial();
ans.a = new ulong[k];
Buffer.BlockCopy(ret, 0, ans.a, 0, sizeof(ulong) * k);
ans.val = val;
return ans;
}
static ulong substitute(polynomial val, ModInteger[] init)
{
var ret = val.val;
for (int i = 0; i < val.a.Length; i++)
ret = (ret + (ulong)init[i].num * val.a[i]) % ModInteger.Mod;
return ret;
}
struct polynomial
{
public ulong[] a;
public ulong val;
public polynomial(int len, ModInteger v) : this() { a = new ulong[len]; val = (ulong)v.num; }
public polynomial(ulong[] b, ModInteger v) : this() { a = b; val = (ulong)v.num; }
}
}
#endregion
#region ModNumber
public partial struct ModInteger
{
public const long Mod = (long)1e9 + 7;
public long num;
public ModInteger(long n) : this() { num = n % Mod; }
public override string ToString() { return num.ToString(); }
public static ModInteger operator +(ModInteger l, ModInteger r) { var n = l.num + r.num; if (n >= Mod)n -= Mod; return new ModInteger(n); }
public static ModInteger operator -(ModInteger l, ModInteger r) { var n = l.num - r.num; if (n < 0)n += Mod; return new ModInteger(n); }
public static ModInteger operator *(ModInteger l, ModInteger r) { return new ModInteger((l.num * r.num) % Mod); }
public static implicit operator ModInteger(long n) { return new ModInteger(n); }
}
#endregion