Submission #3416376
Source Code Expand
H, W, A, B = map(int, input().split()) MOD = 10 ** 9 + 7 fact = [1] for i in range(1, H + W + 1): fact.append((fact[-1] * i) % MOD) u = {} for i in range(B, W): t = fact[i + H - A - 1] * pow(fact[i] * fact[H - A - 1], MOD - 2, MOD) u[i + 1] = t % MOD ans = 0 for k, v in u.items(): t = fact[W - k + A - 1] * pow(fact[W - k] * fact[A - 1], MOD - 2, MOD) % MOD ans = (ans + t * v) % MOD print(ans)
Submission Info
Submission Time | |
---|---|
Task | D - Iroha and a Grid |
User | poina |
Language | Python (3.4.3) |
Score | 400 |
Code Size | 434 Byte |
Status | AC |
Exec Time | 949 ms |
Memory | 25724 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_01.txt, subtask0_02.txt, subtask0_03.txt, subtask0_04.txt |
All | subtask0_01.txt, subtask0_02.txt, subtask0_03.txt, subtask0_04.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_max.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_max.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_01.txt | AC | 17 ms | 3064 KB |
subtask0_02.txt | AC | 17 ms | 3064 KB |
subtask0_03.txt | AC | 72 ms | 11028 KB |
subtask0_04.txt | AC | 466 ms | 18344 KB |
subtask1_01.txt | AC | 18 ms | 3064 KB |
subtask1_02.txt | AC | 17 ms | 3064 KB |
subtask1_03.txt | AC | 18 ms | 3064 KB |
subtask1_04.txt | AC | 17 ms | 3064 KB |
subtask1_05.txt | AC | 17 ms | 3064 KB |
subtask1_06.txt | AC | 17 ms | 3064 KB |
subtask1_07.txt | AC | 17 ms | 3064 KB |
subtask1_08.txt | AC | 17 ms | 3064 KB |
subtask1_09.txt | AC | 17 ms | 3064 KB |
subtask1_10.txt | AC | 17 ms | 3064 KB |
subtask1_max.txt | AC | 18 ms | 3064 KB |
subtask2_01.txt | AC | 53 ms | 4180 KB |
subtask2_02.txt | AC | 26 ms | 3700 KB |
subtask2_03.txt | AC | 43 ms | 3772 KB |
subtask2_04.txt | AC | 65 ms | 4348 KB |
subtask2_05.txt | AC | 48 ms | 4036 KB |
subtask2_06.txt | AC | 949 ms | 25724 KB |
subtask2_07.txt | AC | 97 ms | 11248 KB |
subtask2_08.txt | AC | 564 ms | 18328 KB |
subtask2_09.txt | AC | 365 ms | 14680 KB |
subtask2_10.txt | AC | 940 ms | 25720 KB |
subtask2_max.txt | AC | 109 ms | 4928 KB |