結果
| 問題 | No.660 家を通り過ぎないランダムウォーク問題 |
| ユーザー |
 te-sh
|
| 提出日時 | 2020-01-26 14:43:26 |
| 言語 | D (dmd 2.106.1) |
| 結果 |
CE
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 5,815 bytes |
| コンパイル時間 | 549 ms |
| コンパイル使用メモリ | 134,616 KB |
| 最終ジャッジ日時 | 2024-11-14 22:04:10 |
| 合計ジャッジ時間 | 1,207 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge5 |
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/format/internal/write.d(143): Error: cannot implicitly convert expression `obj` of type `const(ModInt!(1000000007, false))` to `int` /home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/format/write.d(1239): Error: template instance `std.format.internal.write.formatValueImpl!(Appender!string, ModInt!(1000000007, false), char)` error instantiating /home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/format/write.d(632): instantiated from here: `formatValue!(Appender!string, ModInt!(1000000007, false), char)` /home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/format/package.d(779): instantiated from here: `formattedWrite!(Appender!string, char, ModInt!(1000000007, false))` Main.d(185): instantiated from here: `format!(char, ModInt!(1000000007, false))` Main.d(163): instantiated from here: `putA!(ModInt!(1000000007, false))` Main.d(18): instantiated from here: `put!(false, ModInt!(1000000007, false))` /home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/format/internal/write.d(143): Error: cannot implicitly convert expression `obj` of type `const(ModInt!(1000000007, false))` to `int` /home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/format/write.d(1239): Error: template instance `std.format.internal.write.formatValueImpl!(LockingTextWriter, ModInt!(1000000007, false), char)` error instantiating /home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/format/write.d(632): instantiated from here: `formatValue!(LockingTextWriter, ModInt!(1000000007, false), char)` /home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/stdio.d(1759): instantiated from here: `formattedWrite!(LockingTextWriter, char, ModInt!(1000000007, false))` Main.d(186): instantiated from here: `write!(ModInt!(1000000007, false))` Main.d(163): instantiated from here: `putA!(ModInt!(1000000007, false))` Main.d(18): instantiated from here: `put!(false, Mo
ソースコード
// URL: https://yukicoder.me/problems/no/660
import std.algorithm, std.array, std.container, std.math, std.range, std.typecons, std.string;
version(unittest) {} else
void main()
{
int N; io.getV(N);
auto fact = Fact!mint(N*2);
auto ans = mint(0);
for (auto k = N; k <= N*2; k += 2) {
auto a = (k+N)/2, b = (k-N)/2;
ans += fact.combi(a+b-1, b) - fact.combi(a+b-1, b-1);
}
io.put(ans);
}
struct Fact(T, bool inv = true)
{
int n;
T[] table;
alias table this;
static if (inv) T[] invTable;
this(int n)
{
this.n = n;
table = new T[](n+1); table[0] = 1;
foreach (i; 1..n+1) table[i] = table[i-1]*i;
static if (inv) {
invTable = new T[](n+1); invTable[n] = T(1)/table[n];
foreach_reverse (i; 1..n+1) invTable[i-1] = invTable[i]*i;
}
}
static if (inv) {
pure T perm(size_t a, size_t b) in { assert(n >= a && a >= b); } do
{ return table[a]*invTable[a-b]; }
pure T combi(size_t a, size_t b) in { assert(n >= a && a >= b); } do
{ return table[a]*invTable[b]*invTable[a-b]; }
pure T homo(size_t a, size_t b) in { assert(n >= a+b-1); } do
{ return combi(a+b-1, b); }
}
}
const mod = 10^^9+7;
alias mint = ModInt!mod;
pure T isqrt(T)(T n)
{
static if (is(T == int)) auto max = 46341;
else static if (is(T == long)) auto max = 3037000500L;
auto bs = iota(T(0), max).map!(x => tuple(x, x^^2)).assumeSorted!"a[1]<=b[1]";
return bs.lowerBound(tuple(0, n)).back[0];
}
pure T icbrt(T)(T n)
{
static if (is(T == int)) auto max = 1291;
else static if (is(T == long)) auto max = 2097152L;
auto bs = iota(T(0), max).map!(x => tuple(x, x^^3)).assumeSorted!"a[1]<=b[1]";
return bs.lowerBound(tuple(0, n)).back[0];
}
pure T powr(alias pred = "a*b", T, U)(T a, U n, T one)
{
import std.functional;
alias predFun = binaryFun!pred;
if (n == 0) return one;
auto r = one;
for (; n > 0; n >>= 1) { if (n&1) r = predFun(r, a); a = predFun(a, a); }
return r;
}
pure T powr(alias pred = "a*b", T, U)(T a, U n) { return powr!(pred, T, U)(a, n, T(1)); }
pure T extGcd(T)(T a, T b, out T x, out T y)
{
auto g = a; x = 1; y = 0;
if (b) { g = extGcd(b, a%b, y, x); y -= a/b*x; }
return g;
}
struct ModInt(int m, bool pos = false)
{
version(BigEndian) union { long l; struct { int i2; int i; } } else union { long l; int i; }
alias M = ModInt!(m, pos), Op = string;
@property static init() { return M(0); }
@property int value() { return i; }
@property void value(int v) { i = nm(v); }
alias value this;
this(T)(T v = 0) { i = nm(v); }
ref M opAssign(T)(T v) { i = nm(v); return this; }
static if (!pos) pure M opUnary(Op op: "-")() { return M(-i); }
static if (m < int.max / 2) {
pure M opBinary(Op op)(int r) if(op=="+"||!pos&&op=="-") { return M(mixin("i"~op~"r")); }
ref M opOpAssign(Op op)(int r) if(op=="+"||!pos&&op=="-") { i=nm(mixin("i"~op~"r")); return this; }
} else {
pure M opBinary(Op op)(int r) if(op=="+"||!pos&&op=="-") { return M(mixin("l"~op~"r")); }
ref M opOpAssign(Op op)(int r) if(op=="+"||!pos&&op=="-") { i=nm(mixin("l"~op~"r")); return this; }
}
pure M opBinary(Op op: "*")(int r) { return M(l*r); }
ref M opOpAssign(Op op: "*")(int r) { i=nm(l*r); return this; }
pure M opBinary(Op op)(M r) if(op=="+"||!pos&&op=="-"||op=="*") { return opBinary!op(r.i); }
ref M opOpAssign(Op op)(M r) if(op=="+"||!pos&&op=="-"||op=="*") { return opOpAssign!op(r.i); }
pure M opBinary(Op op: "^^", T)(T n) { return this.powr(n); }
static if (!pos) {
pure M opBinary(Op op: "/")(M r) { return M(l*r.inv.i); }
ref M opOpAssign(Op op: "/")(M r) { i=nm(l*r.inv.i); return this; }
pure M opBinary(Op op: "/")(int r) { return opBinary!op(M(r)); }
ref M opOpAssign(Op op: "/")(int r) { return opOpAssign!op(M(r)); }
pure M inv() { int x = i, a, b; extGcd(x, m, a, b); return M(a); }
}
private
{
pure int nm(int v) { static if (pos) return v%m; else return (v%m+m)%m; }
pure int nm(long v) { static if (pos) return cast(int)(v%m); else return cast(int)((v%m+m)%m); }
}
}
auto io = IO!()();
import std.stdio;
struct IO(string floatFormat = "%.10f", string delimiter = " ", alias IN = stdin, alias OUT = stdout)
{
import std.conv, std.format, std.meta, std.traits;
alias assignable = hasAssignableElements;
auto getV(T...)(ref T v) { foreach (ref w; v) get(w); }
auto getA(T)(size_t n, ref T v) if (assignable!T) { v = new T(n); foreach (ref w; v) get(w); }
auto getC(T...)(size_t n, ref T v) if (allSatisfy!(assignable, T))
{
foreach (ref w; v) w = new typeof(w)(n);
foreach (i; 0..n) foreach (ref w; v) get(w[i]);
}
auto getM(T)(size_t r, size_t c, ref T v) if (assignable!T && assignable!(ElementType!T))
{
v = new T(r); foreach (ref w; v) getA(c, w);
}
template getS(E...)
{
auto getS(T)(size_t n, ref T v)
{
v = new T(n); foreach (ref w; v) foreach (e; E) mixin("get(w."~e~");");
}
}
auto put(bool flush = false, T...)(T v)
{
foreach (i, w; v) { putA(w); if (i < v.length-1) OUT.write(delimiter); }
OUT.writeln;
static if (flush) OUT.flush();
}
auto putB(S, T)(bool c, S t, T f) { if (c) put(t); else put(f); }
auto putRaw(T...)(T v) { OUT.write(v); OUT.writeln; }
private
{
dchar[] buf;
auto sp = (new dchar[](0)).splitter;
void nextLine() { IN.readln(buf); sp = buf.splitter; }
auto get(T)(ref T v) { if (sp.empty) nextLine(); v = sp.front.to!T; sp.popFront(); }
auto putR(T)(T v)
{
auto w = v;
while (!w.empty) { putA(w.front); w.popFront(); if (!w.empty) OUT.write(delimiter); }
}
auto putA(T)(T v)
{
static if (isInputRange!T && !isSomeString!T) putR(v);
else if (isFloatingPoint!T) OUT.write(format(floatFormat, v));
else OUT.write(v);
}
}
}