ZOJ 3538 Arrange the Schedule 矩阵快速幂

/*写了个矩阵比较戳

开始是直接爆的，果断t了*/

#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <fstream>
#include <numeric>
#include <iomanip>
#include <bitset>
#include <list>
#include <stdexcept>
#include <functional>
#include <utility>
#include <ctime>
using namespace std;
#define ll long long
#pragma comment(linker,"/STACK:102400000,102400000")
#define FOR( i, a, b ) for(ll i = a; i <= b; ++i )
const ll ma=1e+9;
const ll fa=1e+7+112;
ll n,m;
struct wgh
{
    char c;
    ll x;
};
wgh a[11];
ll x,y,mod=1000000007;
char c[11];


ll a1[4];
ll a2[4];
struct wgh1
{
    ll a[4][4];
};
wgh1 ju;
wgh1 ans1;
ll aa[][4]= {0,1,1,1,
              1,0,1,1,
              1,1,0,1,
              1,1,1,0
             };
ll a0[][4]= {1,0,0,0,
              0,1,0,0,
              0,0,1,0,
              0,0,0,1
             };
wgh1 on;
wgh1 cheng(wgh1 a,wgh1 b)
{
    wgh1 c;
    ll i,j,k;
    for(i=0; i<4; i++)
    {
        for(j=0; j<4; j++)
        {
            c.a[i][j]=0;
            for(k=0; k<4; k++)
                {
                    c.a[i][j]+=a.a[i][k]*b.a[k][j];
                    c.a[i][j]%=mod;
                }
        }
    }
    return c;
}
void mi(wgh1 ju,ll k)
{
    ll i,j;
    wgh1 ju1=ju;
    while(k)
    {
        if(k%2==1)
        {
            ans1=cheng(ans1,ju1);
        }
        k/=2;
        ju1=cheng(ju1,ju1);
    }
}
bool cmp(wgh a,wgh b)
{
    return a.x<b.x;
}
int main()
{
    //freopen("out.txt","w",stdout);
    //freopen("in.txt","r",stdin);
    ll i,j,k;
    while(~scanf("%lld%lld",&n,&m))
    {
        for(i=1; i<=m; i++)
        {
            scanf("%lld",&x);
            scanf("%s",c);
            a[i].x=x;
            a[i].c=c[0];
        }
        sort(a+1,a+1+m,cmp);
        for(i=0; i<4; i++)
        {
            for(j=0; j<4; j++)
            {
                ju.a[i][j]=aa[i][j];
                on.a[i][j]=a0[i][j];
            }
        }
        ll o=1,l=0;
        i=1;
        a[m+1].x=0;
        if(a[o].x!=i)
        {
            a1[0]=1;
            a1[1]=1;
            a1[2]=1;
            a1[3]=1;
            l=1;
        }
        else
        {
            a1[0]=0;
            a1[1]=0;
            a1[2]=0;
            a1[3]=0;
            a1[a[o].c-'A']=1;
            o++;
            l=1;
        }
        for(i=o; i<=m; i++)
        {
            ll k=a[i].x-l;
            ans1=on;
            mi(ju,k);
            a2[0]=0;
            a2[1]=0;
            a2[2]=0;
            a2[3]=0;
            for(j=0; j<4; j++)
                a2[a[i].c-'A']+=a1[j]*ans1.a[j][a[i].c-'A'];
            for(j=0; j<4; j++)
                a1[j]=a2[j]%mod;
            l=a[i].x;
            //o++;
        }
        ll k=n-l;
        ans1=on;
        mi(ju,k);
        a2[0]=0;
        for(j=0; j<4; j++)
            a2[0]+=a1[j]*ans1.a[j][0];
        a2[1]=0;
        for(j=0; j<4; j++)
            a2[1]+=a1[j]*ans1.a[j][1];
        a2[2]=0;
        for(j=0; j<4; j++)
            a2[2]+=a1[j]*ans1.a[j][2];
        a2[3]=0;
        for(j=0; j<4; j++)
            a2[3]+=a1[j]*ans1.a[j][3];
        for(j=0; j<4; j++)
            a1[j]=a2[j]%mod;
        l=a[o].x;
        ll sum=a1[0]+a1[1]+a1[2]+a1[3];
        printf("%lld\n",sum%mod);
    }
    return 0;
}