Submission #00265

ソースコード

?
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
#include <bits/stdc++.h>
using namespace std;
#ifdef _DEBUG
#define _GLIBCXX_DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
//#define int long long
#define DBG 1
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define loop(n) rep(loop, (0), (n))
#define all(c) begin(c), end(c)
const int INF =
sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)(1e9) + 7;
const double PI = acos(-1);
const double EPS = 1e-9;
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
using pii = pair<int, int>;
// template<class T> ostream &operator<<(ostream &os,T &t){dump(t);return os;}
template <typename T, typename S>
istream &operator>>(istream &is, pair<T, S> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T, typename S>
ostream &operator<<(ostream &os, pair<T, S> &p) {
os << p.first << " " << p.second;
return os;
}
template <typename T> void printvv(const vector<vector<T>> &v) {
cerr << endl;
rep(i, 0, v.size()) rep(j, 0, v[i].size()) {
if (typeid(v[i][j]).name() == typeid(INF).name() and v[i][j] == INF) {
cerr << "INF";
} else
cerr << v[i][j];
cerr << (j == v[i].size() - 1 ? '\n' : ' ');
}
cerr << endl;
}
/*
typedef __int128_t Int;
std::ostream &operator<<(std::ostream &dest, __int128_t value) {
std::ostream::sentry s(dest);
if (s) {
__uint128_t tmp = value < 0 ? -value : value;
char buffer[128];
char *d = std::end(buffer);
do {
--d;
*d = "0123456789"[tmp % 10];
tmp /= 10;
} while (tmp != 0);
if (value < 0) {
--d;
*d = '-';
}
int len = std::end(buffer) - d;
if (dest.rdbuf()->sputn(d, len) != len) {
dest.setstate(std::ios_base::badbit);
}
}
return dest;
}
__int128 parse(string &s) {
__int128 ret = 0;
for (int i = 0; i < s.length(); i++)
if ('0' <= s[i] && s[i] <= '9')
ret = 10 * ret + s[i] - '0';
return ret;
}
*/
#ifndef _DEBUG
#define printvv(...)
#endif
void YES(bool f) { cout << (f ? "YES" : "NO") << endl; }
void Yes(bool f) { cout << (f ? "Yes" : "No") << endl; }
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <int MOD> struct ModInt {
static const int Mod = MOD;
unsigned x;
ModInt() : x(0) {}
ModInt(signed sig) {
int sigt = sig % MOD;
if (sigt < 0)
sigt += MOD;
x = sigt;
}
ModInt(signed long long sig) {
int sigt = sig % MOD;
if (sigt < 0)
sigt += MOD;
x = sigt;
}
int get() const { return (int)x; }
ModInt &operator+=(ModInt that) {
if ((x += that.x) >= MOD)
x -= MOD;
return *this;
}
ModInt &operator-=(ModInt that) {
if ((x += MOD - that.x) >= MOD)
x -= MOD;
return *this;
}
ModInt &operator*=(ModInt that) {
x = (unsigned long long)x * that.x % MOD;
return *this;
}
ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
ModInt inverse() const {
signed a = x, b = MOD, u = 1, v = 0;
while (b) {
signed t = a / b;
a -= t * b;
std::swap(a, b);
u -= t * v;
std::swap(u, v);
}
if (u < 0)
u += MOD;
ModInt res;
res.x = (unsigned)u;
return res;
}
};
template <int MOD> ostream &operator<<(ostream &os, const ModInt<MOD> &m) {
return os << m.x;
}
template <int MOD> istream &operator>>(istream &is, ModInt<MOD> &m) {
signed long long s;
is >> s;
m = ModInt<MOD>(s);
return is;
};
// pow(mint(2), 1000) のように
template <int MOD> ModInt<MOD> pow(ModInt<MOD> a, unsigned long long k) {
ModInt<MOD> r = 1;
while (k) {
if (k & 1)
r *= a;
a *= a;
k >>= 1;
}
return r;
}
//#define int long long を使っても大丈夫
using mint = ModInt<1000000007>;
// nCrで用いる
vector<mint> fact, factinv;
// nCrで用いる 予め計算しておく
void nCr_compute_factinv(int N) {
N = min(N, mint::Mod - 1);
fact.resize(N + 1);
factinv.resize(N + 1);
fact[0] = 1;
rep(i, 1, N + 1) fact[i] = fact[i - 1] * i;
factinv[N] = fact[N].inverse();
for (int i = N; i >= 1; i--)
factinv[i - 1] = factinv[i] * i;
}
mint nCr(int n, int r) {
if (n >= mint::Mod)
return nCr(n % mint::Mod, r % mint::Mod) *
nCr(n / mint::Mod, r / mint::Mod);
return r > n ? 0 : fact[n] * factinv[n - r] * factinv[r];
}
mint nHr(int n, int r) { return r == 0 ? 1 : nCr(n + r - 1, r); }
signed main(signed argc, char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
nCr_compute_factinv(1e6 + 10);
int W, H, N;
cin >> W >> H >> N;
vector<int> x(N + 1, 0), y(N + 1, 0);
rep(i, 1, N + 1) { cin >> x[i] >> y[i]; }
x.eb(W - 1);
y.eb(H - 1);
mint ans = 1;
rep(i, 1, x.size()) {
int all = x[i] - x[i - 1] + y[i] - y[i - 1];
int w = x[i] - x[i - 1];
ans *= nCr(all, w);
}
cout << ans << endl;
return 0;
}

ステータス

項目 データ
問題 0006 - 寄り道
ユーザー名 oshibori
投稿日時 2018-11-24 16:26:22
言語 C++14
状態 Accepted
得点 400
ソースコード長 5579 Byte
最大実行時間 47 ms
最大メモリ使用量 8524 KB

セット

セット 得点 Cases
1 ALL 400 / 400 *

テストケース

ファイル名 状態 実行時間 メモリ使用量 #
input01.in AC 35 ms 8412 KB
1
input02.in AC 39 ms 8484 KB
1
input03.in AC 33 ms 8296 KB
1
input04.in AC 36 ms 8372 KB
1
input05.in AC 34 ms 8316 KB
1
input06.in AC 40 ms 8520 KB
1
input07.in AC 36 ms 8464 KB
1
input08.in AC 34 ms 8408 KB
1
input09.in AC 40 ms 8352 KB
1
input10.in AC 32 ms 8416 KB
1
input11.in AC 47 ms 8480 KB
1
input12.in AC 34 ms 8420 KB
1
input13.in AC 39 ms 8240 KB
1
input14.in AC 34 ms 8316 KB
1
input15.in AC 38 ms 8384 KB
1
input16.in AC 42 ms 8448 KB
1
input17.in AC 34 ms 8388 KB
1
input18.in AC 39 ms 8456 KB
1
input19.in AC 31 ms 8392 KB
1
input20.in AC 36 ms 8328 KB
1
sample.in AC 38 ms 8524 KB
1