HDU 6172-Array Challenge

最新推荐文章于 2017-10-03 20:12:35 发布

NEVWAVE

最新推荐文章于 2017-10-03 20:12:35 发布

阅读量246

点赞数

分类专栏：数学

本文链接：https://blog.csdn.net/qq_35739884/article/details/77542205

版权

数学专栏收录该内容

1 篇文章 0 订阅

订阅专栏

Array Challenge
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 153428/153428 K (Java/Others)
Total Submission(s): 97 Accepted Submission(s): 38

Problem Description
There’s an array that is generated by following rule.
$h_{ 0 }=2,h_{ 1 }=3,h_{ 2 }=6,h_{ n }=4h_{ n-1 }+17h_{ n-2 }-12h_{ n-3 }-16$
And let us define two arrays bnandan as below.
$b_n=3h_{n+1} h_n+9h_{n+1} h_{n-1}+9h_n^2+27h_n h_{n-1}-18h_{n+1}-126h_n-81h_{n-1}+192(n>0)$
$a_n=b_n+4^n$
Now, you have to print $\left \lfloor √(a_n ) \right \rfloor$ , n>1.
Your answer could be very large so print the answer modular 1000000007.

Input
The first line of input contains T (1 <= T <= 1000) , the number of test cases.
Each test case contains one integer n (1 < n <= $10^{15}$ ) in one line.

Output
For each test case print $\left \lfloor √(a_n ) \right \rfloor$ modular 1000000007.

Sample Input

3
4
7
9

Sample Output

1255
324725
13185773

Source
2017 Multi-University Training Contest - Team 10

题意： $h_{ 0 }=2,h_{ 1 }=3,h_{ 2 }=6,h_{ n }=4h_{ n-1 }+17h_{ n-2 }-12h_{ n-3 }-16$
$b_n=3h_{n+1} h_n+9h_{n+1} h_{n-1}+9h_n^2+27h_n h_{n-1}-18h_{n+1}-126h_n-81h_{n-1}+192(n>0)$
$a_n=b_n+4^n$
求 $\left \lfloor √(a_n ) \right \rfloor$
一波打表后可以发现答案和 $h_{ n }$ 十分接近，由此猜想答案和 $h_{ n }$ 有较接近的递推公式，实际上 $ans_{ n }=4ans_{ n-1 }+17ans_{ n-2 }-12ans_{ n-3 }$ ，
事实上进一步地有 $ans_{ n }=4ans_{ n-1 }-7ans_{ n-2 }$
$n\le { 10 }^{ 15 }$ ,用矩阵快速幂做， $\begin{bmatrix} 0 & \quad 1 \\ -4 & \quad 7 \end{bmatrix}\left[ \begin{matrix} ans_{ n } \\ ans_{ n+1 } \end{matrix} \right] =\left[ \begin{matrix} ans_{ n+1 } \\ ans_{ n+2 } \end{matrix} \right]$

AC代码

#include <bits/stdc++.h>
using namespace std;
#define mem(s,v) memset(s,v,sizeof(s))
typedef long long ll;
const double PI = acos(-1);
const ll MOD = 1000000007;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int N = 2;//方阵维数
struct Mat{
    ll mat[N][N];
}E;
//初始化单位矩阵
Mat init(){
    Mat E;
    for(int i = 0; i < N; i++){
        for(int j = 0; j < N; j++){
            if(i == j)
            E.mat[i][i] = 1;
            else
            E.mat[i][j] = 0;
        }
    }
    return E;
}
//重载乘法
Mat operator *(Mat a,Mat b){
    Mat c;
    memset(c.mat,0,sizeof(Mat));
    for(int i = 0; i < N; i++){
        for(int j = 0; j < N; j++){
            for(int k = 0; k < N; k++){
                if(a.mat[i][k] && b.mat[k][j]){
                    c.mat[i][j] += a.mat[i][k] * b.mat[k][j];
                    c.mat[i][j] %= MOD;
                }
            }
        }
    }
    return c;
}
//重载加法
Mat operator +(Mat a,Mat b){
    Mat c;
    memset(c.mat,0,sizeof(Mat));
    for(int i = 0; i < N; i++){
        for(int j = 0; j < N; j++){
            c.mat[i][j] = a.mat[i][j] + b.mat[i][j];
        }
    }
    return c;
}
//矩阵快速幂
Mat operator ^(Mat A,ll x){
    Mat c;
    c = init();
    for(; x ; x >>= 1){
        if(x&1){
            c = c*A;
        }
        A = A*A;
    }
    return c;
}

ll get(ll x){
    if(x == 2)return 31;
    if(x == 3)return 197;
    Mat EE;
    EE.mat[0][0] = 0;
    EE.mat[0][1] = 1;
    EE.mat[1][0] = -4;
    EE.mat[1][1] = 7;
    ll beg[2] = {31,197};
    EE = EE^(x - 3);
    ll s1 = EE.mat[0][0]*beg[0] + EE.mat[0][1]*beg[1];
    ll s2 = EE.mat[1][0]*beg[0] + EE.mat[1][1]*beg[1];
    while(s2<0) s2+=MOD;
    s2%=MOD;
    return s2;
}
int main(){
    int T;
    scanf("%d",&T);
    ll n;
    while(T--){
        scanf("%lld",&n);
        printf("%lld\n",get(n));
    }
}