ACM-ICPC徐州赛区网络预赛 A题Hard to prepare(线性代数解法)

呃…csdn挂了一天了,都上传不了文档
$\text{(ICPC18徐州A)求n元环相邻元素同或不为零的方案.}$

如果从大家的思路来看,异或结果与同或结果只差一个奇数(有人说是偶数,我算了一下…貌似是奇数!)方案的$2^k$.现在考虑异或方案.

设$M$是$2^k$阶矩阵,若$f(i,j)$代表选择到前$i$个元素时末位为第$j$个假面的方案数,那么若$f[i,j]=\sum _{x=1}^{2^k}M(j;x)f[i-1,x]$.
则:$\vec{f}[i]=M\vec{f}[i-1],M=$
$$⟮\begin{array}{cccccc}0& 1& 1& \dots & 1& \\ 1& 0& 1& \dots & 1& \\ 1& 1& 0& \dots & 1& \\ ⋮& ⋮& ⋮& \ddots & ⋮& \\ 1& 1& 1& \dots & 0& \end{array}⟯$$
$\vec{f}[N+1]=M^N\vec{f}[1]$,那么原题即是求$\mathrm{t}\mathrm{r}(M^N)$.
令$J$为$2^k$阶全1矩阵,$I$为$2^k$阶单位矩阵,则$M=J-I,M^N=(J-I{)}^N$.
$\text{Theorem }{J}_n^K=n^{K-1}{J}_n(K\ge 1)$.
证明:略.
所以
$\begin{array}{rl}\mathrm{t}\mathrm{r}(M^N)=& \mathrm{t}\mathrm{r}(\sum _{i=0}^N(\genfrac{}{}{0ex}{}{N}{i})J^i(-I{)}^{N-i})=2^k(\sum _{i=1}^N\left(\genfrac{}{}{0ex}{}{N}{i}\right)(-1{)}^{N-i}{2}^{k(i-1)}+(-1{)}^N)\\ =& \sum _{i=0}^{N-1}\left(\genfrac{}{}{0ex}{}{N}{i}\right)(-1{)}^i{2}^{k(N-i)}+(-1{)}^N{2}^k.\end{array}$.

但是显然这样是不能体现我们暴力做题的强大威力.
设$M$是$2^k$阶矩阵,若$f(i,j)$代表选择到前$i$个元素时末位为第$j$个假面的方案数,那么若$f[i,j]=\sum _{x=1}^{2^k}M(j;x)f[i-1,x]$.
则:$\vec{f}[i]=M\vec{f}[i-1],M=$
$$⟮\begin{array}{cccccc}1& 1& 1& \dots & 0& \\ 1& 1& 1& \dots & 1& \\ 1& 1& 0& \dots & 1& \\ ⋮& & ⋮& & ⋮& \\ 0& 1& 1& \dots & 1& \end{array}⟯$$
$\vec{f}[N+1]=M^N\vec{f}[1]$,那么原题即是求$\mathrm{t}\mathrm{r}(M^N)$.
令$J$为$2^k$阶全1矩阵,$I_r$为$2^k$阶斜单位矩阵,则$M=J-I_r,M^N=(J-I_r{)}^N$.
$\text{Theorem }{J}_n^K=n^{K-1}{J}_n(K\ge 1)$.
$\text{Theorem }{I}_r^K=I_r,K是奇数,否则I_r^K=I$.
所以
$\begin{array}{rl}\mathrm{t}\mathrm{r}(M^N)=& \mathrm{t}\mathrm{r}(\sum _{i=0}^N(\genfrac{}{}{0ex}{}{N}{i})J^i(-I_r{)}^{N-i})=2^k(\sum _{i=1}^N\left(\genfrac{}{}{0ex}{}{N}{i}\right)(-1{)}^{N-i}{2}^{k(i-1)}+(-1{)}^N[N是偶数])\\ =& \sum _{i=0}^{N-1}\left(\genfrac{}{}{0ex}{}{N}{i}\right)(-1{)}^i{2}^{k(N-i)}+(-1{)}^N{2}^k[N是偶数]=\sum _{i=0}^{N-1}\left(\genfrac{}{}{0ex}{}{N}{i}\right)(-1{)}^i{2}^{k(N-i)}+2^k[N是偶数]\end{array}$.

没有任何分类讨论,可以说是很优雅了~

#include <cstdio>
const long long mod=1000000007;
long long qp(long long a,long long b){
	long long res=1;
	while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}
	return res;
}
int main(){
	int T;long long n,k;
	scanf("%d",&T);
	while(T--){
		scanf("%lld%lld",&n,&k);
		long long _2k=qp(2,k),res=qp((_2k-1+mod)%mod,n);
		if((n&1)==0)res+=_2k-1;else res++;
		printf("%lld\n",(res+mod)%mod);
	}
}