#573762 (C++17) No.1276 3枚のカード

提出ソース

結果

問題	No.1276 3枚のカード
ユーザー	hitonanode
提出日時	2020-10-31 02:23:41
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	863 ms / 2,000 ms
コード長	9,533 bytes
コンパイル時間	2,397 ms
コンパイル使用メモリ	205,852 KB
実行使用メモリ	5,376 KB
最終ジャッジ日時	2024-07-22 04:21:23
合計ジャッジ時間	32,556 ms
ジャッジサーバーID （参考情報）	judge2 / judge5

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	3 ms 5,248 KB
testcase_01	AC	4 ms 5,376 KB
testcase_02	AC	3 ms 5,376 KB
testcase_03	AC	3 ms 5,376 KB
testcase_04	AC	3 ms 5,376 KB
testcase_05	AC	3 ms 5,376 KB
testcase_06	AC	3 ms 5,376 KB
testcase_07	AC	3 ms 5,376 KB
testcase_08	AC	3 ms 5,376 KB
testcase_09	AC	3 ms 5,376 KB
testcase_10	AC	770 ms 5,376 KB
testcase_11	AC	464 ms 5,376 KB
testcase_12	AC	549 ms 5,376 KB
testcase_13	AC	570 ms 5,376 KB
testcase_14	AC	112 ms 5,376 KB
testcase_15	AC	488 ms 5,376 KB
testcase_16	AC	821 ms 5,376 KB
testcase_17	AC	540 ms 5,376 KB
testcase_18	AC	446 ms 5,376 KB
testcase_19	AC	625 ms 5,376 KB
testcase_20	AC	433 ms 5,376 KB
testcase_21	AC	449 ms 5,376 KB
testcase_22	AC	824 ms 5,376 KB
testcase_23	AC	102 ms 5,376 KB
testcase_24	AC	596 ms 5,376 KB
testcase_25	AC	289 ms 5,376 KB
testcase_26	AC	691 ms 5,376 KB
testcase_27	AC	754 ms 5,376 KB
testcase_28	AC	745 ms 5,376 KB
testcase_29	AC	511 ms 5,376 KB
testcase_30	AC	171 ms 5,376 KB
testcase_31	AC	98 ms 5,376 KB
testcase_32	AC	304 ms 5,376 KB
testcase_33	AC	45 ms 5,376 KB
testcase_34	AC	236 ms 5,376 KB
testcase_35	AC	228 ms 5,376 KB
testcase_36	AC	34 ms 5,376 KB
testcase_37	AC	217 ms 5,376 KB
testcase_38	AC	163 ms 5,376 KB
testcase_39	AC	314 ms 5,376 KB
testcase_40	AC	805 ms 5,376 KB
testcase_41	AC	702 ms 5,376 KB
testcase_42	AC	740 ms 5,376 KB
testcase_43	AC	668 ms 5,376 KB
testcase_44	AC	858 ms 5,376 KB
testcase_45	AC	808 ms 5,376 KB
testcase_46	AC	803 ms 5,376 KB
testcase_47	AC	708 ms 5,376 KB
testcase_48	AC	690 ms 5,376 KB
testcase_49	AC	747 ms 5,376 KB
testcase_50	AC	793 ms 5,376 KB
testcase_51	AC	715 ms 5,376 KB
testcase_52	AC	646 ms 5,376 KB
testcase_53	AC	727 ms 5,376 KB
testcase_54	AC	791 ms 5,376 KB
testcase_55	AC	665 ms 5,376 KB
testcase_56	AC	656 ms 5,376 KB
testcase_57	AC	773 ms 5,376 KB
testcase_58	AC	805 ms 5,376 KB
testcase_59	AC	730 ms 5,376 KB
testcase_60	AC	863 ms 5,376 KB

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

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T, typename V>
void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }
template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }
template <typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template <typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template <typename T> vector<T> srtunq(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
#if __cplusplus >= 201703L
template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os; }
#endif
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T, typename TH> ostream &operator<<(ostream &os, const unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <typename TK, typename TV, typename TH> ostream &operator<<(ostream &os, const unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl
#else
#define dbg(x) {}
#endif
template <int mod>
struct ModInt
{
    using lint = long long;
    static int get_mod() { return mod; }
    static int get_primitive_root() {
        static int primitive_root = 0;
        if (!primitive_root) {
            primitive_root = [&](){
                std::set<int> fac;
                int v = mod - 1;
                for (lint i = 2; i * i <= v; i++) while (v % i == 0) fac.insert(i), v /= i;
                if (v > 1) fac.insert(v);
                for (int g = 1; g < mod; g++) {
                    bool ok = true;
                    for (auto i : fac) if (ModInt(g).power((mod - 1) / i) == 1) { ok = false; break; }
                    if (ok) return g;
                }
                return -1;
            }();
        }
        return primitive_root;
    }
    int val;
    constexpr ModInt() : val(0) {}
    constexpr ModInt &_setval(lint v) { val = (v >= mod ? v - mod : v); return *this; }
    constexpr ModInt(lint v) { _setval(v % mod + mod); }
    explicit operator bool() const { return val != 0; }
    constexpr ModInt operator+(const ModInt &x) const { return ModInt()._setval((lint)val + x.val); }
    constexpr ModInt operator-(const ModInt &x) const { return ModInt()._setval((lint)val - x.val + mod); }
    constexpr ModInt operator*(const ModInt &x) const { return ModInt()._setval((lint)val * x.val % mod); }
    constexpr ModInt operator/(const ModInt &x) const { return ModInt()._setval((lint)val * x.inv() % mod); }
    constexpr ModInt operator-() const { return ModInt()._setval(mod - val); }
    constexpr ModInt &operator+=(const ModInt &x) { return *this = *this + x; }
    constexpr ModInt &operator-=(const ModInt &x) { return *this = *this - x; }
    constexpr ModInt &operator*=(const ModInt &x) { return *this = *this * x; }
    constexpr ModInt &operator/=(const ModInt &x) { return *this = *this / x; }
    friend constexpr ModInt operator+(lint a, const ModInt &x) { return ModInt()._setval(a % mod + x.val); }
    friend constexpr ModInt operator-(lint a, const ModInt &x) { return ModInt()._setval(a % mod - x.val + mod); }
    friend constexpr ModInt operator*(lint a, const ModInt &x) { return ModInt()._setval(a % mod * x.val % mod); }
    friend constexpr ModInt operator/(lint a, const ModInt &x) { return ModInt()._setval(a % mod * x.inv() % mod); }
    constexpr bool operator==(const ModInt &x) const { return val == x.val; }
    constexpr bool operator!=(const ModInt &x) const { return val != x.val; }
    bool operator<(const ModInt &x) const { return val < x.val; }  // To use std::map<ModInt, T>
    friend std::istream &operator>>(std::istream &is, ModInt &x) { lint t; is >> t; x = ModInt(t); return is; }
    friend std::ostream &operator<<(std::ostream &os, const ModInt &x) { os << x.val;  return os; }
    constexpr lint power(lint n) const {
        lint ans = 1, tmp = this->val;
        while (n) {
            if (n & 1) ans = ans * tmp % mod;
            tmp = tmp * tmp % mod;
            n /= 2;
        }
        return ans;
    }
    constexpr lint inv() const { return this->power(mod - 2); }
    constexpr ModInt operator^(lint n) const { return ModInt(this->power(n)); }
    constexpr ModInt &operator^=(lint n) { return *this = *this ^ n; }

    inline ModInt fac() const {
        static std::vector<ModInt> facs;
        int l0 = facs.size();
        if (l0 > this->val) return facs[this->val];

        facs.resize(this->val + 1);
        for (int i = l0; i <= this->val; i++) facs[i] = (i == 0 ? ModInt(1) : facs[i - 1] * ModInt(i));
        return facs[this->val];
    }

    ModInt doublefac() const {
        lint k = (this->val + 1) / 2;
        if (this->val & 1) return ModInt(k * 2).fac() / ModInt(2).power(k) / ModInt(k).fac();
        else return ModInt(k).fac() * ModInt(2).power(k);
    }

    ModInt nCr(const ModInt &r) const {
        if (this->val < r.val) return ModInt(0);
        return this->fac() / ((*this - r).fac() * r.fac());
    }

    ModInt sqrt() const {
        if (val == 0) return 0;
        if (mod == 2) return val;
        if (power((mod - 1) / 2) != 1) return 0;
        ModInt b = 1;
        while (b.power((mod - 1) / 2) == 1) b += 1;
        int e = 0, m = mod - 1;
        while (m % 2 == 0) m >>= 1, e++;
        ModInt x = power((m - 1) / 2), y = (*this) * x * x;
        x *= (*this);
        ModInt z = b.power(m);
        while (y != 1) {
            int j = 0;
            ModInt t = y;
            while (t != 1) j++, t *= t;
            z = z.power(1LL << (e - j - 1));
            x *= z, z *= z, y *= z;
            e = j;
        }
        return ModInt(std::min(x.val, mod - x.val));
    }
};
constexpr int MOD = 1000000007;
using mint = ModInt<MOD>;


// (A, aA, abA)
mint solve3(lint N) {
    constexpr lint B = 50000;
    mint ret = 0;
    vector<mint> cnt2(B);
    for (int i = 1; i < B; i++) {
        for (int j = 1; i * j < B; j++) {
            cnt2[i * j] += 1;
        }
    }
    vector<mint> cnt2acc = cnt2;
    for (int i = 1; i < B; i++) {
        cnt2acc[i] += cnt2acc[i - 1];
    }

    for (int x = 2; x < B; x++) {
        if (x > N) break;
        int h = N / x;
        int lo = 1;
        while (lo < B) {
            int j = min<int>(h / lo, B - 1);
            if (!j) break;
            int hi = min<int>(B - 1, h / j);
            ret += mint(j) * (hi - lo + 1);
            lo = hi + 1;
        }
    }
    int lo = B;
    while (lo <= N) {
        int k = N / lo;
        int hi = N / k;
        ret += cnt2acc[k] * (hi - lo + 1);
        ret += (cnt2acc[k] - k) * (hi - lo + 1) * 2;
        lo = hi + 1;
    }
    return ret;
}


int main()
{
    int N;
    cin >> N;
    mint ret = 0;
    lint lo = 1;
    while (lo <= N) {
        lint u = N / lo;
        lint hi = N / u;
        ret += mint(u - 1) * (N - 1 - u + 2) * (hi - lo + 1);
        lo = hi + 1;
    }
    cout << ret - solve3(N) << '\n';
}

yukicoder

結果

テストケース

ソースコード