Codeforces 575A Fibonotci 题解

题意

给定一个序列F，$F_0=0,F_1=1,F_n=s_{n-1}*F_{n-1}+s_{n-2}*F_{n-2}$，s为一个近似循环序列，就是说除了少量特殊位置外，满足$s_i=s_{i \space mod \space N}$，问$F_K \space mod \space P$

思路

矩阵乘法，特殊位置特殊处理，先用普通的矩阵乘法处理到特殊位置前的位置，再乘特殊矩阵，不断操作，最后得到答案，需要使用矩阵快速幂和线段树矩阵区间积进行计算

代码

#include <cstdio>
#include <queue>
using namespace std;
long long K,P,N,M,p,v,now,fi,se;
priority_queue<pair<long long,long long>,vector<pair<long long,long long> >,greater<pair<long long,long long> > > pq;
typedef struct matrix
{
    long long m[2][2];
}matrix;
matrix ans,temp;
matrix cross(matrix a,matrix b)
{
    matrix ret;
    ret.m[0][0]=((a.m[0][0]*b.m[0][0])%P+(a.m[0][1]*b.m[1][0])%P)%P;
    ret.m[0][1]=((a.m[0][0]*b.m[0][1])%P+(a.m[0][1]*b.m[1][1])%P)%P;
    ret.m[1][0]=((a.m[1][0]*b.m[0][0])%P+(a.m[1][1]*b.m[1][0])%P)%P;
    ret.m[1][1]=((a.m[1][0]*b.m[0][1])%P+(a.m[1][1]*b.m[1][1])%P)%P;
    return ret;
}
matrix mul(matrix a,long long b)
{
    matrix ret;
    ret.m[0][0]=1%P;
    ret.m[0][1]=0;
    ret.m[1][0]=0;
    ret.m[1][1]=1%P;
    while(b>0)
    {
        if(b%2)
            ret=cross(ret,a);
        a=cross(a,a);
        b/=2;
    }
    return ret;
}
typedef struct node
{
    matrix val;
    long long left;
    long long right;
}node;
long long s[50001];
node tree[200001];
void build(long long p,long long l,long long r)
{
    tree[p].left=l;
    tree[p].right=r;
    if(l==r)
    {
        tree[p].val.m[0][0]=s[(l+1)%N]%P;
        tree[p].val.m[0][1]=1%P;
        tree[p].val.m[1][0]=s[l]%P;
        tree[p].val.m[1][1]=0;
        return;
    }
    build(p*2,l,(l+r)/2);
    build(p*2+1,(l+r)/2+1,r);
    tree[p].val=cross(tree[p*2].val,tree[p*2+1].val);
    return;
}
matrix query(long long p,long long l,long long r)
{
    matrix ret;
    ret.m[0][0]=1;
    ret.m[0][1]=0;
    ret.m[1][0]=0;
    ret.m[1][1]=1;
    if(l<=tree[p].left&&r>=tree[p].right)
        return tree[p].val;
    if(l<=(tree[p].left+tree[p].right)/2)
        ret=cross(ret,query(p*2,l,r));
    if(r>(tree[p].left+tree[p].right)/2)
        ret=cross(ret,query(p*2+1,l,r));
    return ret;
}
void change(long long from,long long to,matrix &ans)
{
    if(from/N==(to-1)/N)
    {
        ans=cross(ans,query(1,from%N,(to-1+N)%N));
    }
    else
    {
        ans=cross(ans,query(1,from%N,N-1));
        ans=cross(ans,mul(tree[1].val,(to-1)/N-from/N-1));
        ans=cross(ans,query(1,0,(to-1+N)%N));
    }
}
int main()
{
    matrix ans,all;
    scanf("%I64d%I64d",&K,&P);
    scanf("%I64d",&N);
    for(long long i=0;i<N;i++)
        scanf("%I64d",&s[i]);
    build(1,0,N-1);
    scanf("%I64d",&M);
    for(long long i=0;i<M;i++)
    {
        scanf("%I64d%I64d",&p,&v);
        pq.push(make_pair(p,v));
    }
    ans.m[0][0]=1%P;
    ans.m[0][1]=0;
    ans.m[1][0]=0;
    ans.m[1][1]=0;
    now=0;
    while(!pq.empty())
    {
        if(pq.top().first>=K)
            break;
        if(now!=pq.top().first)
        {
            if(now!=pq.top().first-1)
                change(now,pq.top().first-1,ans);
            temp.m[0][0]=pq.top().second%P;
            temp.m[0][1]=1%P;
            temp.m[1][0]=s[(pq.top().first-1)%N]%P;
            temp.m[1][1]=0;
            ans=cross(ans,temp);
            now=pq.top().first;
        }
        if(now==K-1)
            break;
        fi=pq.top().first;
        se=pq.top().second;
        pq.pop();
        if(pq.top().first==fi+1)
        {
            temp.m[0][0]=pq.top().second%P;
            temp.m[0][1]=1%P;
            temp.m[1][0]=se%P;
            temp.m[1][1]=0;
        }
        else
        {
            temp.m[0][0]=s[(now+1)%N];
            temp.m[0][1]=1%P;
            temp.m[1][0]=se%P;
            temp.m[1][1]=0;
        }
        ans=cross(ans,temp);
        now++;
    }
    if(now!=K-1)
        change(now,K-1,ans);
    if(K==0)
        printf("0\n");
    else printf("%I64d\n",ans.m[0][0]);
    return 0;
}