#184652 (C++14) No.534 フィボナッチフィボナッチ数

提出ソース

結果

問題	No.534 フィボナッチフィボナッチ数
ユーザー	Tatsuno
提出日時	2017-06-29 15:47:47
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	3 ms / 2,000 ms
コード長	3,799 bytes
コンパイル時間	2,239 ms
コンパイル使用メモリ	175,288 KB
実行使用メモリ	6,948 KB
最終ジャッジ日時	2024-04-15 04:51:42
合計ジャッジ時間	3,547 ms
ジャッジサーバーID （参考情報）	judge3 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	2 ms 6,940 KB
testcase_02	AC	2 ms 6,940 KB
testcase_03	AC	2 ms 6,944 KB
testcase_04	AC	2 ms 6,944 KB
testcase_05	AC	2 ms 6,944 KB
testcase_06	AC	2 ms 6,944 KB
testcase_07	AC	2 ms 6,944 KB
testcase_08	AC	2 ms 6,944 KB
testcase_09	AC	2 ms 6,940 KB
testcase_10	AC	2 ms 6,940 KB
testcase_11	AC	2 ms 6,944 KB
testcase_12	AC	2 ms 6,944 KB
testcase_13	AC	2 ms 6,944 KB
testcase_14	AC	2 ms 6,940 KB
testcase_15	AC	2 ms 6,940 KB
testcase_16	AC	2 ms 6,940 KB
testcase_17	AC	2 ms 6,944 KB
testcase_18	AC	2 ms 6,940 KB
testcase_19	AC	2 ms 6,944 KB
testcase_20	AC	2 ms 6,940 KB
testcase_21	AC	2 ms 6,940 KB
testcase_22	AC	2 ms 6,940 KB
testcase_23	AC	2 ms 6,940 KB
testcase_24	AC	2 ms 6,944 KB
testcase_25	AC	2 ms 6,940 KB
testcase_26	AC	2 ms 6,944 KB
testcase_27	AC	2 ms 6,944 KB
testcase_28	AC	2 ms 6,940 KB
testcase_29	AC	2 ms 6,944 KB
testcase_30	AC	2 ms 6,944 KB
testcase_31	AC	2 ms 6,940 KB
testcase_32	AC	2 ms 6,940 KB
testcase_33	AC	2 ms 6,940 KB
testcase_34	AC	2 ms 6,944 KB
testcase_35	AC	2 ms 6,944 KB
testcase_36	AC	2 ms 6,944 KB
testcase_37	AC	2 ms 6,940 KB
testcase_38	AC	3 ms 6,940 KB
testcase_39	AC	2 ms 6,944 KB
testcase_40	AC	2 ms 6,944 KB
testcase_41	AC	2 ms 6,948 KB

権限があれば一括ダウンロードができます

コンパイルメッセージ

In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/valarray:102,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/x86_64-pc-linux-gnu/bits/stdc++.h:166,
                 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/13.2.0/include/c++/13/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/13.2.0/include/c++/13/valarray:650: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/13.2.0/include/c++/13/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/13.2.0/include/c++/13/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/13.2.0/include/c++/13/valarray:1048:37,
    inlined from 'mat<T>::mat(i32, i32) [with T = m32<2000000016>]' at main.cpp:52:46:
/home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/bits/valarray_array.h:143:11: warning: 'void* __builtin_memcpy(void*, const void*, long unsigned int)' writing between 8 and 18446744073709551615 bytes into a region of size 0 [-Wstringop-overflow=]
  143 |           new(__o++) _Tp(*__b++);
      |           ^~~~~~~~~~~~~~~~~~~~~~
In function '_Tp* std::__valarray_get_storage(size_t) [with _Tp = m32<2000000016>]',
    i

ソースコード

raw source code

#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;
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード