提出 #50159293

---

ソースコード 拡げる

#include <bits/stdc++.h>
#include <atcoder/modint>

namespace {
    using ModInt [[maybe_unused]] = atcoder::modint998244353;
    using Num [[maybe_unused]] = long long int;
    using Vec [[maybe_unused]] = std::vector<Num>;
    using Set [[maybe_unused]] = std::set<Num>;
    using Mset [[maybe_unused]] = std::multiset<Num>;
    using Edges [[maybe_unused]] = std::vector<std::vector<Num>>;

    template<typename T>
    using Q [[maybe_unused]] = std::queue<T>;

    template<typename T>
    using PQ [[maybe_unused]] = std::priority_queue<T, std::vector<T>, std::greater<T>>;
}

void solve(std::istream& is, std::ostream& os) {
    Num n {0};
    is >> n;

    Num ans {0};
    std::set<Num> ns;
    std::map<Num, Num> counts;
    ns.insert(n);
    counts[n] = 1;

    while(!ns.empty()) {
        const auto x = *ns.rbegin();
        ns.erase(x);

        if (x < 2) {
            continue;
        }

        const auto ct = counts[x];
        ans += x * ct;
        const auto l = x / 2;
        const auto u = (x + 1) / 2;

        counts[l] += ct;
        if (!ns.contains(l)) {
            ns.insert(l);
        }

        counts[u] += ct;
        if (!ns.contains(u)) {
            ns.insert(u);
        }
    }

    os << ans << "\n";
}

int main(void) {
    solve(std::cin, std::cout);
    return 0;
}

提出情報

ジャッジ結果