The 2019 Asia Nanchang First Round Online Programming Contest The Nth Item

https://nanti.jisuanke.com/t/41355 

歪解：循环节 

大佬解：k进制快速幂跑q询问；

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
//#include <unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%lld",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 1e18
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

//-----------------------------------------------

const int maxn=1e6+9;
const int maxm=5e6+9;
const int mod=998244353;


const int MAXN=65540;

//base[i][1]   :   a^1
//base[i][j]   :  j*a^i
ll base[5][MAXN][2][2];

void init(ll k)
{
    base[0][1][0][0]=3;
    base[0][1][0][1]=2;
    base[0][1][1][0]=1;
    base[0][1][1][1]=0;

    int up=3;//估计基数的指数
    ll tmp[2][2];
    for(int z=0;z<=up;z++)
    {
        if(z)
        {
            for(int i=0;i<2;i++)
            {
                for(int j=0;j<2;j++) base[z][1][i][j]=base[z-1][k][i][j];
            }
        }

        for(int u=2;u<=k;u++)
        {
            mem(tmp,0);
            for(int i=0;i<2;i++)
            {
                for(int j=0;j<2;j++)
                {
                    for(int p=0;p<2;p++)
                        tmp[i][j]=(tmp[i][j]+base[z][1][i][p]*base[z][u-1][p][j]%mod)%mod;
                }
            }
            for(int i=0;i<2;i++)
            {
                for(int j=0;j<2;j++)
                    base[z][u][i][j]=tmp[i][j]%mod;
            }
        }

    }
}

ll k_ksm(ll b)
{
    int k=65536;
    ll ans[2]={1,0};
    int u=0,yu;
    ll tmp[2];
    while(b)
    {
        yu=b%k;
        if(yu)
        {
            mem(tmp,0);
            for(int i=0;i<2;i++)
            {
                for(int j=0;j<2;j++)
                    tmp[i]=(tmp[i]+base[u][yu][i][j]*ans[j]%mod)%mod;
            }
            for(int i=0;i<2;i++) ans[i]=tmp[i]%mod;
        }
        u++;
        b/=k;
    }
    return ans[0]%mod;
}

int main()
{
    //FAST_IO;

    ll q,n;
    scanf("%lld%lld",&q,&n);
    ll a=0;
    ll ans=-1;
    int k=65536;
    init(k);
    for(int i=0;i<q;i++)
    {
        //if(n-1>0)
            a=k_ksm(n-1);
        //else a=0;
        n^=(a*a);
        if(ans==-1) ans=a;
        else ans=ans^a;
        //if(!a) break;
    }
    printf("%lld\n",ans);

    return 0;
}

#include<bits/stdc++.h>
#define endl '\n'
#define mem(a) memset(a,0,sizeof(a)
using namespace std;
typedef long long ll;
const int maxn=1e6+9;
struct Mat{
    ll m[3][3];
};
Mat a,e;
const int mod=998244353;
Mat Mul(Mat x,Mat y)
{
    Mat c;
    for(int i=1;i<=2;i++)
      for(int j=1;j<=2;j++)
        c.m[i][j]=0;
    for(int i=1;i<=2;i++)
      for(int j=1;j<=2;j++)
        for(int k=1;k<=2;k++)
          c.m[i][j]=(c.m[i][j]%mod+x.m[i][k]*y.m[k][j]%mod)%mod;
    return c;
}
Mat pow(Mat x,ll y)
{
    Mat ans=e;
    while(y)
    {
        if(y&1)
         ans=Mul(ans,x);
        x=Mul(x,x);
        y>>=1;
    }
    return ans;
}

map<ll,int>mp;
ll ans[maxn];
int main(){
    //freopen("input.txt","w",stdout);
    a.m[1][1]=3,a.m[1][2]=2;
    a.m[2][1]=1,a.m[2][2]=0;
    e.m[2][2]=1;e.m[1][1]=1;
    int q;
    ll n;
//    for(int i=0;i<=5e5;i++){
//        if(i==0)
//            dp[0]=0;
//        else {
//            Mat tmp=pow(a,i-1);
//            //cout<<tmp.m[1][1]<<',';
//            dp[i]=tmp.m[1][1];
//        }
//    }


    int now=0;
    int yu=0;
    int len=0;
    scanf("%d %lld",&q,&n);
    for(int i=1;i<=q;i++){


        Mat tmp;
        ll c;

        tmp=pow(a,n-1);
        c=tmp.m[1][1];

        ans[i]=ans[i-1]^c;

        n=(n^(c*c));

        if(mp[n])
        {
            now=mp[n];
            yu=q-i;
            len=i-now;
            break;
        }

        mp[n]=i;

        //cout<<ans[i]<<" ";
    }

    if(len)
    {
        yu=yu%len;
        printf("%lld\n",ans[yu+now]);
    }
    else
        printf("%lld\n",ans[q]);

}