結果

問題 No.767 配られたジャパリまん
ユーザー 👑 hos.lyric
提出日時 2019-04-04 18:37:50
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 991 ms / 2,000 ms
コード長 2,996 bytes
コンパイル時間 1,163 ms
コンパイル使用メモリ 132,080 KB
実行使用メモリ 19,816 KB
最終ジャッジ日時 2024-06-13 04:48:34
合計ジャッジ時間 3,965 ms
ジャッジサーバーID
(参考情報)
judge1 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 6
other AC * 15
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, 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)); }
enum MO = 10L^^8 + 7;
enum LIM = 3 * 10^^5;
long[] inv, fac, invFac;
void prepare() {
inv = new long[LIM];
fac = new long[LIM];
invFac = new long[LIM];
inv[1] = 1;
foreach (i; 2 .. LIM) {
inv[i] = MO - ((MO / i) * inv[cast(size_t)(MO % i)]) % MO;
}
fac[0] = invFac[0] = 1;
foreach (i; 1 .. LIM) {
fac[i] = (fac[i - 1] * i) % MO;
invFac[i] = (invFac[i - 1] * inv[i]) % MO;
}
}
long binom(long n, long k) {
if (0 <= k && k <= n) {
assert(n < LIM);
return fac[cast(size_t)(n)] * invFac[cast(size_t)(k)] % MO * invFac[cast(size_t)(n - k)] % MO;
} else {
return 0;
}
}
long calc(int dx, int dy) {
return (dx >= 0 && dy >= 0) ? binom(dx + dy, dx) : 0;
}
int H, W, K;
Tuple!(int, "x", int, "y", int, "id")[] P;
void main() {
prepare();
try {
for (; ; ) {
H = readInt();
W = readInt();
K = readInt();
P.length = K;
foreach (i; 0 .. K) {
P[i].x = readInt();
P[i].y = readInt();
P[i].id = i;
}
P.sort;
auto dp = new long[K];
auto ans = new long[1 << K];
void dfs(int i, int f) {
if (i == K) {
ans[f] = calc(H - 0, W - 0);
foreach (j; 0 .. i) {
ans[f] -= dp[j] * calc(H - P[j].x, W - P[j].y);
ans[f] %= MO;
}
} else {
// passable
dp[i] = 0;
dfs(i + 1, f);
// impassable
dp[i] = calc(P[i].x - 0, P[i].y - 0);
foreach (j; 0 .. i) {
dp[i] -= dp[j] * calc(P[i].x - P[j].x, P[i].y - P[j].y);
dp[i] %= MO;
}
dfs(i + 1, f | 1 << P[i].id);
}
}
dfs(0, 0);
foreach (f; 0 .. 1 << K) {
if (ans[f] < 0) {
ans[f] += MO;
}
writeln(ans[f]);
}
}
} catch (EOFException e) {
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0