[BZOJ5015]数学

https://www.lydsy.com/JudgeOnline/problem.php?id=5015

容易发现，答案
$An{s}_N$

$={\sum }_{i=1}^{N-1}{2}^{N-1-i}{i}^K+N^K$

$=2^{N-1}{\sum }_{i=1}^{N-1}(\frac{1}{2}{)}^i{i}^K+N^K$

然后敏锐地观察到这个${\sum }_{i=1}^{N-1}(\frac{1}{2}{)}^i{i}^K$有点东西~~

我们令$F_{N,K}={\sum }_{i=1}^N(\frac{1}{2}{)}^i{i}^K，B=\frac{1}{2}$

那么

$F_{N+1,K}={\sum }_{i=1}^{N+1}{B}^i{i}^K={\sum }_{i=1}^N{B}^i{i}^K+B^{N+1}(N+1{)}^K=F_{N,K}+B^{N+1}(N+1{)}^K$

$F_{2N,K}={\sum }_{i=1}^{2N}{B}^i{i}^K$

$={\sum }_{i=1}^N{B}^i{i}^K+{\sum }_{i=1}^N{B}^{N+i}(N+i{)}^K$

$＝F_{N,K}+B^N{\sum }_{i=1}^N{B}^i{\sum }_{j=0}^K{C}_K^j{i}^j{N}^{K-j}$ （二项式展开）

$＝F_{N,K}+B^N{\sum }_{j=0}^K{N}^{K-j}{C}_{K,j}{\sum }_{i=1}^N{R}^i{i}^j$ （改变循环次序）

然后发现了什么！！！${\sum }_{i=1}^N{R}^i{i}^j$！！！

$So,F_{2N,K}=F_{N,K}+B^N{\sum }_{j=0}^K{N}^{K-j}{C}_{K,j}{F}_{N,j}$

然后记忆化+倍增即可，复杂度$O((lo{g}_2^N{)}^{2}K)$

Code

#include<bits/stdc++.h>
#define LL long long
using namespace std;
const LL TT=(1e9)+7,B=TT+1>>1;
LL N,K,fac[15],inv[15];
LL Pow(LL a,LL b){LL s=1;for(LL w=a%TT;b;b>>=1,w=w*w%TT) if(b&1) s=s*w%TT;return s;}
LL C(LL m,LL n){return fac[m]*inv[n]%TT*inv[m-n]%TT;}
map<LL,LL>G[15];
LL F(LL n,LL k){
	if(!n) return 0;
	if(G[k][n]) return G[k][n];
	if(n&1) return G[k][n]=(F(n-1,k)+Pow(B,n)*Pow(n,k))%TT;
	LL Res=0;
	for(int j=0;j<=k;j++) 
	Res=(Res+Pow(n>>1,k-j)*C(k,j)%TT*F(n>>1,j))%TT;
	return G[k][n]=(F(n>>1,k)+Pow(B,n>>1)*Res)%TT;
}
int main(){
	#ifdef hhh
	freopen("data.in","r",stdin);
	freopen("data.out","w",stdout);
	#endif
	scanf("%lld%lld",&N,&K);
	fac[0]=inv[0]=1;
	for(LL i=1;i<=K;i++) inv[i]=Pow(fac[i]=fac[i-1]*i%TT,TT-2);
	printf("%lld\n",(Pow(2,N-1)*F(N-1,K)+Pow(N,K))%TT);
    return 0;
}