P3706 [SDOI2017]硬币游戏
题目描述
Solution
前置技能:
P4548 [CTSC2006]歌唱王国
歌唱王国就是
n
=
1
n=1
n=1的情况。
我们用类似的方法,先考虑两个串的情况。
设 S A S_A SA表示 A A A串最先选到的概率,设 S B S_B SB表示 B B B串最先选到的概率。
则有
N
=
S
A
∑
2
k
[
A
(
k
)
=
A
(
k
)
]
+
S
B
∑
2
k
[
B
(
k
)
=
A
(
k
)
]
N
=
S
A
∑
2
k
[
A
(
k
)
=
B
(
k
)
]
+
S
B
∑
2
k
[
B
(
k
)
=
B
(
k
)
]
N
+
S
A
+
S
B
=
1
N=S_A\sum2^k[A^{(k)}=A_{(k)}]+S_B\sum2^k[B^{(k)}=A_{(k)}]\\ N=S_A\sum2^k[A^{(k)}=B_{(k)}]+S_B\sum2^k[B^{(k)}=B_{(k)}]\\ N+S_A+S_B=1
N=SA∑2k[A(k)=A(k)]+SB∑2k[B(k)=A(k)]N=SA∑2k[A(k)=B(k)]+SB∑2k[B(k)=B(k)]N+SA+SB=1
因此可以高斯消元求出两个串的答案。
A
n
s
A
=
S
A
S
A
+
S
B
A
n
s
B
=
S
B
S
A
+
S
B
Ans_A=\frac{S_A}{S_A+S_B}\;\;\;\; Ans_B=\frac{S_B}{S_A+S_B}
AnsA=SA+SBSAAnsB=SA+SBSB
而拓展到 n n n个串也是一样的。
N
=
S
A
∑
2
k
[
A
(
k
)
=
A
(
k
)
]
+
S
B
∑
2
k
[
B
(
k
)
=
A
(
k
)
]
+
.
.
.
N
=
S
A
∑
2
k
[
A
(
k
)
=
B
(
k
)
]
+
S
B
∑
2
k
[
B
(
k
)
=
B
(
k
)
]
+
.
.
.
N
=
S
A
∑
2
k
[
A
(
k
)
=
C
(
k
)
]
+
S
B
∑
2
k
[
B
(
k
)
=
C
(
k
)
]
+
.
.
.
.
.
.
N
+
S
A
+
S
B
+
S
C
+
.
.
.
=
1
N=S_A\sum2^k[A^{(k)}=A_{(k)}]+S_B\sum2^k[B^{(k)}=A_{(k)}]+...\\ N=S_A\sum2^k[A^{(k)}=B_{(k)}]+S_B\sum2^k[B^{(k)}=B_{(k)}]+...\\ N=S_A\sum2^k[A^{(k)}=C_{(k)}]+S_B\sum2^k[B^{(k)}=C_{(k)}]+...\\ ...\\ N+S_A+S_B+S_C+...=1
N=SA∑2k[A(k)=A(k)]+SB∑2k[B(k)=A(k)]+...N=SA∑2k[A(k)=B(k)]+SB∑2k[B(k)=B(k)]+...N=SA∑2k[A(k)=C(k)]+SB∑2k[B(k)=C(k)]+......N+SA+SB+SC+...=1
高斯消元
O
(
n
3
)
O(n^3)
O(n3)求解即可。
代码里直接把 N N N代到上面的式子里了,因此只有大小为 n ∗ ( n + 1 ) n*(n+1) n∗(n+1)的矩阵。
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <cassert>
#include <string.h>
//#include <unordered_set>
//#include <unordered_map>
//#include <bits/stdc++.h>
#define MP(A,B) make_pair(A,B)
#define PB(A) push_back(A)
#define SIZE(A) ((int)A.size())
#define LEN(A) ((int)A.length())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define fi first
#define se second
using namespace std;
template<typename T>inline bool upmin(T &x,T y) { return y<x?x=y,1:0; }
template<typename T>inline bool upmax(T &x,T y) { return x<y?x=y,1:0; }
typedef long long ll;
typedef unsigned long long ull;
typedef long double lod;
typedef pair<int,int> PR;
typedef vector<int> VI;
const double eps=1e-10;
const lod pi=acos(-1);
const int oo=1<<30;
const ll loo=1ll<<62;
const int mods=1e9+9;
const int MAXN=305;
const int INF=0x3f3f3f3f;//1061109567
/*--------------------------------------------------------------------*/
inline int read()
{
int f=1,x=0; char c=getchar();
while (c<'0'||c>'9') { if (c=='-') f=-1; c=getchar(); }
while (c>='0'&&c<='9') { x=(x<<3)+(x<<1)+(c^48); c=getchar(); }
return x*f;
}
char st[MAXN];
double pow2[MAXN],a[MAXN][MAXN];
int hsh[MAXN][MAXN],Pw[MAXN];
inline int upd(int x,int y){ return x+y>=mods?x+y-mods:x+y; }
inline int gethash(int n,int l,int r) { return upd(hsh[n][r],mods-1ll*Pw[r-l+1]*hsh[n][l-1]%mods); }
inline bool solve(int n)
{
for (int i=0;i<n;i++)
{
int maxj=i;
for (int j=i+1;j<n;j++)
if (fabs(a[j][i])-fabs(a[maxj][i])>eps) maxj=j;
if (fabs(a[maxj][i])<eps) return 0;
if (maxj!=i)
for (int j=0;j<=n;j++) swap(a[maxj][j],a[i][j]);
for (int j=i+1;j<n;j++)
{
double t=a[j][i]/a[i][i];
for (int k=i;k<=n;k++) a[j][k]-=t*a[i][k];
}
}
for (int i=n-1;i>=0;i--)
{
for (int j=i+1;j<n;j++) a[i][n]-=a[j][n]*a[i][j];
a[i][n]/=a[i][i];
}
return 1;
}
int main()
{
int n=read(),m=read();
pow2[0]=1,Pw[0]=1;
for (int i=1;i<=m;i++) pow2[i]=pow2[i-1]*2,Pw[i]=1ll*Pw[i-1]*MAXN%mods;
for (int i=0;i<n;i++)
{
scanf("%s",st+1);
for (int j=1;j<=m;j++) hsh[i][j]=(1ll*hsh[i][j-1]*MAXN+(st[j]=='T'?1:2))%mods;
}
for (int i=0;i<n;i++)
{
for (int j=0;j<n;j++)
for (int k=1;k<=m;k++)
if (gethash(i,1,k)==gethash(j,m-k+1,m)) a[i][j]+=pow2[k];
for (int j=0;j<n;j++) a[i][j]--;
a[i][n]=1;
}
solve(n);
double sum=0;
for (int i=0;i<n;i++) sum+=a[i][n];
for (int i=0;i<n;i++) printf("%.10lf\n",a[i][n]/sum);
return 0;
}