Submission #1687029
Source Code Expand
#include <assert.h> #include <cmath> #include <cstdio> #include <cstdlib> #include <cstring> #include <climits> #include <algorithm> #include <numeric> #include <functional> #include <iostream> #include <string> #include <array> #include <vector> #include <stack> #include <queue> #include <set> #include <map> #include <complex> #include <bitset> typedef long long ll; typedef unsigned long long ull; using namespace std; const ll MOD7 = 1000000007; struct FactorialTable { vector<ll> fact; vector<ll> inv; ll m; explicit FactorialTable(ll n, ll m) { this->m = m; fact = vector<ll>(n + 1, 0); fact[0] = 1; for (int i = 1; i <= n; i++) { fact[i] = fact[i - 1] * i % m; } inv = vector<ll>(n + 1, 0); for (int i = n - 1; i >= 0; i--) { inv[i] = mod_pow(fact[i], m - 2); } /* inv[n] = mod_pow(fact[n], m - 2); for (int i = n - 1; i >= 0; i--) { inv[i] = inv[i + 1] * (i + 1) % m; } */ } ll mod_pow(ll x, ll n) { ll ans = 1; while (n > 0) { if ((n & 1) == 1) ans = ans * x % m; x = x * x % m; n >>= 1; } return ans; } ll factorial(int n) { return fact[n]; } ll comb(int n, int k) { return fact[n] * inv[k] % m * inv[n - k] % m; } }; int main() { cin.tie(0); ios::sync_with_stdio(false); int W, H; cin >> W >> H; FactorialTable f(W + H, MOD7); cout << f.comb(W - 1 + H - 1, W - 1) << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 経路 |
User | sinhrks |
Language | C++14 (GCC 5.4.1) |
Score | 101 |
Code Size | 1535 Byte |
Status | AC |
Exec Time | 113 ms |
Memory | 3328 KB |
Judge Result
Set Name | Sample | Dataset1 | Dataset2 | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 50 / 50 | 50 / 50 | 1 / 1 | ||||||||
Status |
|
|
|
|
Set Name | Test Cases |
---|---|
Sample | s0.txt, s1.txt |
Dataset1 | 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, s0.txt |
Dataset2 | 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, 019.txt, 020.txt, 021.txt, s0.txt, s1.txt |
All | 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, 019.txt, 020.txt, 021.txt, 022.txt, 023.txt, 024.txt, 025.txt, 026.txt, 027.txt, 028.txt, 029.txt, 030.txt, 031.txt, 032.txt, s0.txt, s1.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
000.txt | AC | 1 ms | 256 KB |
001.txt | AC | 1 ms | 256 KB |
002.txt | AC | 1 ms | 256 KB |
003.txt | AC | 1 ms | 256 KB |
004.txt | AC | 1 ms | 256 KB |
005.txt | AC | 1 ms | 256 KB |
006.txt | AC | 1 ms | 256 KB |
007.txt | AC | 1 ms | 256 KB |
008.txt | AC | 1 ms | 256 KB |
009.txt | AC | 1 ms | 256 KB |
010.txt | AC | 1 ms | 256 KB |
011.txt | AC | 2 ms | 256 KB |
012.txt | AC | 2 ms | 256 KB |
013.txt | AC | 2 ms | 256 KB |
014.txt | AC | 2 ms | 256 KB |
015.txt | AC | 2 ms | 256 KB |
016.txt | AC | 2 ms | 256 KB |
017.txt | AC | 2 ms | 256 KB |
018.txt | AC | 2 ms | 256 KB |
019.txt | AC | 2 ms | 256 KB |
020.txt | AC | 2 ms | 256 KB |
021.txt | AC | 2 ms | 256 KB |
022.txt | AC | 95 ms | 2944 KB |
023.txt | AC | 82 ms | 2560 KB |
024.txt | AC | 76 ms | 2304 KB |
025.txt | AC | 24 ms | 896 KB |
026.txt | AC | 23 ms | 896 KB |
027.txt | AC | 72 ms | 2304 KB |
028.txt | AC | 86 ms | 2688 KB |
029.txt | AC | 47 ms | 1536 KB |
030.txt | AC | 83 ms | 2560 KB |
031.txt | AC | 64 ms | 2048 KB |
032.txt | AC | 113 ms | 3328 KB |
s0.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 2 ms | 256 KB |