結果
問題 | No.906 Y字グラフ |
ユーザー |
![]() |
提出日時 | 2019-10-11 21:56:46 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 17 ms / 2,000 ms |
コード長 | 6,867 bytes |
コンパイル時間 | 2,611 ms |
コンパイル使用メモリ | 214,492 KB |
最終ジャッジ日時 | 2025-01-07 21:38:58 |
ジャッジサーバーID (参考情報) |
judge1 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 28 |
ソースコード
#pragma GCC optimize ("Ofast")#include<bits/stdc++.h>using namespace std;#define MD 1000000007struct mint{static unsigned md;static unsigned W;static unsigned R;static unsigned Rinv;static unsigned mdninv;static unsigned RR;unsigned val;mint(){}mint(int a){val = mulR(a);}mint(unsigned a){val = mulR(a);}mint(long long a){val = mulR(a);}mint(unsigned long long a){val = mulR(a);}int get_inv(long long a, int md){long long t=a;long long s=md;long long u=1;long long v=0;long long e;while(s){e=t/s;t-=e*s;u-=e*v;swap(t,s);swap(u,v);}if(u<0){u+=md;}return u;}void setmod(unsigned m){int i;unsigned t;W = 32;md = m;R = (1ULL << W) % md;RR = (unsigned long long)R*R % md;switch(m){case 104857601:Rinv = 2560000;mdninv = 104857599;break;case 998244353:Rinv = 232013824;mdninv = 998244351;break;case 1000000007:Rinv = 518424770;mdninv = 2226617417U;break;case 1000000009:Rinv = 171601999;mdninv = 737024967;break;case 1004535809:Rinv = 234947584;mdninv = 1004535807;break;case 1007681537:Rinv = 236421376;mdninv = 1007681535;break;case 1012924417:Rinv = 238887936;mdninv = 1012924415;break;case 1045430273:Rinv = 254466304;mdninv = 1045430271;break;case 1051721729:Rinv = 257538304;mdninv = 1051721727;break;default:Rinv = get_inv(R, md);mdninv = 0;t = 0;for(i=(0);i<((int)W);i++){if(t%2==0){t+=md;mdninv |= (1U<<i);}t /= 2;}}}unsigned mulR(unsigned a){return (unsigned long long)a*R%md;}unsigned mulR(int a){if(a < 0){a = a%((int)md)+(int)md;}return mulR((unsigned)a);}unsigned mulR(unsigned long long a){return mulR((unsigned)(a%md));}unsigned mulR(long long a){a %= md;if(a < 0){a += md;}return mulR((unsigned)a);}unsigned reduce(unsigned T){unsigned m = T * mdninv;unsigned t = (unsigned)((T + (unsigned long long)m*md) >> W);if(t >= md){t -= md;}return t;}unsigned reduce(unsigned long long T){unsigned m = (unsigned)T * mdninv;unsigned t = (unsigned)((T + (unsigned long long)m*md) >> W);if(t >= md){t -= md;}return t;}unsigned get(){return reduce(val);}mint &operator+=(mint a){val += a.val;if(val >= md){val -= md;}return *this;}mint &operator-=(mint a){if(val < a.val){val = val + md - a.val;}else{val -= a.val;}return *this;}mint &operator*=(mint a){val = reduce((unsigned long long)val*a.val);return *this;}mint &operator/=(mint a){return *this *= a.inverse();}mint operator+(mint a){return mint(*this)+=a;}mint operator-(mint a){return mint(*this)-=a;}mint operator*(mint a){return mint(*this)*=a;}mint operator/(mint a){return mint(*this)/=a;}mint operator+(int a){return mint(*this)+=mint(a);}mint operator-(int a){return mint(*this)-=mint(a);}mint operator*(int a){return mint(*this)*=mint(a);}mint operator/(int a){return mint(*this)/=mint(a);}mint operator+(long long a){return mint(*this)+=mint(a);}mint operator-(long long a){return mint(*this)-=mint(a);}mint operator*(long long a){return mint(*this)*=mint(a);}mint operator/(long long a){return mint(*this)/=mint(a);}mint operator-(void){mint res;if(val){res.val=md-val;}else{res.val=0;}return res;}operator bool(void){return val!=0;}operator int(void){return get();}operator long long(void){return get();}mint inverse(){int a = val;int b = md;int u = 1;int v = 0;int t;mint res;while(b){t = a / b;a -= t * b;swap(a, b);u -= t * v;swap(u, v);}if(u < 0){u += md;}res.val = (unsigned long long)u*RR % md;return res;}mint pw(unsigned long long b){mint a(*this);mint res;res.val = R;while(b){if(b&1){res *= a;}b >>= 1;a *= a;}return res;}bool operator==(int a){return mulR(a)==val;}bool operator!=(int a){return mulR(a)!=val;}};unsigned mint::md;unsigned mint::W;unsigned mint::R;unsigned mint::Rinv;unsigned mint::mdninv;unsigned mint::RR;mint operator+(int a, mint b){return mint(a)+=b;}mint operator-(int a, mint b){return mint(a)-=b;}mint operator*(int a, mint b){return mint(a)*=b;}mint operator/(int a, mint b){return mint(a)/=b;}mint operator+(long long a, mint b){return mint(a)+=b;}mint operator-(long long a, mint b){return mint(a)-=b;}mint operator*(long long a, mint b){return mint(a)*=b;}mint operator/(long long a, mint b){return mint(a)/=b;}inline void rd(long long &x){int k;int m=0;x=0;for(;;){k = getchar_unlocked();if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){x=k-'0';break;}}for(;;){k = getchar_unlocked();if(k<'0'||k>'9'){break;}x=x*10+k-'0';}if(m){x=-x;}}inline void wt_L(char a){putchar_unlocked(a);}inline void wt_L(int x){int s=0;int m=0;char f[10];if(x<0){m=1;x=-x;}while(x){f[s++]=x%10;x/=10;}if(!s){f[s++]=0;}if(m){putchar_unlocked('-');}while(s--){putchar_unlocked(f[s]+'0');}}inline void wt_L(mint x){int i;i = (int)x;wt_L(i);}mint p(long long n){mint m=n/6;int k=n%6;if(k==0){return 3*m*m+m;}if(k==1){return 3*m*m+2*m;}if(k==2){return 3*m*m+3*m+1;}if(k==3){return 3*m*m+4*m+1;}if(k==4){return 3*m*m+5*m+2;}if(k==5){return 3*m*m+6*m+3;}return -1;}int main(){{mint x;x.setmod(MD);}long long N;mint res;rd(N);res = p(N-2);wt_L(res);wt_L('\n');return 0;}// cLay varsion 20191006-1// --- original code ---// mint p(long long n){// mint m=n/6; int k=n%6;// if(k==0) return 3*m*m+m;// if(k==1) return 3*m*m+2*m;// if(k==2) return 3*m*m+3*m+1;// if(k==3) return 3*m*m+4*m+1;// if(k==4) return 3*m*m+5*m+2;// if(k==5) return 3*m*m+6*m+3;// return -1;// }//// {// ll N; mint res;// rd(N);// res = p(N-2);// wt(res);// }