結果
| 問題 | No.907 Continuous Kadomatu |
| ユーザー |
👑  hos.lyric
|
| 提出日時 | 2019-10-11 22:03:54 |
| 言語 | D (dmd 2.107.1) |
| 結果 |
AC
|
| 実行時間 | 326 ms / 2,000 ms |
| コード長 | 5,467 bytes |
| コンパイル時間 | 1,430 ms |
| コンパイル使用メモリ | 159,704 KB |
| 実行使用メモリ | 101,492 KB |
| 最終ジャッジ日時 | 2023-09-04 03:01:51 |
| 合計ジャッジ時間 | 6,015 ms |
|
ジャッジサーバーID （参考情報） |
judge12 / judge14 |
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
4,380 KB |
| testcase_01 | AC | 1 ms
4,380 KB |
| testcase_02 | AC | 2 ms
4,380 KB |
| testcase_03 | AC | 2 ms
4,376 KB |
| testcase_04 | AC | 1 ms
4,376 KB |
| testcase_05 | AC | 30 ms
13,132 KB |
| testcase_06 | AC | 2 ms
4,380 KB |
| testcase_07 | AC | 9 ms
5,576 KB |
| testcase_08 | AC | 20 ms
10,008 KB |
| testcase_09 | AC | 13 ms
7,160 KB |
| testcase_10 | AC | 51 ms
22,640 KB |
| testcase_11 | AC | 76 ms
29,972 KB |
| testcase_12 | AC | 197 ms
80,436 KB |
| testcase_13 | AC | 218 ms
80,844 KB |
| testcase_14 | AC | 247 ms
85,628 KB |
| testcase_15 | AC | 235 ms
80,780 KB |
| testcase_16 | AC | 242 ms
80,956 KB |
| testcase_17 | AC | 265 ms
91,576 KB |
| testcase_18 | AC | 244 ms
84,148 KB |
| testcase_19 | AC | 261 ms
90,576 KB |
| testcase_20 | AC | 3 ms
4,376 KB |
| testcase_21 | AC | 4 ms
4,380 KB |
| testcase_22 | AC | 4 ms
4,376 KB |
| testcase_23 | AC | 316 ms
101,052 KB |
| testcase_24 | AC | 326 ms
101,492 KB |
| testcase_25 | AC | 2 ms
4,376 KB |
| testcase_26 | AC | 1 ms
4,376 KB |
| testcase_27 | AC | 2 ms
4,380 KB |
| testcase_28 | AC | 2 ms
4,376 KB |
| testcase_29 | AC | 1 ms
4,376 KB |
ソースコード
import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, 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) {
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 assert(false);
return this;
}
ref ModInt opOpAssign(string op)(long a) {
static if (op == "^^") {
ModInt t2 = this, te = ModInt(1);
for (long e = a; e; 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 if (op == "-") { 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"); }
string toString() const { return x.to!string; }
}
enum MO = 10L^^9 + 7;
alias Mint = ModInt!MO;
Mint eval(Mint[] f, Mint x) {
Mint y;
foreach_reverse (a; f) {
y = y * x + a;
}
return y;
}
enum LIM = 1010;
void main() {
auto inv = new Mint[LIM];
inv[1] = 1;
foreach (i; 2 .. LIM) {
inv[i] = -Mint(MO / i) * inv[cast(size_t)(MO % i)];
}
Mint eval(Mint[] f, Mint x) {
Mint y;
foreach_reverse (a; f) {
y = y * x + a;
}
return y;
}
try {
for (; ; ) {
const N = readInt();
auto A = new long[N];
auto B = new long[N];
foreach (i; 0 .. N) {
A[i] = readLong();
B[i] = readLong();
}
auto xs = A.dup ~ B.dup;
xs = xs.sort.uniq.array;
const len = cast(int)(xs.length) - 1;
auto dp = new Mint[][][](N, len, N);
{
const coef = Mint(B[0] - A[0]).inv;
foreach (e; 0 .. len) {
if (A[0] <= xs[e] && xs[e + 1] <= B[0]) {
dp[0][e][0] = coef;
}
}
}
foreach (i; 1 .. N) {
const coef = Mint(B[i] - A[i]).inv;
if (i % 2 == 0) {
// >=
Mint sum;
foreach_reverse (e; 0 .. len) {
auto g = new Mint[i + 1];
foreach (d; 0 .. i) {
g[d + 1] = dp[i - 1][e][d] * inv[d + 1];
}
const y0 = g.eval(Mint(xs[e]));
const y1 = g.eval(Mint(xs[e + 1]));
if (A[i] <= xs[e] && xs[e + 1] <= B[i]) {
foreach (d; 0 .. i) {
dp[i][e][d + 1] = -g[d + 1];
}
dp[i][e][0] += sum + y1;
dp[i][e][] *= coef;
}
sum += y1 - y0;
}
} else {
// <=
Mint sum;
foreach (e; 0 .. len) {
auto g = new Mint[i + 1];
foreach (d; 0 .. i) {
g[d + 1] = dp[i - 1][e][d] * inv[d + 1];
}
const y0 = g.eval(Mint(xs[e]));
const y1 = g.eval(Mint(xs[e + 1]));
if (A[i] <= xs[e] && xs[e + 1] <= B[i]) {
foreach (d; 0 .. i) {
dp[i][e][d + 1] = g[d + 1];
}
dp[i][e][0] += sum - y0;
dp[i][e][] *= coef;
}
sum += y1 - y0;
}
}
}
debug {
writeln("xs = ", xs);
foreach (i; 0 .. N) {
foreach (e; 0 .. len) {
write(dp[i][e][0 .. i + 1], " ");
}
writeln();
}
}
Mint ans;
foreach (e; 0 .. len) {
auto g = new Mint[N + 1];
foreach (d; 0 .. N) {
g[d + 1] = dp[N - 1][e][d] * inv[d + 1];
}
const y0 = g.eval(Mint(xs[e]));
const y1 = g.eval(Mint(xs[e + 1]));
ans += y1 - y0;
}
writeln(ans);
}
} catch (EOFException e) {
}
}