結果
| 問題 |
No.3055 Simple Chicken Game
|
| ユーザー |
👑  hos.lyric
|
| 提出日時 | 2025-05-30 07:37:11 |
| 言語 | D (dmd 2.109.1) |
| 結果 |
AC
|
| 実行時間 | 9 ms / 2,000 ms |
| コード長 | 6,728 bytes |
| コンパイル時間 | 9,156 ms |
| コンパイル使用メモリ | 150,148 KB |
| 実行使用メモリ | 7,844 KB |
| 最終ジャッジ日時 | 2025-05-30 07:37:22 |
| 合計ジャッジ時間 | 10,068 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 30 |
ソースコード
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; }
string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }
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 {
static int M;
import std.conv : to;
uint x;
this(ModInt a) { x = a.x; }
this(uint x_) { x = x_ % M; }
this(ulong x_) { x = cast(uint)(x_ % M); }
this(int x_) { x = ((x_ %= cast(int)(M)) < 0) ? (x_ + cast(int)(M)) : x_; }
this(long x_) { x = cast(uint)(((x_ %= cast(long)(M)) < 0) ? (x_ + cast(long)(M)) : x_); }
ref ModInt opAssign(T)(inout(T) a) if (is(T == uint) || is(T == ulong) || is(T == int) || is(T == long)) { return this = ModInt(a); }
ref ModInt opOpAssign(string op, T)(T a) {
static if (is(T == ModInt)) {
static if (op == "+") { x = ((x += a.x) >= M) ? (x - M) : x; }
else static if (op == "-") { x = ((x -= a.x) >= M) ? (x + M) : x; }
else static if (op == "*") { x = cast(uint)((cast(ulong)(x) * a.x) % M); }
else static if (op == "/") { this *= a.inv(); }
else static assert(false);
return this;
} else static if (op == "^^") {
if (a < 0) return this = inv()^^(-a);
ModInt b = this, c = 1U;
for (long e = a; e; e >>= 1) { if (e & 1) c *= b; b *= b; }
return this = c;
} else {
return mixin("this " ~ op ~ "= ModInt(a)");
}
}
ModInt inv() const {
uint a = M, b = x; int y = 0, z = 1;
for (; b; ) { const q = a / b; const c = a - q * b; a = b; b = c; const w = y - cast(int)(q) * z; y = z; z = w; }
assert(a == 1); return ModInt(y);
}
ModInt opUnary(string op)() const {
static if (op == "+") { return this; }
else static if (op == "-") { ModInt a; a.x = x ? (M - x) : 0U; return a; }
else static assert(false);
}
ModInt opBinary(string op, T)(T a) const { return mixin("ModInt(this) " ~ op ~ "= a"); }
ModInt opBinaryRight(string op, T)(T a) const { return mixin("ModInt(a) " ~ op ~ "= this"); }
bool opCast(T: bool)() const { return (x != 0U); }
string toString() const { return x.to!string; }
}
alias Mint = ModInt;
void main() {
debug {{
foreach (N; 1 .. 10 + 1) {
// +, 0, - -> E[# +], E[# 0], E[# -]
auto dp = new real[][][][](N + 1, N + 1, N + 1, 3);
auto cmp = new char[][][](N + 1, N + 1, N + 1);
foreach_reverse (a; 0 .. N + 1) foreach_reverse (b; 0 .. N - a + 1) foreach_reverse (c; 0 .. N - a - b + 1) {
const i = a + b + c;
if (i == N) {
dp[a][b][c][] = 0.0L;
} else {
real pass = a + b + dp[a][b + 1][c][0];
real toss = (a + (a + b + c + dp[a][b][c + 1][0] + dp[a][b][c + 1][1])) / 2.0L;
if (pass < toss) {
cmp[a][b][c] = '<';
foreach (u; 0 .. 3) {
dp[a][b][c][u] = (u==1) + dp[a][b + 1][c][u];
}
} else if (pass == toss) {
cmp[a][b][c] = '=';
foreach (u; 0 .. 3) {
dp[a][b][c][u] = (((u==1) + dp[a][b + 1][c][u]) + (((u==0) + dp[a + 1][b][c][u]) + ((u==2) + dp[a][b][c + 1][u])) / 2.0L) / 2.0L;
}
} else {
cmp[a][b][c] = '>';
foreach (u; 0 .. 3) {
dp[a][b][c][u] = (((u==0) + dp[a + 1][b][c][u]) + ((u==2) + dp[a][b][c + 1][u])) / 2.0L;
}
}
}
}
foreach (i; 0 .. N) {
writefln("N = %s, i = %s", N, i);
foreach (a; 0 .. i + 1) {
foreach (b; 0 .. i - a + 1) write(cmp[a][b][i - a - b]);
writeln;
foreach (b; 0 .. i - a + 1) {
const c = i - a - b;
assert(cmp[a][b][c] == ((b < c) ? '<' : (b == c) ? '=' : '>'));
}
}
writeln;
}
}
}}
try {
for (; ; ) {
const N = readInt;
Mint.M = readInt;
/*
state
0: b < c, pass
1, ++b ~> 1
1: b = c, (pass + toss) / 2
1/4, ++a ~> 1
1/2, ++b ~> 2
1/4, ++c ~> 0
2: b > c, toss
1/2, ++a ~> 2
1/2, ++c ~> 1
*/
enum K = 6;
enum int[K] U = [0, 1, 1, 1, 2, 2];
enum int[K] V = [1, 1, 2, 0, 2, 1];
enum int[K] O = [1, 0, 1, 2, 0, 2];
const Mint[K] P = [Mint(1), Mint(4).inv, Mint(2).inv, Mint(4).inv, Mint(2).inv, Mint(2).inv];
auto pre = new Mint[3][](N + 1);
auto PRE = new Mint[3][3][](N + 1);
pre[0][1] += 1;
foreach (i; 0 .. N) {
static foreach (k; 0 .. K) {
pre[i + 1][V[k]] += pre[i][U[k]] * P[k];
static foreach (o; 0 .. 3) {
PRE[i + 1][V[k]][o] += (PRE[i][U[k]][o] + pre[i][U[k]] * (o==O[k]?1:0)) * P[k];
}
}
}
debug writeln("pre = ", pre);
auto suf = new Mint[3][](N + 1);
auto SUF = new Mint[3][3][](N + 1);
static foreach (u; 0 .. 3) suf[N][u] = 1;
foreach_reverse (i; 0 .. N) {
static foreach (k; 0 .. K) {
suf[i][U[k]] += P[k] * suf[i + 1][V[k]];
static foreach (o; 0 .. 3) {
SUF[i][U[k]][o] += P[k] * (SUF[i + 1][V[k]][o] + suf[i + 1][V[k]] * (o==O[k]?1:0));
}
}
}
debug writeln("suf = ", suf);
auto ans = new Mint[N];
foreach (i; 0 .. N) {
static foreach (k; 0 .. K) {
static foreach (o; 0 .. O[k] + 1) {
ans[i] += PRE[i][U[k]][o] * P[k] * suf[i + 1][V[k]];
}
static foreach (o; 0 .. O[k]) {
ans[i] += pre[i][U[k]] * P[k] * SUF[i + 1][V[k]][o];
}
}
}
ans[] += Mint(1);
foreach (i; 0 .. N) {
if (i) write(" ");
write(ans[i]);
}
writeln;
}
} catch (EOFException e) {
}
}