結果
問題 | No.916 Encounter On A Tree |
ユーザー | 👑 hos.lyric |
提出日時 | 2019-10-25 21:46:03 |
言語 | D (dmd 2.106.1) |
結果 |
AC
|
実行時間 | 42 ms / 2,000 ms |
コード長 | 4,118 bytes |
コンパイル時間 | 1,744 ms |
コンパイル使用メモリ | 153,368 KB |
実行使用メモリ | 19,560 KB |
最終ジャッジ日時 | 2024-06-22 02:55:05 |
合計ジャッジ時間 | 6,158 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 36 ms
17,932 KB |
testcase_01 | AC | 35 ms
18,184 KB |
testcase_02 | AC | 37 ms
19,192 KB |
testcase_03 | AC | 42 ms
17,604 KB |
testcase_04 | AC | 39 ms
19,560 KB |
testcase_05 | AC | 42 ms
18,388 KB |
testcase_06 | AC | 37 ms
18,300 KB |
testcase_07 | AC | 39 ms
17,404 KB |
testcase_08 | AC | 36 ms
16,836 KB |
testcase_09 | AC | 36 ms
18,744 KB |
testcase_10 | AC | 37 ms
17,704 KB |
testcase_11 | AC | 35 ms
16,436 KB |
testcase_12 | AC | 39 ms
17,264 KB |
testcase_13 | AC | 36 ms
17,732 KB |
testcase_14 | AC | 37 ms
17,420 KB |
testcase_15 | AC | 37 ms
18,248 KB |
testcase_16 | AC | 37 ms
18,620 KB |
testcase_17 | AC | 34 ms
16,688 KB |
testcase_18 | AC | 35 ms
17,220 KB |
testcase_19 | AC | 36 ms
17,284 KB |
testcase_20 | AC | 38 ms
17,116 KB |
testcase_21 | AC | 39 ms
17,552 KB |
testcase_22 | AC | 36 ms
17,320 KB |
testcase_23 | AC | 40 ms
18,548 KB |
testcase_24 | AC | 36 ms
16,480 KB |
testcase_25 | AC | 38 ms
17,324 KB |
testcase_26 | AC | 36 ms
17,140 KB |
testcase_27 | AC | 34 ms
16,460 KB |
testcase_28 | AC | 35 ms
17,492 KB |
testcase_29 | AC | 38 ms
17,020 KB |
testcase_30 | AC | 37 ms
17,380 KB |
testcase_31 | AC | 37 ms
18,436 KB |
testcase_32 | AC | 39 ms
18,240 KB |
testcase_33 | AC | 36 ms
17,980 KB |
testcase_34 | AC | 38 ms
16,552 KB |
testcase_35 | AC | 39 ms
17,908 KB |
testcase_36 | AC | 36 ms
16,420 KB |
testcase_37 | AC | 36 ms
17,436 KB |
testcase_38 | AC | 35 ms
17,392 KB |
testcase_39 | AC | 37 ms
17,232 KB |
testcase_40 | AC | 37 ms
18,320 KB |
testcase_41 | AC | 37 ms
16,792 KB |
testcase_42 | AC | 35 ms
17,716 KB |
testcase_43 | AC | 36 ms
18,004 KB |
testcase_44 | AC | 38 ms
17,432 KB |
testcase_45 | AC | 38 ms
16,540 KB |
testcase_46 | AC | 39 ms
18,416 KB |
testcase_47 | AC | 40 ms
17,684 KB |
testcase_48 | AC | 38 ms
16,936 KB |
testcase_49 | AC | 37 ms
18,268 KB |
testcase_50 | AC | 37 ms
17,552 KB |
testcase_51 | AC | 37 ms
17,212 KB |
testcase_52 | AC | 37 ms
18,644 KB |
testcase_53 | AC | 36 ms
17,708 KB |
testcase_54 | AC | 37 ms
19,108 KB |
testcase_55 | AC | 40 ms
17,400 KB |
testcase_56 | AC | 36 ms
18,556 KB |
testcase_57 | AC | 38 ms
16,892 KB |
testcase_58 | AC | 37 ms
17,408 KB |
testcase_59 | AC | 37 ms
16,420 KB |
testcase_60 | AC | 36 ms
17,500 KB |
ソースコード
import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, 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 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 = 10L^^9 + 7; alias Mint = ModInt!MO; enum LIM = 2^^20 + 10; Mint[] inv, fac, invFac; void prepare() { inv = new Mint[LIM]; fac = new Mint[LIM]; invFac = new Mint[LIM]; inv[1] = 1; foreach (i; 2 .. LIM) { inv[i] = -(Mint.M / i) * inv[cast(size_t)(Mint.M % i)]; } fac[0] = invFac[0] = 1; foreach (i; 1 .. LIM) { fac[i] = fac[i - 1] * i; invFac[i] = invFac[i - 1] * inv[i]; } } Mint binom(long n, long k) { if (0 <= k && k <= n) { assert(n < LIM); return fac[cast(size_t)(n)] * invFac[cast(size_t)(k)] * invFac[cast(size_t)(n - k)]; } else { return Mint(0); } } void main() { prepare(); try { for (; ; ) { const D = readInt(); const L = readInt(); const R = readInt(); const K = readInt(); Mint ans = 1; foreach (i; 0 .. D) { ans *= fac[1 << i]; } const A = bsr(L); const B = bsr(R); debug { writefln("D = %s, A = %s, B = %s, K = %s", D, A, B, K); } if (A == B) { if (K % 2 == 0 && 1 <= K / 2 && K / 2 <= A) { ans *= inv[(1 << A) - 1]; ans *= 1 << (K / 2 - 1); } else { ans = 0; } } else { if ((K - (B - A)) % 2 == 0 && B - A <= K && K <= B + A) { ans *= inv[1 << A]; ans *= 1 << max((K - (B - A)) / 2 - 1, 0); } else { ans = 0; } } writeln(ans); } } catch (EOFException e) { } }