結果
問題 | No.2156 ぞい文字列 |
ユーザー | tails |
提出日時 | 2022-12-14 17:44:03 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 5,381 bytes |
コンパイル時間 | 2,252 ms |
コンパイル使用メモリ | 181,588 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-11-08 09:41:26 |
合計ジャッジ時間 | 2,982 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
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 | 2 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 |
testcase_15 | AC | 2 ms
5,248 KB |
testcase_16 | AC | 2 ms
5,248 KB |
testcase_17 | AC | 2 ms
5,248 KB |
testcase_18 | AC | 2 ms
5,248 KB |
testcase_19 | AC | 2 ms
5,248 KB |
ソースコード
#pragma GCC optimize("Ofast") #pragma GCC optimize("unroll-loops") #pragma GCC optimize("inline") #include<bits/stdc++.h> using namespace std; inline int my_getchar_unlocked(){ static char buf[1048576]; static int s = 1048576; static int e = 1048576; if(s == e && e == 1048576){ e = fread_unlocked(buf, 1, 1048576, stdin); s = 0; } if(s == e){ return EOF; } return buf[s++]; } inline void rd(long long &x){ int k; int m=0; x=0; for(;;){ k = my_getchar_unlocked(); if(k=='-'){ m=1; break; } if('0'<=k&&k<='9'){ x=k-'0'; break; } } for(;;){ k = my_getchar_unlocked(); if(k<'0'||k>'9'){ break; } x=x*10+k-'0'; } if(m){ x=-x; } } struct MY_WRITER{ char buf[1048576]; int s; int e; MY_WRITER(){ s = 0; e = 1048576; } ~MY_WRITER(){ if(s){ fwrite_unlocked(buf, 1, s, stdout); } } } ; MY_WRITER MY_WRITER_VAR; void my_putchar_unlocked(int a){ if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){ fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout); MY_WRITER_VAR.s = 0; } MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a; } template<class T> inline void wt_L(vector<T> x); template<class T> inline void wt_L(set<T> x); template<class T> inline void wt_L(multiset<T> x); template<class T1, class T2> inline void wt_L(pair<T1,T2> x); inline void wt_L(char a){ my_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){ my_putchar_unlocked('-'); } while(s--){ my_putchar_unlocked(f[s]+'0'); } } inline void wt_L(unsigned x){ int s=0; char f[10]; while(x){ f[s++]=x%10; x/=10; } if(!s){ f[s++]=0; } while(s--){ my_putchar_unlocked(f[s]+'0'); } } inline void wt_L(long long x){ int s=0; int m=0; char f[20]; if(x<0){ m=1; x=-x; } while(x){ f[s++]=x%10; x/=10; } if(!s){ f[s++]=0; } if(m){ my_putchar_unlocked('-'); } while(s--){ my_putchar_unlocked(f[s]+'0'); } } inline void wt_L(unsigned long long x){ int s=0; char f[21]; while(x){ f[s++]=x%10; x/=10; } if(!s){ f[s++]=0; } while(s--){ my_putchar_unlocked(f[s]+'0'); } } int WRITER_DOUBLE_DIGIT = 15; inline int writerDigit_double(){ return WRITER_DOUBLE_DIGIT; } inline void writerDigit_double(int d){ WRITER_DOUBLE_DIGIT = d; } inline void wt_L(double x){ const int d = WRITER_DOUBLE_DIGIT; int k; int r; double v; if(x!=x || (x==x+1 && x==2*x)){ my_putchar_unlocked('E'); my_putchar_unlocked('r'); my_putchar_unlocked('r'); return; } if(x < 0){ my_putchar_unlocked('-'); x = -x; } x += 0.5 * pow(0.1, d); r = 0; v = 1; while(x >= 10*v){ v *= 10; r++; } while(r >= 0){ r--; k = floor(x / v); if(k >= 10){ k = 9; } if(k <= -1){ k = 0; } x -= k * v; v *= 0.1; my_putchar_unlocked(k + '0'); } if(d > 0){ my_putchar_unlocked('.'); v = 1; for(r=(0);r<(d);r++){ v *= 0.1; k = floor(x / v); if(k >= 10){ k = 9; } if(k <= -1){ k = 0; } x -= k * v; my_putchar_unlocked(k + '0'); } } } inline void wt_L(const char c[]){ int i=0; for(i=0;c[i]!='\0';i++){ my_putchar_unlocked(c[i]); } } inline void wt_L(string &x){ int i=0; for(i=0;x[i]!='\0';i++){ my_putchar_unlocked(x[i]); } } int fibonacci_mod_L(unsigned long long n, int md){ #if 0 unsigned long long a=1; unsigned long long b=0; unsigned long long c=1; unsigned long long ma=1; unsigned long long mb=1; unsigned long long mc=0; unsigned long long ta; unsigned long long tb; unsigned long long tc; while(n){ if(n%2){ ta = a*ma + b*mb; tb = a*mb + b*mc; tc = b*mb + c*mc; a = ta % md; b = tb % md; c = tc % md; } ta = ma*ma + mb*mb; tb = ma*mb + mb*mc; tc = mb*mb + mc*mc; ma = ta % md; mb = tb % md; mc = tc % md; n/=2; } return b; #else unsigned long long a=1; unsigned long long b=0; unsigned long long ma=0; unsigned long long mb=1; unsigned long long ta; unsigned long long tb; while(n){ if(n%2){ ta = a*ma + b*mb; tb = a*mb + b*(ma+mb); a = ta % md; b = tb % md; } ta = ma*ma + mb*mb; tb = (ma*2 + mb)*mb; ma = ta % md; mb = tb % md; n/=2; } return b; #endif } int main(){ long long n; rd(n); wt_L(fibonacci_mod_L(n+1,998244353)-1); wt_L('\n'); return 0; } template<class T> inline void wt_L(vector<T> x){ int fg = 0; for(auto a : x){ if(fg){ my_putchar_unlocked(' '); } fg = 1; wt_L(a); } } template<class T> inline void wt_L(set<T> x){ int fg = 0; for(auto a : x){ if(fg){ my_putchar_unlocked(' '); } fg = 1; wt_L(a); } } template<class T> inline void wt_L(multiset<T> x){ int fg = 0; for(auto a : x){ if(fg){ my_putchar_unlocked(' '); } fg = 1; wt_L(a); } } template<class T1, class T2> inline void wt_L(pair<T1,T2> x){ wt_L(x.first); my_putchar_unlocked(' '); wt_L(x.second); } // cLay version 20220116-1 // --- original code --- // ll@n;wt(fib_mod(n+1,998244353)-1);