Submission #73367481

---

Source Code Expand

#include <bits/stdc++.h>

// #define EXTRA_LIBS 1
#ifdef EXTRA_LIBS
#include <atcoder/all>
#include <boost/multiprecision/cpp_int.hpp>
#endif

namespace {
#ifdef EXTRA_LIBS
    using ModInt [[maybe_unused]] = atcoder::modint998244353;
    using BigInt = boost::multiprecision::cpp_int;
    using BigIntVec = std::vector<BigInt>;
    using BigFloat [[maybe_unused]] = std::float128_t;
#endif
    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>>;

    const std::vector<std::pair<Num, Num>> dyxs {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
    std::map<char, std::pair<Num, Num>> directions {{'D', {1, 0}}, {'U', {-1, 0}}, {'R', {0, 1}}, {'L', {0, -1}}};

    template<typename T>
    void print_oneline(const std::vector<T>& vec, std::ostream& os) {
        const auto size = vec.size();
        for(size_t i{0}; i<size; ++i) {
            os << vec.at(i) << (((i+1) == size) ? '\n' : ' ');
        }
    }

    template<typename T>
    void print_each(const std::vector<T>& vec, std::ostream& os) {
        const auto size = vec.size();
        for(size_t i{0}; i<size; ++i) {
            os << vec.at(i) << '\n';
        }
    }
}

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

    Num ans {0};
    for(Num i{0}; i<n; ++i) {
        Num t;
        is >> t;
        const auto x = t - m;
        if (x <= 0) {
            continue;
        }

        ans += (x + d - 1) / d;
    }

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

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

Submission Info

Judge Result