Codeforces-1151F：Sonya and Informatics（DP+矩阵快速幂）

最新推荐文章于 2022-05-03 11:19:25 发布

Mitsuha_

最新推荐文章于 2022-05-03 11:19:25 发布

阅读量385

点赞数

分类专栏： DP 数学-矩阵快速幂

本文链接：https://blog.csdn.net/Mitsuha_/article/details/89395814

版权

DP 同时被 2 个专栏收录

69 篇文章 3 订阅

订阅专栏

数学-矩阵快速幂

16 篇文章 0 订阅

订阅专栏

F. Sonya and Informatics
time limit per test 1 second
memory limit per test 256 megabytes
input standard input
output standard output
A girl named Sonya is studying in the scientific lyceum of the Kingdom of Kremland. The teacher of computer science (Sonya’s favorite subject!) invented a task for her.

Given an array a of length n, consisting only of the numbers 0 and 1, and the number k. Exactly k times the following happens:

Two numbers i and j are chosen equiprobable such that $(1 \leq i < j \leq n)$ .
The numbers in the i and j positions are swapped.
Sonya’s task is to find the probability that after all the operations are completed, the a array will be sorted in non-decreasing order. She turned to you for help. Help Sonya solve this problem.

It can be shown that the desired probability is either 0 or it can be represented as $\frac PQ$ , where P and Q are coprime integers and $Q! = 0$ $mod10^9+7)$ .

Input
The first line contains two integers n and k $2≤n≤100,1≤k≤10^9)$ — the length of the array a and the number of operations.

The second line contains n integers $a_1,a_2,…,a_n (0≤a_i≤1)$ — the description of the array a.

Output
If the desired probability is 0, print 0, otherwise print the value $P⋅Q^{−1} (mod10^9+7)$ , where P and Q are defined above.

Examples
input
3 2
0 1 0
output
333333336
input
5 1
1 1 1 0 0
output
0
input
6 4
1 0 0 1 1 0
output
968493834

思路:假设 $a$ 中总共有 $l e n$ 个0，且前 $l e n$ 个数里0的个数为 $x$ ，用 $d [i] [j]$ 表示经过 $i$ 次操作后， $a$ 中前 $l e n$ 个数里有 $j$ 个0的方案数，那么初始 $d [0] [x] = 1$ 。

则最后 $a$ 不下降的方案数为 $d [k] [l e n]$ ，则概率 $ans=\frac{d[k][len]} {\sum_{j=0}^{len} d[k][j]}$

接下来就是求 $d [i] [j]$ 了。

由 $d [i] [j]$ ,我们可以根据 $j$ 求出 $j$ 变化的方案数(简单的排列组合)，从而推出 $d [i] [j - 1], d [i] [j], d [i] [j + 1]$ 。

于是可以利用矩阵快速幂加速。

#include<bits/stdc++.h>
using namespace std;
const int MAX=1e5+10;
const int MOD=1e9+7;
typedef long long ll;
struct lenka{int a[101][101];};
int len,n,m;
ll POW(ll x,ll R)
{
    ll res=1;
    while(R)
    {
        if(R&1)res=res*x%MOD;
        x=x*x%MOD;
        R/=2;
    }
    return res;
}
lenka cal(const lenka&A,const lenka&B)
{
    lenka C;
    memset(C.a,0,sizeof C.a);
    for(int i=0;i<=len;i++)
    for(int j=0;j<=len;j++)
    for(int k=0;k<=len;k++)
    {
        C.a[i][j]+=1ll*A.a[i][k]*B.a[k][j]%MOD;
        C.a[i][j]%=MOD;
    }
    return C;
}
ll POW(lenka& d)
{
    lenka a,res;
    memset(a.a,0,sizeof a.a);
    memset(res.a,0,sizeof res.a);
    for(int i=0;i<=len;i++)res.a[i][i]=1;
    for(int i=0;i<=len;i++)
    {
        a.a[i][i]=max(0,n*(n-1)/2-i*(n+i-2*len)-(len-i)*(len-i));
        if(i)a.a[i-1][i]=(len-i+1)*(len-i+1);
        if(i<len)a.a[i+1][i]=max(0,(i+1)*(n+i+1-2*len));
    }
    while(m)
    {
        if(m&1)res=cal(a,res);
        a=cal(a,a);
        m/=2;
    }
    d=cal(d,res);
    ll ans=0;
    for(int i=0;i<=len;i++)(ans+=d.a[0][i])%=MOD;
    return d.a[0][len]*POW(ans,MOD-2)%MOD;
}
int main()
{
    int a[101];
    cin>>n>>m;
    for(int i=1;i<=n;i++)scanf("%d",&a[i]);
    for(int i=1;i<=n;i++)len+=a[i]^1;
    int cnt=0;
    for(int i=1;i<=len;i++)cnt+=a[i]^1;
    lenka d;
    memset(d.a,0,sizeof d.a);
    d.a[0][cnt]=1;
    cout<<POW(d)<<endl;
    return 0;
}