結果
問題 | No.916 Encounter On A Tree |
ユーザー | Coki628 |
提出日時 | 2020-08-07 15:46:51 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,955 bytes |
コンパイル時間 | 236 ms |
コンパイル使用メモリ | 82,532 KB |
実行使用メモリ | 68,932 KB |
最終ジャッジ日時 | 2024-09-24 07:51:08 |
合計ジャッジ時間 | 5,027 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 36 ms
53,676 KB |
testcase_01 | AC | 37 ms
54,368 KB |
testcase_02 | AC | 67 ms
67,352 KB |
testcase_03 | AC | 67 ms
66,824 KB |
testcase_04 | AC | 66 ms
67,632 KB |
testcase_05 | AC | 66 ms
68,296 KB |
testcase_06 | AC | 65 ms
67,588 KB |
testcase_07 | AC | 69 ms
67,812 KB |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | AC | 36 ms
53,456 KB |
testcase_11 | WA | - |
testcase_12 | AC | 65 ms
67,596 KB |
testcase_13 | WA | - |
testcase_14 | AC | 67 ms
67,404 KB |
testcase_15 | WA | - |
testcase_16 | AC | 47 ms
61,104 KB |
testcase_17 | AC | 68 ms
68,252 KB |
testcase_18 | AC | 36 ms
54,380 KB |
testcase_19 | AC | 67 ms
67,484 KB |
testcase_20 | AC | 66 ms
67,516 KB |
testcase_21 | AC | 66 ms
67,876 KB |
testcase_22 | AC | 66 ms
67,048 KB |
testcase_23 | AC | 67 ms
67,604 KB |
testcase_24 | AC | 67 ms
67,472 KB |
testcase_25 | AC | 67 ms
68,932 KB |
testcase_26 | AC | 54 ms
63,316 KB |
testcase_27 | AC | 55 ms
64,688 KB |
testcase_28 | AC | 47 ms
61,636 KB |
testcase_29 | AC | 67 ms
68,708 KB |
testcase_30 | AC | 67 ms
68,280 KB |
testcase_31 | AC | 67 ms
67,060 KB |
testcase_32 | AC | 67 ms
68,048 KB |
testcase_33 | AC | 54 ms
62,692 KB |
testcase_34 | AC | 48 ms
61,168 KB |
testcase_35 | AC | 44 ms
61,124 KB |
testcase_36 | WA | - |
testcase_37 | AC | 67 ms
67,524 KB |
testcase_38 | AC | 47 ms
61,552 KB |
testcase_39 | AC | 67 ms
67,484 KB |
testcase_40 | WA | - |
testcase_41 | WA | - |
testcase_42 | AC | 37 ms
53,216 KB |
testcase_43 | AC | 36 ms
53,888 KB |
testcase_44 | AC | 37 ms
53,208 KB |
testcase_45 | AC | 43 ms
61,132 KB |
testcase_46 | AC | 35 ms
53,364 KB |
testcase_47 | WA | - |
testcase_48 | AC | 35 ms
53,508 KB |
testcase_49 | WA | - |
testcase_50 | AC | 36 ms
54,964 KB |
testcase_51 | WA | - |
testcase_52 | AC | 36 ms
53,648 KB |
testcase_53 | WA | - |
testcase_54 | AC | 36 ms
53,452 KB |
testcase_55 | AC | 35 ms
53,624 KB |
testcase_56 | AC | 37 ms
53,444 KB |
testcase_57 | AC | 40 ms
59,784 KB |
testcase_58 | WA | - |
testcase_59 | AC | 40 ms
59,352 KB |
testcase_60 | AC | 40 ms
59,124 KB |
ソースコード
import sys from math import log2 def input(): return sys.stdin.readline().strip() def list2d(a, b, c): return [[c] * b for i in range(a)] def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)] def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)] def ceil(x, y=1): return int(-(-x // y)) def INT(): return int(input()) def MAP(): return map(int, input().split()) def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)] def Yes(): print('Yes') def No(): print('No') def YES(): print('YES') def NO(): print('NO') sys.setrecursionlimit(10 ** 9) INF = 10 ** 19 MOD = 10 ** 9 + 7 EPS = 10 ** -10 class ModTools: """ 階乗・逆元用のテーブルを構築する """ def __init__(self, MAX, MOD): # nCrならn、nHrならn+rまで作る MAX += 1 self.MAX = MAX self.MOD = MOD factorial = [1] * MAX factorial[0] = factorial[1] = 1 for i in range(2, MAX): factorial[i] = factorial[i-1] * i % MOD inverse = [1] * MAX inverse[MAX-1] = pow(factorial[MAX-1], MOD-2, MOD) for i in range(MAX-2, -1, -1): inverse[i] = inverse[i+1] * (i+1) % MOD self.fact = factorial self.inv = inverse D, L, R, K = MAP() vcnt = [0] * (D+1) for d in range(1, D+1): vcnt[d] = 2**(d-1) mt = ModTools(vcnt[D], MOD) ld = int(log2(L)) + 1 rd = int(log2(R)) + 1 for lcad in range(1, min(ld, rd)+1): k = (ld - lcad) + (rd - lcad) if k == K: lcacnt = vcnt[lcad] lcnt = vcnt[ld-lcad] rcnt = vcnt[rd-lcad] ans = lcacnt * lcnt * rcnt * 2 % MOD for d in range(1, D+1): others = vcnt[d] if d == ld: others -= 1 if d == rd: others -= 1 ans *= mt.fact[others] ans %= MOD print(ans) break else: print(0)