結果
問題 | No.2367 Painting Gascket |
ユーザー |
👑 |
提出日時 | 2023-06-30 21:33:21 |
言語 | D (dmd 2.106.1) |
結果 |
AC
|
実行時間 | 15 ms / 2,000 ms |
コード長 | 4,118 bytes |
コンパイル時間 | 4,211 ms |
コンパイル使用メモリ | 150,696 KB |
実行使用メモリ | 4,384 KB |
最終ジャッジ日時 | 2023-09-21 15:22:05 |
合計ジャッジ時間 | 5,700 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,376 KB |
testcase_01 | AC | 1 ms
4,376 KB |
testcase_02 | AC | 2 ms
4,380 KB |
testcase_03 | AC | 1 ms
4,376 KB |
testcase_04 | AC | 1 ms
4,380 KB |
testcase_05 | AC | 1 ms
4,376 KB |
testcase_06 | AC | 2 ms
4,376 KB |
testcase_07 | AC | 1 ms
4,376 KB |
testcase_08 | AC | 15 ms
4,380 KB |
testcase_09 | AC | 11 ms
4,380 KB |
testcase_10 | AC | 2 ms
4,376 KB |
testcase_11 | AC | 13 ms
4,376 KB |
testcase_12 | AC | 1 ms
4,376 KB |
testcase_13 | AC | 5 ms
4,380 KB |
testcase_14 | AC | 3 ms
4,380 KB |
testcase_15 | AC | 3 ms
4,380 KB |
testcase_16 | AC | 6 ms
4,376 KB |
testcase_17 | AC | 14 ms
4,376 KB |
testcase_18 | AC | 11 ms
4,376 KB |
testcase_19 | AC | 7 ms
4,376 KB |
testcase_20 | AC | 14 ms
4,380 KB |
testcase_21 | AC | 9 ms
4,380 KB |
testcase_22 | AC | 14 ms
4,380 KB |
testcase_23 | AC | 11 ms
4,380 KB |
testcase_24 | AC | 5 ms
4,376 KB |
testcase_25 | AC | 5 ms
4,380 KB |
testcase_26 | AC | 2 ms
4,376 KB |
testcase_27 | AC | 12 ms
4,380 KB |
testcase_28 | AC | 10 ms
4,380 KB |
testcase_29 | AC | 2 ms
4,376 KB |
testcase_30 | AC | 2 ms
4,384 KB |
testcase_31 | AC | 1 ms
4,376 KB |
testcase_32 | AC | 1 ms
4,380 KB |
testcase_33 | AC | 8 ms
4,380 KB |
testcase_34 | AC | 9 ms
4,380 KB |
testcase_35 | AC | 12 ms
4,376 KB |
testcase_36 | AC | 15 ms
4,376 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; } 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(uint M_) { import std.conv : to; alias M = M_; uint x; this(ModInt a) { x = a.x; } this(uint x_) { x = x_ % M; } this(ulong x_) { x = cast(uint)(x_ % M); } this(int x_) { x = ((x_ %= cast(int)(M)) < 0) ? (x_ + cast(int)(M)) : x_; } this(long x_) { x = cast(uint)(((x_ %= cast(long)(M)) < 0) ? (x_ + cast(long)(M)) : x_); } ref ModInt opAssign(T)(inout(T) a) if (is(T == uint) || is(T == ulong) || is(T == int) || is(T == long)) { return this = ModInt(a); } ref ModInt opOpAssign(string op, T)(T a) { static if (is(T == ModInt)) { static if (op == "+") { x = ((x += a.x) >= M) ? (x - M) : x; } else static if (op == "-") { x = ((x -= a.x) >= M) ? (x + M) : x; } else static if (op == "*") { x = cast(uint)((cast(ulong)(x) * a.x) % M); } else static if (op == "/") { this *= a.inv(); } else static assert(false); return this; } else static if (op == "^^") { if (a < 0) return this = inv()^^(-a); ModInt b = this, c = 1U; for (long e = a; e; e >>= 1) { if (e & 1) c *= b; b *= b; } return this = c; } else { return mixin("this " ~ op ~ "= ModInt(a)"); } } ModInt inv() const { uint a = M, b = x; int y = 0, z = 1; for (; b; ) { const q = a / b; const c = a - q * b; a = b; b = c; const w = y - cast(int)(q) * z; y = z; z = w; } assert(a == 1); return ModInt(y); } ModInt opUnary(string op)() const { static if (op == "+") { return this; } else static if (op == "-") { ModInt a; a.x = x ? (M - x) : 0U; return a; } else static assert(false); } ModInt opBinary(string op, T)(T a) const { return mixin("ModInt(this) " ~ op ~ "= a"); } ModInt opBinaryRight(string op, T)(T a) const { return mixin("ModInt(a) " ~ op ~ "= this"); } bool opCast(T: bool)() const { return (x != 0U); } string toString() const { return x.to!string; } } enum MO = 10^^9 + 7; alias Mint = ModInt!MO; void main() { try { for (; ; ) { const K = readInt; const N = readInt; const Mint n0 = N; const Mint n1 = max(N - 1, 0); const Mint n2 = max(N - 2, 0); const Mint n3 = max(N - 3, 0); Mint f = n0; Mint f0 = n1; Mint f00 = n1; Mint f01 = n2; Mint f000 = n1; Mint f001 = n2; Mint f012 = n3; foreach (k; 0 .. K) { const g = n0 * f0 * f0 * f0; const g0 = f0 * f00 * f00 + n1 * f0 * f01 * f01; const g00 = f00 * f00 * f000 + n1 * f01 * f01 * f001; const g01 = 2 * f00 * f01 * f001 + n2 * f01 * f01 * f012; const g000 = f000 * f000 * f000 + n1 * f001 * f001 * f001; const g001 = f000 * f001 * f001 + f001 * f001 * f001 + n2 * f001 * f012 * f012; const g012 = 3 * f001 * f001 * f012 + n3 * f012 * f012 * f012; f = g; f0 = g0; f00 = g00; f01 = g01; f000 = g000; f001 = g001; f012 = g012; } writeln(f); } } catch (EOFException e) { } }