結果
問題 | No.978 Fibonacci Convolution Easy |
ユーザー | 👑 hos.lyric |
提出日時 | 2020-01-31 21:28:38 |
言語 | D (dmd 2.106.1) |
結果 |
AC
|
実行時間 | 96 ms / 2,000 ms |
コード長 | 3,298 bytes |
コンパイル時間 | 1,637 ms |
コンパイル使用メモリ | 155,220 KB |
実行使用メモリ | 11,384 KB |
最終ジャッジ日時 | 2024-06-22 04:48:53 |
合計ジャッジ時間 | 3,197 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 3 ms
6,816 KB |
testcase_01 | AC | 38 ms
6,940 KB |
testcase_02 | AC | 20 ms
6,944 KB |
testcase_03 | AC | 93 ms
10,460 KB |
testcase_04 | AC | 24 ms
6,940 KB |
testcase_05 | AC | 6 ms
6,940 KB |
testcase_06 | AC | 34 ms
6,944 KB |
testcase_07 | AC | 60 ms
7,540 KB |
testcase_08 | AC | 43 ms
6,940 KB |
testcase_09 | AC | 69 ms
9,328 KB |
testcase_10 | AC | 95 ms
11,384 KB |
testcase_11 | AC | 28 ms
6,944 KB |
testcase_12 | AC | 5 ms
6,944 KB |
testcase_13 | AC | 33 ms
6,940 KB |
testcase_14 | AC | 10 ms
6,944 KB |
testcase_15 | AC | 38 ms
6,944 KB |
testcase_16 | AC | 96 ms
10,784 KB |
testcase_17 | AC | 96 ms
10,716 KB |
testcase_18 | AC | 1 ms
6,940 KB |
testcase_19 | AC | 1 ms
6,940 KB |
testcase_20 | AC | 1 ms
6,944 KB |
ソースコード
import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } struct ModInt(int M_) { alias M = M_; int x; this(ModInt a) { x = a.x; } this(long a) { x = cast(int)(a % M); if (x < 0) x += M; } ref ModInt opAssign(long a) { return (this = ModInt(a)); } ref ModInt opOpAssign(string op)(ModInt a) { static if (op == "+") { x += a.x; if (x >= M) x -= M; } else static if (op == "-") { x -= a.x; if (x < 0) x += M; } else static if (op == "*") { x = cast(int)((cast(long)(x) * a.x) % M); } else static if (op == "/") { this *= a.inv(); } else static assert(false); return this; } ref ModInt opOpAssign(string op)(long a) { static if (op == "^^") { ModInt t2 = this, te = ModInt(1); for (long e = a; e; e >>= 1) { if (e & 1) te *= t2; t2 *= t2; } x = cast(int)(te.x); return this; } else return mixin("this " ~ op ~ "= ModInt(a)"); } ModInt inv() const { int a = x, b = M, y = 1, z = 0, t; for (; ; ) { t = a / b; a -= t * b; if (a == 0) { assert(b == 1 || b == -1); return ModInt(b * z); } y -= t * z; t = b / a; b -= t * a; if (b == 0) { assert(a == 1 || a == -1); return ModInt(a * y); } z -= t * y; } } ModInt opUnary(string op)() const if (op == "-") { return ModInt(-x); } ModInt opBinary(string op, T)(T a) const { return mixin("ModInt(this) " ~ op ~ "= a"); } ModInt opBinaryRight(string op)(long a) const { return mixin("ModInt(a) " ~ op ~ "= this"); } string toString() const { return x.to!string; } } enum MO = 1000000007; alias Mint = ModInt!MO; void main() { try { for (; ; ) { const N = readInt(); const P = Mint(readLong()); auto as = new Mint[N + 1]; as[1] = 0; as[2] = 1; foreach (n; 3 .. N + 1) { as[n] = P * as[n - 1] + as[n - 2]; } debug { if (N <= 10) { writeln("as = ", as); } } Mint ans = as[1 .. N + 1].sum^^2; foreach (n; 1 .. N + 1) { ans += as[n]^^2; } ans /= 2; writeln(ans); } } catch (EOFException e) { } }