結果
| 問題 |
No.1354 Sambo's Treasure
|
| コンテスト | |
| ユーザー |
 hos.lyric
|
| 提出日時 | 2021-01-17 14:32:59 |
| 言語 | D (dmd 2.109.1) |
| 結果 |
AC
|
| 実行時間 | 129 ms / 2,000 ms |
| コード長 | 6,117 bytes |
| コンパイル時間 | 1,692 ms |
| コンパイル使用メモリ | 165,508 KB |
| 実行使用メモリ | 17,152 KB |
| 最終ジャッジ日時 | 2024-06-22 10:39:39 |
| 合計ジャッジ時間 | 7,019 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 61 |
ソースコード
import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, 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)); }
struct ModInt(int M_) {
import std.conv : to;
alias M = M_;
int x;
this(ModInt a) { x = a.x; }
this(long a) { x = cast(int)(a % M); if (x < 0) x += M; }
ref ModInt opAssign(long a) { return (this = ModInt(a)); }
ref ModInt opOpAssign(string op)(ModInt a) {
static if (op == "+") { x += a.x; if (x >= M) x -= M; }
else static if (op == "-") { x -= a.x; if (x < 0) x += M; }
else static if (op == "*") { x = cast(int)((cast(long)(x) * a.x) % M); }
else static if (op == "/") { this *= a.inv(); }
else static assert(false);
return this;
}
ref ModInt opOpAssign(string op)(long a) {
static if (op == "^^") {
if (a < 0) return (this = inv()^^(-a));
ModInt t2 = this, te = ModInt(1);
for (long e = a; e > 0; e >>= 1) {
if (e & 1) te *= t2;
t2 *= t2;
}
x = cast(int)(te.x);
return this;
} else return mixin("this " ~ op ~ "= ModInt(a)");
}
ModInt inv() const {
int a = x, b = M, y = 1, z = 0, t;
for (; ; ) {
t = a / b; a -= t * b;
if (a == 0) {
assert(b == 1 || b == -1);
return ModInt(b * z);
}
y -= t * z;
t = b / a; b -= t * a;
if (b == 0) {
assert(a == 1 || a == -1);
return ModInt(a * y);
}
z -= t * y;
}
}
ModInt opUnary(string op: "-")() const { return ModInt(-x); }
ModInt opBinary(string op, T)(T a) const {
return mixin("ModInt(this) " ~ op ~ "= a");
}
ModInt opBinaryRight(string op)(long a) const {
return mixin("ModInt(a) " ~ op ~ "= this");
}
bool opCast(T: bool)() const { return (x != 0); }
string toString() const { return x.to!string; }
}
enum MO = 998244353;
alias Mint = ModInt!MO;
enum LIM = 4 * 10^^5 + 10;
Mint[] inv, fac, invFac;
void prepare() {
inv = new Mint[LIM];
fac = new Mint[LIM];
invFac = new Mint[LIM];
inv[1] = 1;
foreach (i; 2 .. LIM) {
inv[i] = -(Mint.M / i) * inv[cast(size_t)(Mint.M % i)];
}
fac[0] = invFac[0] = 1;
foreach (i; 1 .. LIM) {
fac[i] = fac[i - 1] * i;
invFac[i] = invFac[i - 1] * inv[i];
}
}
Mint binom(long n, long k) {
if (0 <= k && k <= n) {
assert(n < LIM);
return fac[cast(size_t)(n)] * invFac[cast(size_t)(k)] * invFac[cast(size_t)(n - k)];
} else {
return Mint(0);
}
}
Mint calc(int x, int y) {
return binom(x + y, x);
}
void main() {
prepare;
try {
for (; ; ) {
const N = readInt();
const M = readInt() + 1;
const L = readInt();
const K = readInt();
auto A = new int[M + 1];
auto B = new int[M + 1];
A[0] = 0;
B[0] = 0;
foreach (i; 1 .. M) {
A[i] = readInt();
B[i] = readInt();
}
A[M] = N;
B[M] = N;
auto C = new int[L];
auto D = new int[L];
foreach (l; 0 .. L) {
C[l] = readInt();
D[l] = readInt();
}
int hit;
auto lss = new int[][M];
foreach (l; 0 .. L) {
foreach (i; 0 .. M + 1) {
if (C[l] == A[i] && D[l] == B[i]) {
++hit;
goto foundHit;
}
}
foreach (i; 0 .. M) {
if (A[i] <= C[l] && C[l] <= A[i + 1] &&
B[i] <= D[l] && D[l] <= B[i + 1]) {
lss[i] ~= l;
break;
}
}
foundHit:
}
debug {
writeln("hit = ", hit);
writeln("lss = ", lss);
}
auto crt = new Mint[L + 1];
crt[0] = 1;
foreach (i; 0 .. M) {
if (lss[i].empty) {
const num = calc(A[i + 1] - A[i], B[i + 1] - B[i]);
crt[] *= num;
} else {
alias Pt = Tuple!(int, "x", int, "y");
Pt[] ps;
ps ~= Pt(A[i], B[i]);
ps ~= Pt(A[i + 1], B[i + 1]);
foreach (l; lss[i]) {
ps ~= Pt(C[l], D[l]);
}
ps.sort;
const psLen = cast(int)(ps.length);
auto dp = new Mint[][](psLen, psLen);
dp[0][0] = 1;
foreach (j; 0 .. psLen) foreach (k; j + 1 .. psLen) {
const dx = ps[k].x - ps[j].x;
const dy = ps[k].y - ps[j].y;
if (dx >= 0 && dy >= 0) {
foreach (s; 0 .. psLen - 1) {
dp[k][s + 1] += dp[j][s] * calc(dx, dy);
}
}
}
auto fs = dp[psLen - 1][1 .. $];
foreach_reverse (s; 0 .. psLen - 1) {
foreach (t; s + 1 .. psLen - 1) {
fs[s] -= binom(t, s) * fs[t];
}
}
auto nxt = new Mint[L + 1];
foreach (s; 0 .. L + 1) foreach (t; 0 .. psLen - 1) {
if (s + t <= L) {
nxt[s + t] += crt[s] * fs[t];
}
}
crt = nxt;
}
}
Mint ans;
foreach (s; 0 .. L + 1) {
if (hit + s <= K) {
ans += crt[s];
}
}
writeln(ans);
}
} catch (EOFException e) {
}
}