#638026 (C++17) No.1458 Segment Function

提出ソース

結果

問題	No.1458 Segment Function
ユーザー	r1933
提出日時	2021-03-31 23:40:09
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	13 ms / 2,000 ms
コード長	6,276 bytes
コンパイル時間	3,026 ms
コンパイル使用メモリ	224,832 KB
実行使用メモリ	5,248 KB
最終ジャッジ日時	2024-10-12 13:37:47
合計ジャッジ時間	4,394 ms
ジャッジサーバーID （参考情報）	judge2 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
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	6 ms 5,248 KB
testcase_09	AC	6 ms 5,248 KB
testcase_10	AC	6 ms 5,248 KB
testcase_11	AC	6 ms 5,248 KB
testcase_12	AC	6 ms 5,248 KB
testcase_13	AC	9 ms 5,248 KB
testcase_14	AC	9 ms 5,248 KB
testcase_15	AC	9 ms 5,248 KB
testcase_16	AC	10 ms 5,248 KB
testcase_17	AC	9 ms 5,248 KB
testcase_18	AC	13 ms 5,248 KB
testcase_19	AC	13 ms 5,248 KB
testcase_20	AC	13 ms 5,248 KB
testcase_21	AC	13 ms 5,248 KB
testcase_22	AC	13 ms 5,248 KB
testcase_23	AC	2 ms 5,248 KB
testcase_24	AC	6 ms 5,248 KB
testcase_25	AC	2 ms 5,248 KB
testcase_26	AC	11 ms 5,248 KB
testcase_27	AC	10 ms 5,248 KB
testcase_28	AC	2 ms 5,248 KB
testcase_29	AC	4 ms 5,248 KB
testcase_30	AC	3 ms 5,248 KB
testcase_31	AC	9 ms 5,248 KB
testcase_32	AC	6 ms 5,248 KB
testcase_33	AC	6 ms 5,248 KB
testcase_34	AC	6 ms 5,248 KB

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

コンパイルメッセージ

main.cpp: In lambda function:
main.cpp:206:5: warning: control reaches end of non-void function [-Wreturn-type]
  206 |     };
      |     ^

ソースコード

raw source code

#pragma GCC optimize("Ofast")
#include "bits/stdc++.h"

#pragma region
// Begin Header {{{
using namespace std;

#ifndef DEBUG
#define dump(...)
#endif

#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define rep(i, b, e) for (intmax_t i = (b), i##_limit = (e); i < i##_limit; ++i)
#define repc(i, b, e) for (intmax_t i = (b), i##_limit = (e); i <= i##_limit; ++i)
#define repr(i, b, e) for (intmax_t i = (b), i##_limit = (e); i >= i##_limit; --i)
#define var(Type, ...) Type __VA_ARGS__; input(__VA_ARGS__)

constexpr size_t    operator""_zu(unsigned long long value) { return value; };
constexpr intmax_t  operator""_jd(unsigned long long value) { return value; };
constexpr uintmax_t operator""_ju(unsigned long long value) { return value; };

constexpr int INF = 0x3f3f3f3f;
constexpr intmax_t LINF = 0x3f3f3f3f3f3f3f3f_jd;

using usize = size_t;
using imax = intmax_t;
using uimax = uintmax_t;
using ld = long double;

template <class T, class Compare = less<>>
using MaxHeap = priority_queue<T, vector<T>, Compare>;
template <class T, class Compare = greater<>>
using MinHeap = priority_queue<T, vector<T>, Compare>;

inline void input() {}
template <class Head, class... Tail>
inline void input(Head&& head, Tail&&... tail) {
    cin >> head;
    input(forward<Tail>(tail)...);
}

template <class Container, class Value = typename Container::value_type,
enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr>
inline istream& operator>>(istream &is, Container &vs) {
    for (auto &v: vs) is >> v;
    return is;
}

template <class T, class U>
inline istream& operator>>(istream &is, pair<T, U> &p) {
    is >> p.first >> p.second;
    return is;
}

inline void output() { cout << "\n"; }
template <class Head, class... Tail>
inline void output(Head&& head, Tail&&... tail) {
    cout << head;
    if (sizeof...(tail)) cout << " ";
    output(forward<Tail>(tail)...);
}

