#916725 (C++17) No.2489 X and Xor 2

• 問題: No.2489 X and Xor 2
• ユーザー: 👑 potato167
• 提出日時: 2023-09-29 22:54:00
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 471 ms / 2,000 ms
• コード長: 4,572 bytes
• コンパイル時間: 3,490 ms
• コンパイル使用メモリ: 212,080 KB
• 実行使用メモリ: 4,408 KB
• 最終ジャッジ日時: 2023-09-29 22:54:19
• 合計ジャッジ時間: 18,553 ms
• ジャッジサーバーID （参考情報）: judge11 / judge14

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	7 ms; 4,380 KB
testcase_01	AC	455 ms; 4,384 KB
testcase_02	AC	6 ms; 4,380 KB
testcase_03	AC	6 ms; 4,376 KB
testcase_04	AC	62 ms; 4,376 KB
testcase_05	AC	8 ms; 4,376 KB
testcase_06	AC	430 ms; 4,376 KB
testcase_07	AC	471 ms; 4,376 KB
testcase_08	AC	389 ms; 4,376 KB
testcase_09	AC	421 ms; 4,380 KB
testcase_10	AC	420 ms; 4,380 KB
testcase_11	AC	326 ms; 4,376 KB
testcase_12	AC	414 ms; 4,380 KB
testcase_13	AC	415 ms; 4,380 KB
testcase_14	AC	427 ms; 4,380 KB
testcase_15	AC	441 ms; 4,376 KB
testcase_16	AC	405 ms; 4,384 KB
testcase_17	AC	442 ms; 4,408 KB
testcase_18	AC	418 ms; 4,380 KB
testcase_19	AC	419 ms; 4,376 KB
testcase_20	AC	381 ms; 4,376 KB
testcase_21	AC	344 ms; 4,380 KB
testcase_22	AC	373 ms; 4,380 KB
testcase_23	AC	355 ms; 4,376 KB
testcase_24	AC	411 ms; 4,376 KB
testcase_25	AC	398 ms; 4,376 KB
testcase_26	AC	348 ms; 4,380 KB
testcase_27	AC	467 ms; 4,380 KB
testcase_28	AC	386 ms; 4,376 KB
testcase_29	AC	420 ms; 4,376 KB
testcase_30	AC	402 ms; 4,376 KB
testcase_31	AC	335 ms; 4,376 KB
testcase_32	AC	374 ms; 4,376 KB
testcase_33	AC	377 ms; 4,376 KB
testcase_34	AC	400 ms; 4,376 KB
testcase_35	AC	406 ms; 4,376 KB
testcase_36	AC	360 ms; 4,376 KB

ソースコード

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
const ll ILL=2167167167167167167;
const int INF=2100000000;
const int mod=998244353;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p,int ty=0){
if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){assert(!a.empty());T ans=a[0]-a[0];for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}



template<class T>
using square_matrix=std::vector<std::vector<T>>;
template<class T,T (*add_op)(T,T),T(*add_e)(),T (*mul_op)(T,T),T(*mul_e)()>
square_matrix<T> mul_matrix(square_matrix<T> l,square_matrix<T> r){
	int n=l.size();
	assert((int)l[0].size()==n&&(int)r.size()==n&&(int)r[0].size()==n);
	square_matrix<T> val(n,std::vector<T>(n,add_e()));
	for(int i=0;i<n;i++) for(int j=0;j<n;j++) for(int k=0;k<n;k++){
		val[i][k]=add_op(val[i][k],mul_op(l[i][j],r[j][k]));
	}
	return val;
}
template<class T,T (*add_op)(T,T),T(*add_e)(),T (*mul_op)(T,T),T(*mul_e)()>
square_matrix<T> pow_matrix(square_matrix<T> l,long long times){
	int n=l.size();
	square_matrix<T> val(n,std::vector<T>(n,add_e()));
	for(int i=0;i<n;i++) val[i][i]=mul_e();
	while(times){
		if(times&1){
			val=mul_matrix<T,add_op,add_e,mul_op,mul_e>(val,l);
		}
		l=mul_matrix<T,add_op,add_e,mul_op,mul_e>(l,l);
		times>>=1;
	}
	return val;
}

using mat_F=ll;
mat_F add_op(mat_F a,mat_F b){
	return (a+b)%mod;
}
mat_F add_e(){
	return 0;
}
mat_F mul_op(mat_F a,mat_F b){
	return (a*b)%mod;
}
mat_F mul_e(){
	return 1;
}
#define calc mat_F,add_op,add_e,mul_op,mul_e

ll jyo(ll x,ll y,ll z){
  ll H=y; //ここから
       ll a=1,b=(x%z+z)%z,c=1;
       while(H>0){
         a*=2;
         if(H%a!=0){
           H-=a/2;
           c*=b;
           c%=z;
         }
        b*=b;
         b%=z;
      } //ここまで
 return c;
}



void solve();
// oddloop
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int t=1;
    //cin>>t;
    rep(i,0,t) solve();
}

void solve(){
    ll N,M;
    cin>>N>>M;
    ll L=60;
    ll rev=(mod+1)/2;
    vector<vector<ll>> p(L*2,vector<ll>(L*2));
    for(int i=L-1;i>=0;i--){
        vector<int> q(L);
        if(0==(M&(1ll<<i))) continue;
        rep(j,0,L){
            if(j<i) q[j]=-1;
            else if(j==i) q[j]=0;
            else if(M&(1ll<<j)) q[j]=1;
        }
        ll base=(1ll<<i)%mod;
        rep(k,0,L*2) rep(l,0,L*2){
            if(k==l) continue;
            if(q[k%L]==k/L) continue;
            if(q[l%L]!=l/L&&q[l%L]!=-1) continue;
            ll tmp=base;
            if(q[k%L]==-1) tmp=tmp*rev%mod;
            if(q[l%L]==-1){
                tmp=tmp*rev%mod;
                if(abs(k-l)==L) tmp=tmp*2ll%mod;
            }
            p[k][l]=(p[k][l]+tmp)%mod;
        }
        /*
        rep(s,0,L*2){
        vec_out(p[s]);
    }
    cout<<endl;
    vec_out(q);
    cout<<endl;*/
    }
    
    rep(k,0,L*2) rep(l,0,L*2){
        p[k][l]=p[k][l]*((1ll<<(k%L))%mod)%mod;
    }
    auto q=pow_matrix<calc>(p,N-2);
    ll ans=0;
    rep(k,0,L*2) rep(l,0,L*2){
        ll tmp=p[(k+L)%(2*L)][k]*q[k][l]%mod;
        tmp=tmp*p[l][(l+L)%(2*L)]%mod;
        tmp=tmp*jyo(1ll<<(k%L),mod-2,mod)%mod;
        ans=(ans+tmp)%mod;
        //if(tmp) cout<<k<<" "<<l<<" "<<tmp<<endl;
    }
    cout<<ans<<"\n";
}