結果
| 問題 |
No.534 フィボナッチフィボナッチ数
|
| コンテスト | |
| ユーザー |
 Tatsuno
|
| 提出日時 | 2017-06-29 15:47:47 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 2 ms / 2,000 ms |
| コード長 | 3,799 bytes |
| コンパイル時間 | 1,775 ms |
| コンパイル使用メモリ | 178,800 KB |
| 実行使用メモリ | 5,248 KB |
| 最終ジャッジ日時 | 2024-10-04 16:38:36 |
| 合計ジャッジ時間 | 2,981 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 42 |
コンパイルメッセージ
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/valarray:100,
from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/x86_64-pc-linux-gnu/bits/stdc++.h:95,
from main.cpp:8:
In static member function 'static void std::_Array_copy_ctor<_Tp, <anonymous> >::_S_do_it(const _Tp*, const _Tp*, _Tp*) [with _Tp = m32<2000000016>; bool <anonymous> = false]',
inlined from 'void std::__valarray_copy_construct(const _Tp*, const _Tp*, _Tp*) [with _Tp = m32<2000000016>]' at /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/valarray_array.h:163:57,
inlined from 'std::valarray<_Tp>::valarray(const std::valarray<_Tp>&) [with _Tp = m32<2000000016>]' at /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/valarray:648:37,
inlined from 'static void std::_Array_init_ctor<_Tp, <anonymous> >::_S_do_it(_Tp*, _Tp*, _Tp) [with _Tp = std::valarray<m32<2000000016> >; bool <anonymous> = false]' at /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/valarray_array.h:108:4,
inlined from 'void std::__valarray_fill_construct(_Tp*, _Tp*, _Tp) [with _Tp = valarray<m32<2000000016> >]' at /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/valarray_array.h:127:57,
inlined from 'void std::valarray<_Tp>::resize(std::size_t, _Tp) [with _Tp = std::valarray<m32<2000000016> >]' at /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/valarray:1044:37,
inlined from 'mat<T>::mat(i32, i32) [with T = m32<2000000016>]' at main.cpp:52:46:
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/valarray_array.h:143:11: warning: 'void* __builtin_memcpy(void*, const void*, long unsigned int)' writing 1 or more bytes into a region of size 0 overflows the destination [-Wstringop-overflow=]
143 | new(__o++) _Tp(*__b++);
| ^~~~~~~~~~~~~~~~~~~~~~
In function '_Tp* std::__valarray_get_storage(size_t) [with _Tp =
ソースコード
#ifdef _MSC_VER
# define _CRT_SECURE_NO_WARNINGS
# define _USE_MATH_DEFINES
# include <intrin.h>
# define __builtin_popcount __popcnt
#endif
#include <bits/stdc++.h>
using namespace std;
using i32 = int; using i64 = long long int; using f64 = double;
using u32 = unsigned int; using u64 = unsigned long long int; using str = string;
template <typename T> using vec = vector<T>; void in() { }
template <typename T, typename...TS> void in(T &&x, TS &&...xs) { cin >> x; in(move(xs)...); }
template <typename T> void out(T &&x) { cout << x << "\n"; }
template <typename T, typename...TS> void out(T &&x, TS &&...xs) { cout << x << " "; out(move(xs)...); }
#define indef(t, ...) t __VA_ARGS__; in(__VA_ARGS__)
#define get(t) []{ t x; cin >> x; return x; }()
#define times(n, i) for (i32 i = 0; i < (n); ++i)
#define range(a, b, i) for (i32 i = (a); i < (b); ++i)
#define upto(a, b, i) for (i32 i = (a); i <= (b); ++i)
#define downto(a, b, i) for (i32 i = (a); i >= (b); --i)
#define all(xs) (xs).begin(), (xs).end()
#define sortall(xs) sort(all(xs))
#define reverseall(xs) reverse(all(xs))
#define even(x) ((abs(x) & 1) == 0)
#define odd(x) ((abs(x) & 1) == 1)
#define bit(x, i) (((x) >> i) & 1)
#define append emplace_back
#define bisect_left lower_bound
#define bisect_right upper_bound
#define bound(a, x, b) (a <= x && x <= b)
const i64 MOD = 1000000007ll;
const f64 EPS = 1e-10;
template <i64 mod> struct m32 {
i64 raw;
m32() : raw(0) {}
m32(unsigned x) : raw(x % mod) {}
m32(signed x) { i32 t = x % mod; if (t < 0) t += mod; raw = t; }
m32(signed long long x) { i32 t = x % mod; if (t < 0) t += mod; raw = t; }
i32 value() const { return (i32)raw; }
m32 &operator+=(m32 that) { if ((raw += that.raw) >= mod) raw -= mod; return *this; }
m32 &operator-=(m32 that) { if ((raw += mod - that.raw) >= mod) raw -= mod; return *this; }
m32 &operator*=(m32 that) { raw = (u64)raw * that.raw % mod; return *this; }
m32 operator+(m32 that) const { return m32(*this) += that; }
m32 operator-(m32 that) const { return m32(*this) -= that; }
m32 operator*(m32 that) const { return m32(*this) *= that; }
};
template <typename T> struct mat {
i32 n, m; valarray<valarray<T>> v;
mat(i32 n, i32 m) : n(n), m(m) { v.resize(n); times(n, i) v[i].resize(m); }
mat(const mat<T> &src) : n(src.n), m(src.m), v(src.v) { }
valarray<T> &operator[](size_t i) { return v[i]; }
mat<T> &operator*=(const mat<T> &that) {
mat<T> res(n, that.m); if (m != that.n) throw domain_error(0);
times(n, i) { times(that.m, j) { res[i][j] = 0; times(m, k) res[i][j] += v[i][k] * that.v[k][j]; } }
return *this = res;
}
mat<T> &operator^=(i64 e) {
if (e < 0) throw domain_error(0);
if (e == 0 && n != m) throw domain_error(0);
if (e == 0) { times(n, i) { times(m, j) v[i][j] = i == j; } return *this; }
if (e == 1) return *this;
mat<T> res = ((*this) * (*this)) ^ (e / 2);
if (odd(e)) res *= *this;
return *this = res;
}
mat<T> operator*(const mat<T> &that) const { mat<T> res(*this); return res *= that; }
mat<T> operator^(i64 e) const { mat<T> res(*this); return res ^= e; }
};
i64 solve() {
indef(i64, n);
mat<m32<2*MOD+2>> mat1(2, 2); mat1.v = {
{1, 1},
{1, 0},
};
mat1 ^= n;
i64 m = mat1[1][0].raw;
mat<m32<MOD>> mat2(2, 2); mat2.v = {
{1, 1},
{1, 0},
};
mat2 ^= m;
return mat2[1][0].raw;
}
i32 main()
{
ios::sync_with_stdio(false);
#ifdef _MSC_VER
/**
ifstream fin("input.txt"); cin.rdbuf(fin.rdbuf()); assert(fin);
ofstream fout("output.txt"); cout.rdbuf(fout.rdbuf()); assert(fout);
/**/
#endif
cout << fixed << setprecision(9);
out(solve());
return 0;
}