template <class Container, class Value = typename Container::value_type,
enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr>
inline ostream& operator<<(ostream &os, const Container &vs) {
    static constexpr const char *delim[] = {" ", ""};
    for (auto it = begin(vs); it != end(vs); ++it) {
        os << delim[it == begin(vs)] << *it;
    }
    return os;
}

template <class Iterator>
inline void join(const Iterator &Begin, const Iterator &End, const string &delim = "\n", const string &last = "\n") {
    for (auto it = Begin; it != End; ++it) {
        cout << ((it == Begin) ? "" : delim) << *it;
    }
    cout << last;
}

template <class T>
inline vector<T> makeVector(const T &init_value, size_t sz) {
    return vector<T>(sz, init_value);
}

template <class T, class... Args>
inline auto makeVector(const T &init_value, size_t sz, Args... args) {
    return vector<decltype(makeVector<T>(init_value, args...))>(sz, makeVector<T>(init_value, args...));
}

template <class Func>
class FixPoint : Func {
public:
    explicit constexpr FixPoint(Func&& f) noexcept : Func(forward<Func>(f)) {}

    template <class... Args>
    constexpr decltype(auto) operator()(Args&&... args) const {
        return Func::operator()(*this, std::forward<Args>(args)...);
    }
};

template <class Func>
static inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept {
    return FixPoint<Func>{forward<Func>(f)};
}

template <class Container>
struct reverse_t {
    Container &c;
    reverse_t(Container &c) : c(c) {}
    auto begin() { return c.rbegin(); }
    auto end() { return c.rend(); }
};

template <class Container>
auto reversed(Container &c) {
    return reverse_t<Container>(c);
}

template <class T>
inline bool chmax(T &a, const T &b) noexcept {
    return b > a && (a = b, true);
}

template <class T>
inline bool chmin(T &a, const T &b) noexcept {
    return b < a && (a = b, true);
}

template <class T>
inline T diff(const T &a, const T &b) noexcept {
    return a < b ? b - a : a - b;
}

void operator|=(vector<bool>::reference lhs, const bool rhs) {
    lhs = lhs | rhs;
}

void ioinit() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
    clog << fixed << setprecision(10);
}
// }}} End Header
#pragma endregion

// detectCycle {{{
template <class T, class Fn>
pair<intmax_t, intmax_t> detectCycle(const T& s, const Fn& fn) {
    T tortoise = s;
    T hare = s;
    do {
        tortoise = fn(tortoise);
        hare = fn(fn(hare));
    } while (tortoise != hare);

    tortoise = s;
    intmax_t mu = 0;
    while (tortoise != hare) {
        ++mu;
        tortoise = fn(tortoise);
        hare = fn(hare);
    }

    intmax_t lamda = 0;
    do {
        ++lamda;
        hare = fn(hare);
    } while (hare != tortoise);

    return {mu, lamda};
}
// }}}

int main() {
    ioinit();

    var(string, P, N);

    const auto f = [](intmax_t x) {
        if (x == 0) {
        } else if (x == 0) {
            return 6;
        } else if (x == 1) {
            return 2;
        } else if (x == 2) {
            return 5;
        } else if (x == 3) {
            return 5;
        } else if (x == 4) {
            return 4;
        } else if (x == 5) {
            return 5;
        } else if (x == 6) {
            return 6;
        } else if (x == 7) {
            return 4;
        } else if (x == 8) {
            return 7;
        } else {
            return 6;
        }
    };

    const auto F = [&](string x) {
        intmax_t ret = 0;
        if (x.front() == '-') {
            ret++;
            x.erase(x.begin());
        }
        for (const auto e: x) {
            ret += f(e - '0');
        }
        return to_string(ret);
    };

    const auto strmod = [](string n, intmax_t m) {
        intmax_t ret = 0;
        for (const auto e: n) {
            ret = (ret * 10) % m;
            ret = (ret + e - '0') % m;
        }
        return ret;
    };

    const auto [mu, lamda] = detectCycle(P, F);
    dump(mu, lamda);

    if (N.size() <= 18 && stoll(N) <= mu) {
        rep(_, 0, stoll(N)) P = F(P);
        output(P);
    } else {
        rep(_, 0, mu) P = F(P);
        intmax_t loop = (strmod(N, lamda) - mu % lamda + lamda) % lamda;
        rep(_, 0, loop) P = F(P);
        output(P);
    }
    return 0;
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード