結果

問題 No.1879 How many matchings?
ユーザー eQeeQe
提出日時 2022-03-24 07:51:42
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 4,491 bytes
コンパイル時間 4,698 ms
コンパイル使用メモリ 276,496 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-10-12 13:09:53
合計ジャッジ時間 5,331 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 2 ms
5,248 KB
testcase_04 AC 1 ms
5,248 KB
testcase_05 AC 2 ms
5,248 KB
testcase_06 AC 2 ms
5,248 KB
testcase_07 AC 2 ms
5,248 KB
testcase_08 AC 2 ms
5,248 KB
testcase_09 AC 2 ms
5,248 KB
testcase_10 AC 2 ms
5,248 KB
testcase_11 AC 2 ms
5,248 KB
testcase_12 AC 2 ms
5,248 KB
testcase_13 AC 2 ms
5,248 KB
testcase_14 AC 2 ms
5,248 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<atcoder/all>
using namespace atcoder;
#include<bits/stdc++.h>
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define fin(a) {pt(a);return 0;}
using namespace std;
using ll=long long;
using ld=long double;
using pll=pair<ll,ll>;
template<class T>T popcnt(T a){return __builtin_popcountll(a);}
template<class T>using ascending_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<class T>using descending_priority_queue=priority_queue<T>;
template<class T>bool chmax(T&a,const T&b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,const T&b){if(b<a){a=b;return 1;}return 0;}
template<typename V,typename T>T max(vector<V>&vec,const T&id){T r=id;for(auto&v:vec)chmax(r,max(v,id));return r;}
template<typename V,typename T>T min(vector<V>&vec,const T&id){T r=id;for(auto&v:vec)chmin(r,min(v,id));return r;}
istream&operator>>(istream&is,modint1000000007&x){unsigned int t;is>>t;x=t;return is;}
istream&operator>>(istream&is,modint998244353&x){unsigned int t;is>>t;x=t;return is;}
istream&operator>>(istream&is,modint&x){unsigned int t;is>>t;x=t;return is;}
ostream&operator<<(ostream&os,const modint1000000007&x){os<<x.val();return os;}
ostream&operator<<(ostream&os,const modint998244353&x){os<<x.val();return os;}
ostream&operator<<(ostream&os,const modint&x){os<<x.val();return os;}
template<class T1,class T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}
template<class T1,class T2>ostream&operator<<(ostream&os,const pair<T1,T2>&p){os<<p.first<<" "<<p.second;return os;}
template<class T>istream&operator>>(istream&is,vector<T>&v){for(T&x:v)is>>x;return is;}
template<class T>ostream&operator<<(ostream&os,const vector<T>&v){for(int i=0;i<(int)v.size();i++){os<<v[i]<<(i+1==v.size()?"":" ");}return os;}
template<class...A>void pt_rest(){cout<<'\n';}
template<class...A>void pt(){cout<<'\n';}
template<class T,class...A>void pt_rest(const T&first,const A&...rest){cout<<" "<<first;pt_rest(rest...);}
template<class T,class...A>void pt(const T&first,const A&...rest){cout<<first;pt_rest(rest...);}
template<typename V,typename H>void resize(vector<V>&vec,const H head){vec.resize(head);}
template<typename V,typename H,typename...T>void resize(vector<V>&vec,const H&head,const T...tail){vec.resize(head);for(auto&v:vec)resize(v,tail...);}
template<typename V,typename T>void fill(V&x,const T&val){x=val;}
template<typename V,typename T>void fill(vector<V>&vec,const T&val){for(auto&v:vec)fill(v,val);}
template<typename H>void vin(istream&is,const int idx,vector<H>&head){is>>head[idx];}
template<typename H,typename...T>void vin(istream&is,const int idx,vector<H>&head,T&...tail){vin(is>>head[idx],idx,tail...);}
template<typename H,typename...T>void vin(istream&is,vector<H>&head,T&...tail){for(int i=0;i<(int)head.size();i++)vin(is,i,head,tail...);}
template<typename H,typename...T>void vin(vector<H>&head,T&...tail){vin(cin,head,tail...);}
void divisor(ll n,map<ll,ll>&div){for(ll i=1;i*i<=n;i++)if(n%i==0){div[i]++;div[n/i]++;}}
void factrization(ll n,map<ll,ll>&fact){for(ll i=2;i*i<=n;i++)while(n%i==0){fact[i]++;n/=i;}if(n>1)fact[n]++;}
ll lsqrt(ll x){ll r=sqrt(x)-1;while((r+1)<=x/(r+1))r++;return r;};
ll inf=ll(1e18)+7;
ld pi=acos(-1);
ld eps=1e-10;
using v1=vector<ll>;
using v2=vector<v1>;
using v3=vector<v2>;
using v4=vector<v3>;
using S=ll;
S op(S a,S b){return a+b;}
S e(){return 0;}

using mint=modint1000000007;
using T=mint;
using mat=vector<vector<T>>;
using vec=vector<T>;
mat mul(mat&A,mat&B){
  ll n=A.size();
  ll m=B[0].size();
  ll l=B.size();
  mat C(n,vec(m));
  for(ll i=0;i<n;i++)for(ll j=0;j<m;j++)for(ll k=0;k<l;k++)C[i][j]+=A[i][k]*B[k][j];
  return C;
}
mat powmat(mat X,ll n){
  ll R=X.size();
  mat res(R,vec(R));
  for(ll i=0;i<R;i++)res[i][i]=1;
  while(n) {
    if(n&1) res=mul(res,X);
    X=mul(X,X);
    n>>=1;
  }
  return res;
}
mat transpose(mat&A){
  ll n=A.size();
  ll m=A[0].size();
  mat B(m,vec(n));
  for(ll i=0;i<n;i++)for(ll j=0;j<m;j++)B[j][i]=A[i][j];
  return B;
}

int main(void){
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  
  ll N;cin>>N;
    
  mat A={{0,1,1,0,0,0,0,0},
         {0,0,0,1,0,0,0,0},
         {1,0,0,0,0,0,0,0},
         {0,0,1,0,0,0,0,0},
         {0,0,0,1,0,1,1,0},
         {0,0,0,0,0,0,0,1},
         {0,1,0,0,1,0,0,0},
         {0,0,0,1,0,0,1,0}};

  mat _({{1,0,0,0,0,0,0,0}});
  mat v=transpose(_);
  A=powmat(A,N);
  mat res=mul(A,v);
  
  if(N&1)pt(res[1][0]+res[2][0]+res[4][0]);
  else pt(res[0][0]);
}
0