hdu 4686 Arc of Dream（构造矩阵快速幂）

最新推荐文章于 2020-07-01 18:38:39 发布

花街糖

最新推荐文章于 2020-07-01 18:38:39 发布

阅读量919

点赞数

分类专栏：数学 ACM之路（c/c++）文章标签： ACM 矩阵快速幂

本文链接：https://blog.csdn.net/u010527492/article/details/10124355

版权

ACM之路（c/c++）同时被 2 个专栏收录

227 篇文章 1 订阅

订阅专栏

数学

42 篇文章 0 订阅

订阅专栏

Arc of Dream

Time Limit: 2000/2000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)
Total Submission(s): 309 Accepted Submission(s): 100

Problem Description

An Arc of Dream is a curve defined by following function:

where
a ₀ = A0
a _i = a _i-1*AX+AY
b ₀ = B0
b _i = b _i-1*BX+BY
What is the value of AoD(N) modulo 1,000,000,007?

Input

There are multiple test cases. Process to the End of File.
Each test case contains 7 nonnegative integers as follows:
N
A0 AX AY
B0 BX BY
N is no more than 10 ¹⁸, and all the other integers are no more than 2×10 ⁹.

Output

For each test case, output AoD(N) modulo 1,000,000,007.

Sample Input

Sample Output

Author

Zejun Wu (watashi)

Source

2013 Multi-University Training Contest 9

Recommend

zhuyuanchen520

题意：求式子的值

题意：根据AoD（n+1）=AoD（n）+a（n）*b（n）

a（n+1）*b（n+1）=ax*bx*a（n）*b（n）+ax*by*a（n）+bx*ay*b（n）+ay*by

a（n+1）=ax*a（n）+ay

b（n+1）=bx*b（n）+by

还有一个常数1 构造5*5阶的矩阵快速幂，就可以了....我才不会说hdu 竟然卡lld输入输出.....气死人了.....

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
const long long mod=1000000007;
long long n,a0,ax,ay,b0,bx,by;
struct point{
    long long a[6][6];
}res,e;
void init()
{
    int i;

    a0=a0%mod;  ax=ax%mod;  ay=ay%mod;
    b0=b0%mod;  bx=bx%mod;  by=by%mod;

    memset(res.a,0,sizeof(res.a));
    memset(e.a,0,sizeof(e.a));

    for(i=0;i<=5;i++) res.a[i][i]=1;
    e.a[1][1]=e.a[2][1]=e.a[5][5]=1;

    e.a[2][2]=ax*bx%mod;
    e.a[3][2]=ax*by%mod;
    e.a[4][2]=ay*bx%mod;
    e.a[5][2]=ay*by%mod;

    e.a[3][3]=ax%mod;
    e.a[5][3]=ay%mod;

    e.a[4][4]=bx%mod;
    e.a[5][4]=by%mod;
}
struct point mult(struct point x,struct point y)
{
    struct point temp;
    int i,j,k;

    for(i=1;i<=5;i++)
    {
        for(j=1;j<=5;j++)
        {
            temp.a[i][j]=0;
            for(k=1;k<=5;k++)
            {
                temp.a[i][j]=temp.a[i][j]+x.a[i][k]*y.a[k][j]%mod;
                if(temp.a[i][j]>=mod) temp.a[i][j]%=mod;
            }
        }
    }

    return temp;
}
void solve()
{
    while(n)
    {
        if(n&1ll) res=mult(res,e);
        e=mult(e,e);
        n=n>>1ll;
    }
}
void output()
{
    long long c[6],ans=0;
    int i;

    c[1]=0;
    c[2]=a0*b0%mod;
    c[3]=a0;
    c[4]=b0;
    c[5]=1;

    for(i=1;i<=5;i++) ans=(ans+c[i]*res.a[i][1]%mod)%mod;
    printf("%I64d\n",(ans+mod)%mod);
}
int main()
{
    while(scanf("%I64d",&n)>0)
    {
        scanf("%I64d%I64d%I64d",&a0,&ax,&ay);
        scanf("%I64d%I64d%I64d",&b0,&bx,&by);
        init();
        solve();
        output();
    }
    return 0;
}