結果
問題 | No.621 3 x N グリッド上のドミノの置き方の数 |
ユーザー |
![]() |
提出日時 | 2017-12-01 19:02:36 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 82 ms / 3,000 ms |
コード長 | 8,733 bytes |
コンパイル時間 | 986 ms |
コンパイル使用メモリ | 118,680 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-11-27 22:43:34 |
合計ジャッジ時間 | 6,009 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 66 |
ソースコード
#include <iostream>#include <algorithm>#include <bitset>#include <map>#include <queue>#include <set>#include <stack>#include <string>#include <utility>#include <vector>#include <array>#include <unordered_map>#include <complex>#include <deque>#include <cassert>#include <cmath>#include <functional>#include <iomanip>#include <chrono>#include <random>#include <numeric>#include <tuple>#include <cstring>using namespace std;#define forr(x,arr) for(auto&& x:arr)#define _overload3(_1,_2,_3,name,...) name#define _rep2(i,n) _rep3(i,0,n)#define _rep3(i,a,b) for(int i=int(a);i<int(b);++i)#define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2,)(__VA_ARGS__)#define _rrep2(i,n) _rrep3(i,0,n)#define _rrep3(i,a,b) for(int i=int(b)-1;i>=int(a);i--)#define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__)#define all(x) (x).begin(),(x).end()#define bit(n) (1LL<<(n))#define sz(x) ((int)(x).size())#define TEN(n) ((ll)(1e##n))#define fst first#define snd secondstring DBG_DLM(int &i){return(i++==0?"":", ");}#define DBG_B(exp){int i=0;os<<"{";{exp;}os<<"}";return os;}template<class T>ostream&operator<<(ostream&os,vector<T>v);template<class T>ostream&operator<<(ostream&os,set<T>v);template<class T>ostream&operator<<(ostream&os,queue<T>q);template<class T>ostream&operator<<(ostream&os,priority_queue<T>q);template<class T,class K>ostream&operator<<(ostream&os,pair<T,K>p);template<class T,class K>ostream&operator<<(ostream&os,map<T,K>mp);template<class T,class K>ostream&operator<<(ostream&os,unordered_map<T,K>mp);template<int I,class TPL>void DBG(ostream&os,TPL t){}template<int I,class TPL,class H,class...Ts>void DBG(ostream&os,TPL t){os<<(I==0?"":", ")<<get<I>(t);DBG<I+1,TPL,Ts...>(os,t);}template<class T,class K>void DBG(ostream&os,pair<T,K>p,string delim){os<<"("<<p.first<<delim<<p.second<<")";}template<class...Ts>ostream&operator<<(ostream&os,tuple<Ts...>t){os<<"(";DBG<0,tuple<Ts...>,Ts...>(os,t);os<<")";return os;}template<class T,class K>ostream&operator<<(ostream&os,pair<T,K>p){DBG(os,p,", ");return os;}template<class T>ostream&operator<<(ostream&os,vector<T>v){DBG_B(forr(t,v){os<<DBG_DLM(i)<<t;});}template<class T>ostream&operator<<(ostream&os,set<T>s){DBG_B(forr(t,s){os<<DBG_DLM(i)<<t;});}template<class T>ostream&operator<<(ostream&os,queue<T>q){DBG_B(for(;q.size();q.pop()){os<<DBG_DLM(i)<<q.front();});}template<class T>ostream&operator<<(ostream&os,priority_queue<T>q){DBG_B(for(;q.size();q.pop()){os<<DBG_DLM(i)<<q.top();});}template<class T,class K>ostream&operator<<(ostream&os,map<T,K>m){DBG_B(forr(p,m){os<<DBG_DLM(i);DBG(os,p,"->");});}template<class T,class K>ostream&operator<<(ostream&os,unordered_map<T,K>m){DBG_B(forr(p,m){os<<DBG_DLM(i);DBG(os,p,"->");});}#define DBG_OVERLOAD(_1,_2,_3,_4,_5,_6,macro_name,...)macro_name#define DBG_LINE(){char s[99];sprintf(s,"line:%3d | ",__LINE__);cerr<<s;}#define DBG_OUTPUT(v){cerr<<(#v)<<"="<<(v);}#define DBG1(v,...){DBG_OUTPUT(v);}#define DBG2(v,...){DBG_OUTPUT(v);cerr<<", ";DBG1(__VA_ARGS__);}#define DBG3(v,...){DBG_OUTPUT(v);cerr<<", ";DBG2(__VA_ARGS__);}#define DBG4(v,...){DBG_OUTPUT(v);cerr<<", ";DBG3(__VA_ARGS__);}#define DBG5(v,...){DBG_OUTPUT(v);cerr<<", ";DBG4(__VA_ARGS__);}#define DBG6(v,...){DBG_OUTPUT(v);cerr<<", ";DBG5(__VA_ARGS__);}#define DEBUG0(){DBG_LINE();cerr<<endl;}#ifdef LOCAL#define out(...){DBG_LINE();DBG_OVERLOAD(__VA_ARGS__,DBG6,DBG5,DBG4,DBG3,DBG2,DBG1)(__VA_ARGS__);cerr<<endl;}#else#define out(...)#endifusing ll=long long;using pii=pair<int,int>;using pll=pair<ll,ll>;using pil=pair<int,ll>;using pli=pair<ll,int>;using vs=vector<string>;using vvs=vector<vs>;using vvvs=vector<vvs>;using vb=vector<bool>;using vvb=vector<vb>;using vvvb=vector<vvb>;using vi=vector<int>;using vvi=vector<vi>;using vvvi=vector<vvi>;using vl=vector<ll>;using vvl=vector<vl>;using vvvl=vector<vvl>;using vd=vector<double>;using vvd=vector<vd>;using vvvd=vector<vvd>;using vpii=vector<pii>;using vvpii=vector<vpii>;using vvvpii=vector<vvpii>;template<class A,class B>bool amax(A&a,const B&b){return b>a?a=b,1:0;}template<class A,class B>bool amin(A&a,const B&b){return b<a?a=b,1:0;}ll ri(){ll l;cin>>l;return l;} string rs(){string s;cin>>s;return s;}const int mod = 1e9+7;template<int MOD> struct Mint {int x;Mint() : x(0) {}Mint(int y) : x(y >= 0 ? y % MOD : MOD - (-y) % MOD) {}Mint(int64_t sll) : x(sll % MOD) { if (x < 0) x += MOD; }Mint &operator+=(const Mint &rhs){ if((x += rhs.x) >= MOD) x -= MOD; return *this; }Mint &operator-=(const Mint &rhs){ if((x += MOD - rhs.x) >= MOD) x -= MOD; return *this; }Mint &operator*=(const Mint &rhs){ x = 1LL*x*rhs.x % MOD; return *this; }Mint &operator/=(const Mint &rhs){ x = (1LL*x*rhs.inv().x) % MOD; return *this; }Mint operator-() const { return Mint(-x); }Mint operator+(const Mint &rhs) const { return Mint(*this) += rhs; }Mint operator-(const Mint &rhs) const { return Mint(*this) -= rhs; }Mint operator*(const Mint &rhs) const { return Mint(*this) *= rhs; }Mint operator/(const Mint &rhs) const { return Mint(*this) /= rhs; }bool operator<(const Mint &rhs) const { return x < rhs.x; }Mint inv() const {signed a = x, b = MOD, u = 1, v = 0, t;while (b) { t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); }return Mint(u);}Mint operator^(uint64_t t) const {Mint e = *this, res = 1;for(; t; e *= e, t>>=1) if (t & 1) res *= e;return res;}};template<int MOD> ostream &operator<<(ostream &os, const Mint<MOD> &rhs) { return os << rhs.x; }template<int MOD> istream &operator>>(istream &is, Mint<MOD> &rhs) { int64_t s; is >> s; rhs = Mint<MOD>(s); return is; };using mint = Mint<mod>;using vm=vector<mint>;using vvm=vector<vm>;using vvvm=vector<vvm>;template <class T, int N> struct matrix_ {array<T, N*N> val;matrix_(vector<vector<T>> ini) {for (int i = 0; i < N; i++) for (int j = 0; j < N; j++)val[i * N + j] = ini[i][j];}matrix_(int d = 0) {for (int i = 0; i < N; i++) for (int j = 0; j < N; j++)val[i * N + j] = T((i == j) * d);}matrix_ operator+(const matrix_ &x) const {matrix_ ret;for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) {ret.val[i * N + j] = val[i * N + j] + x.val[i * N + j];}return ret;}matrix_ operator*(const matrix_ &x) const {matrix_ ret;for (int i = 0; i < N; i++) for (int k = 0; k < N; k++) for (int j = 0; j < N; j++) {ret.val[i * N + j] += val[i * N + k] * x.val[k * N + j];}return ret;}matrix_ operator^(unsigned long long p) const {matrix_ ret(1);matrix_ x(*this);while (p) {if (p & 1) ret = ret * x;x = x * x;p >>= 1;}return ret;}T& at(int row, int col) {return val[row * N + col];}};using Mat = matrix_<mint, 64>;mint solve() {ll n = ri();Mat mat;rep(i, bit(3)) {bool i0 = (i & bit(0)) != 0;bool i1 = (i & bit(1)) != 0;bool i2 = (i & bit(2)) != 0;rep(j, bit(3)) {bool j0 = (j & bit(0)) != 0;bool j1 = (j & bit(1)) != 0;bool j2 = (j & bit(2)) != 0;int from = (j << 3) | i;rep(p0, 2) {if (i0 && p0) continue;if (!j0 && !p0) continue;rep(p1, 2) {if (i1 && p1) continue;if (!j1 && !p1) continue;rep(p2, 2) {if (i2 && p2) continue;if (!j2 && !p2) continue;if ((i0 | p0) == 0 && (i1 | p1) == 0) continue;if ((i2 | p2) == 0 && (i1 | p1) == 0) continue;int y = (p2 << 2) + (p1 << 1) + p0;int x = y | i;int to = (x << 3) | y;mat.at(from, to) += 1;}}}if (!i0 && !i1) {if (i2) {int x = 3 + (1 << 2);int y = 0 + (0 << 2);int to = (x << 3) | y;mat.at(from, to) += 1;}else if (j2) {rep(p2, 2) {int x = 3 + (p2 << 2);int y = 0 + (p2 << 2);int to = (x << 3) | y;mat.at(from, to) += 1;}}else {int x = 3 + (1 << 2);int y = 0 + (1 << 2);int to = (x << 3) | y;mat.at(from, to) += 1;}}if (!i1 && !i2) {if (i0) {int x = 6 + (1 << 0);int y = 0 + (0 << 0);int to = (x << 3) | y;mat.at(from, to) += 1;}else if (j0) {rep(p2, 2) {int x = 6 + (p2 << 0);int y = 0 + (p2 << 0);int to = (x << 3) | y;mat.at(from, to) += 1;}}else {int x = 6 + (1 << 0);int y = 0 + (1 << 0);int to = (x << 3) | y;mat.at(from, to) += 1;}}}}mat = mat ^ n;mint ans = 0;rep(j, 2, bit(3)) {if (j == 4) continue;int from = j << 3;ans += mat.at(56, from);}return ans;}void Main() {cout << solve() << endl;}signed main() {cin.tie(nullptr);ios::sync_with_stdio(false);Main();return 0;}