結果
問題 | No.579 3 x N グリッド上のサイクルのサイズ(hard) |
ユーザー |
![]() |
提出日時 | 2017-11-16 11:47:02 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 3 ms / 2,000 ms |
コード長 | 2,409 bytes |
コンパイル時間 | 1,137 ms |
コンパイル使用メモリ | 159,452 KB |
実行使用メモリ | 6,824 KB |
最終ジャッジ日時 | 2024-11-25 06:14:13 |
合計ジャッジ時間 | 3,214 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 80 |
コンパイルメッセージ
main.cpp:70:1: warning: ISO C++ forbids declaration of ‘main’ with no type [-Wreturn-type] 70 | main(){ | ^~~~
ソースコード
#include <bits/stdc++.h>#define FOR(i,a,b) for (int i=(a);i<(b);i++)#define FORR(i,a,b) for (int i=(a);i>=(b);i--)#define pb push_back#define pcnt __builtin_popcount#define show(x) cout<<#x<<" = "<<x<<endl;#define maxs(x,y) x = max(x,y)#define mins(x,y) x = min(x,y)#define fi first#define se second#define rng(a) a.begin(),a.end()#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)#define sz(x) (int)(x).size()#define mp make_pairusing namespace std;typedef long long ll;typedef pair<int,int> pii;typedef vector<int> vi;typedef vector<vi> vvi;typedef vector<pii> vpii;typedef set<int> si;typedef pair<ll,ll> pll;typedef vector<ll> vl;typedef vector<vl> vvl;typedef vector<pll> vpll;typedef set<ll> sl;template<typename T>string join(vector<T>&v){stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(int)p;}void dout(double d){printf("%.12f\n",d);}const int iinf = 1e9;const ll linf = 1e18;const int mod = 1e9+7;const double pi = acos(-1);const double eps = 1e-10;const int L = 18;ll a[L][L] = {1,1,1,1,1,1,1,1,0,2,3,4,2,3,2,4,0,0,0,1,1,1,0,0,0,1,0,2,3,4,0,0,0,4,0,2,0,1,1,1,1,1,0,0,0,3,2,3,3,4,0,0,0,3,0,1,1,1,1,1,1,0,1,4,3,2,4,3,4,0,4,4,0,0,1,1,1,1,0,0,0,0,3,4,2,3,0,0,0,2,0,0,1,1,1,1,1,0,0,0,4,3,3,2,3,0,0,3,0,0,0,1,0,1,1,1,0,0,0,4,0,3,2,4,0,2,0,0,0,1,0,0,0,1,0,0,0,4,0,0,0,4,0,0,0,1,0,0,0,0,1,0,1,4,0,0,0,0,4,0,4,4,0,0,0,0,0,0,0,0,0,1,1,1,0,0,0,1,0,1,0,0,0,0,0,0,0,0,0,1,1,1,1,1,0,0,0,1,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,0,1,1,0,0,0,0,0,0,0,0,0,0,1,1,1,1,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,1,0,1,1,1,0,1,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,1,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1}, b[L][L], c[L][L], n;void merge(ll (&a1)[L][L], ll (&a2)[L][L], ll (&a3)[L][L]){FOR(i, 0, L)FOR(j, 0, L){ll d = 0;FOR(k, 0, L) d += a1[i][k] * a2[k][j] % mod;c[i][j] = d % mod;}FOR(i, 0, L)FOR(j, 0, L) a3[i][j] = c[i][j];}main(){cin.tie(0);ios::sync_with_stdio(false);FOR(i, 0, L)b[i][i] = 1;cin >> n;n++;while(n > 0){if(n & 1)merge(b, a, b);merge(a, a, a);n >>= 1;}cout << b[0][17] << endl;}