#568296 (C++17) No.1261 数字集め

提出ソース

結果

問題	No.1261 数字集め
ユーザー	haruki_K
提出日時	2020-10-17 03:10:25
言語	C++17 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	5,807 ms / 8,000 ms
コード長	8,148 bytes
コンパイル時間	4,857 ms
コンパイル使用メモリ	210,912 KB
実行使用メモリ	22,832 KB
最終ジャッジ日時	2023-09-28 10:59:00
合計ジャッジ時間	356,021 ms
ジャッジサーバーID （参考情報）	judge12 / judge14

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	5,807 ms 22,740 KB
testcase_01	AC	1,670 ms 9,896 KB
testcase_02	AC	3,245 ms 17,164 KB
testcase_03	AC	3,743 ms 17,192 KB
testcase_04	AC	2,285 ms 12,212 KB
testcase_05	AC	4,963 ms 21,896 KB
testcase_06	AC	2,737 ms 13,352 KB
testcase_07	AC	3,433 ms 17,780 KB
testcase_08	AC	2,106 ms 11,240 KB
testcase_09	AC	2,662 ms 14,016 KB
testcase_10	AC	94 ms 4,384 KB
testcase_11	AC	4,964 ms 21,772 KB
testcase_12	AC	4,592 ms 19,632 KB
testcase_13	AC	3,848 ms 18,060 KB
testcase_14	AC	331 ms 4,644 KB
testcase_15	AC	1,798 ms 10,348 KB
testcase_16	AC	4,076 ms 17,868 KB
testcase_17	AC	2,353 ms 15,060 KB
testcase_18	AC	1,913 ms 10,528 KB
testcase_19	AC	3,887 ms 17,192 KB
testcase_20	AC	446 ms 5,196 KB
testcase_21	AC	5,633 ms 22,832 KB
testcase_22	AC	5,631 ms 22,660 KB
testcase_23	AC	5,621 ms 22,516 KB
testcase_24	AC	5,638 ms 22,704 KB
testcase_25	AC	5,635 ms 22,760 KB
testcase_26	AC	5,648 ms 22,640 KB
testcase_27	AC	5,650 ms 22,784 KB
testcase_28	AC	5,629 ms 22,684 KB
testcase_29	AC	5,639 ms 22,640 KB
testcase_30	AC	5,639 ms 22,676 KB
testcase_31	AC	5,638 ms 22,668 KB
testcase_32	AC	5,636 ms 22,692 KB
testcase_33	AC	5,691 ms 22,620 KB
testcase_34	AC	5,621 ms 22,716 KB
testcase_35	AC	5,636 ms 22,692 KB
testcase_36	AC	5,648 ms 22,584 KB
testcase_37	AC	5,635 ms 22,604 KB
testcase_38	AC	5,637 ms 22,688 KB
testcase_39	AC	5,670 ms 22,716 KB
testcase_40	AC	5,632 ms 22,656 KB
testcase_41	AC	5,669 ms 22,656 KB
testcase_42	AC	5,645 ms 22,760 KB
testcase_43	AC	5,651 ms 22,524 KB
testcase_44	AC	4,696 ms 20,312 KB
testcase_45	AC	879 ms 7,024 KB
testcase_46	AC	2,467 ms 12,348 KB
testcase_47	AC	1,597 ms 9,636 KB
testcase_48	AC	3,870 ms 17,608 KB
testcase_49	AC	4,309 ms 20,036 KB
testcase_50	AC	4,146 ms 18,288 KB
testcase_51	AC	1,025 ms 7,564 KB
testcase_52	AC	62 ms 4,380 KB
testcase_53	AC	1,050 ms 7,476 KB
testcase_54	AC	1,178 ms 7,948 KB
testcase_55	AC	546 ms 5,456 KB
testcase_56	AC	707 ms 6,240 KB
testcase_57	AC	3,659 ms 16,708 KB
testcase_58	AC	945 ms 7,012 KB
testcase_59	AC	4,160 ms 20,488 KB
testcase_60	AC	1,206 ms 8,128 KB
testcase_61	AC	1,695 ms 9,868 KB
testcase_62	AC	4,290 ms 18,832 KB
testcase_63	AC	594 ms 6,080 KB
testcase_64	AC	5,358 ms 21,896 KB
testcase_65	AC	3,143 ms 15,508 KB
testcase_66	AC	2,718 ms 13,464 KB
testcase_67	AC	4,174 ms 19,208 KB
testcase_68	AC	2,588 ms 12,976 KB
testcase_69	AC	2,428 ms 12,648 KB
testcase_70	AC	1,721 ms 10,888 KB
testcase_71	AC	4,034 ms 18,164 KB
testcase_72	AC	1,261 ms 8,604 KB
testcase_73	AC	1,608 ms 9,512 KB
testcase_74	AC	685 ms 6,208 KB
testcase_75	AC	2,205 ms 12,140 KB
testcase_76	AC	3,425 ms 16,772 KB
testcase_77	AC	3,490 ms 19,216 KB
testcase_78	AC	11 ms 4,376 KB
testcase_79	AC	4,254 ms 19,772 KB
testcase_80	AC	52 ms 4,376 KB
testcase_81	AC	330 ms 4,788 KB
testcase_82	AC	3,407 ms 15,952 KB
testcase_83	AC	1,436 ms 8,920 KB
testcase_84	AC	5,668 ms 22,664 KB
testcase_85	AC	5,671 ms 22,612 KB
testcase_86	AC	5,662 ms 22,604 KB
testcase_87	AC	5,634 ms 22,636 KB
testcase_88	AC	5,647 ms 22,668 KB
testcase_89	AC	5,660 ms 22,596 KB
testcase_90	AC	5,644 ms 22,628 KB
testcase_91	AC	5,650 ms 22,648 KB
testcase_92	AC	5,653 ms 22,716 KB
testcase_93	AC	5,652 ms 22,600 KB

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

ソースコード

raw source code

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
#define double ld
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) begin(x), end(x)
#define allR(x) rbegin(x), rend(x)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
template <class Int> auto constexpr inf = numeric_limits<Int>::max()/2-1;
auto constexpr INF32 = inf<int32_t>;
auto constexpr INF64 = inf<int64_t>;
auto constexpr INF   = inf<int>;
#ifdef LOCAL
#include "debug.hpp"
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T,S> const& p) { return os << "(" << p.first << ", " << p.second << ")"; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint {
    template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); }
};
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) {
    using S = typename iterator_traits<It>::value_type;
    using T = conditional_t<is_signed_v<S>,i64,u64>;
    return accumulate(b,e,T{});
}
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) {
    return lower_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class T> int ubd(C const& v, T const& x) {
    return upper_bound(v.begin(), v.end(), x)-v.begin();
}
const int dx[] = { 1,0,-1,0 };
const int dy[] = { 0,1,0,-1 };
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
template <class Int> Int rand(Int a, Int b) { // [a,b]
    static mt19937_64 mt{random_device{}()};
    return uniform_int_distribution<Int>(a,b)(mt);
}
i64 irand(i64 a, i64 b) { return rand<i64>(a,b); }
u64 urand(u64 a, u64 b) { return rand<u64>(a,b); }
// <<<
// >>> modint
template <uint32_t md>
class modint {
    static_assert(md < (1u<<31), "");
    using M = modint;
    using i64 = int64_t;
    uint32_t x;
public:
    static constexpr uint32_t mod = md;
    constexpr modint(i64 x = 0) : x((x%=md) < 0 ? x+md : x) { }
    constexpr i64 val() const { return x; }
    constexpr explicit operator i64() const { return x; }
    constexpr bool operator==(M r) const { return x == r.x; }
    constexpr bool operator!=(M r) const { return x != r.x; }
    constexpr M operator+() const { return *this; }
    constexpr M operator-() const { return M()-*this; }
    constexpr M& operator+=(M r) { x += r.x; x = (x < md ? x : x-md); return *this; }
    constexpr M& operator-=(M r) { x += md-r.x; x = (x < md ? x : x-md); return *this; }
    constexpr M& operator*=(M r) { x = (uint64_t(x)*r.x)%md; return *this; }
    constexpr M& operator/=(M r) { return *this *= r.inv(); }
    constexpr M operator+(M r) const { return M(*this) += r; }
    constexpr M operator-(M r) const { return M(*this) -= r; }
    constexpr M operator*(M r) const { return M(*this) *= r; }
    constexpr M operator/(M r) const { return M(*this) /= r; }
    friend constexpr M operator+(i64 x, M y) { return M(x)+y; }
    friend constexpr M operator-(i64 x, M y) { return M(x)-y; }
    friend constexpr M operator*(i64 x, M y) { return M(x)*y; }
    friend constexpr M operator/(i64 x, M y) { return M(x)/y; }
    constexpr M inv() const { assert(x > 0); return pow(md-2); }
    constexpr M pow(i64 n) const {
        assert(not (x == 0 && n == 0));
        if (n < 0) return inv().pow(-n);
        M v = *this, r = 1;
        for (; n > 0; n >>= 1, v *= v) if (n&1) r *= v;
        return r;
    }
#ifdef LOCAL
    friend string to_s(M r) { return to_s(r.val(), mod); }
#endif
    friend ostream& operator<<(ostream& os, M r) { return os << r.val(); }
    friend istream& operator>>(istream& is, M &r) { i64 x; is >> x; r = x; return is; }
};
// <<<
//constexpr int64_t MOD = 998244353;
constexpr int64_t MOD = 1e9+7;
using mint = modint<MOD>;
mint sgn(int n) { return n%2 == 0 ? +1 : -1; }
// >>> mod table
template <uint32_t mod>
struct ModTable {
    vector<uint32_t> fact = {1,1}, finv = {1,1}, inv = {0,1};
    void calc(int n) {
        int old = fact.size();
        if (n < old) return;
        fact.resize(n+1);
        finv.resize(n+1);
        inv.resize(n+1);
        for (uint32_t i = old; i <= n; i++) {
            fact[i] = uint64_t(fact[i-1])*i % mod;
            inv[i] = mod - uint64_t(inv[mod%i])*(mod/i) % mod;
            finv[i] = uint64_t(finv[i-1])*inv[i] % mod;
        }
    }
};
ModTable<MOD> mod_tab;

modint<MOD> fact(int n) {
    assert(0 <= n);
    return mod_tab.calc(n), mod_tab.fact[n];
}
modint<MOD> finv(int n) {
    assert(0 <= n);
    return mod_tab.calc(n), mod_tab.finv[n];
}
modint<MOD> C(int n, int k) {
    if (n < 0 || k < 0 || n < k) return 0;
    return fact(n)*finv(k)*finv(n-k);
}
modint<MOD> P(int n, int k) {
    assert(k >= 0); assert(n >= k);
    return fact(n)*finv(n-k);
}
// <<<

int32_t main() {
    int n,m; cin >> n >> m;
    vector<int> a(n+1);
    rep (i,n-1) cin >> a[i+2];

    auto calc = [&](int i, int j) {
        mint x = a[i]-1, y = a[j]-1, z = a[n]-1;
        mint A = x.pow(m-1)*(y-z) + y.pow(m-1)*(z-x) + z.pow(m-1)*(x-y);
        mint B = (x-y)*(y-z)*(z-x);
        return -A/B;
    };

    vector<mint> b(n+1);
    mint ans = 0;
    rep1 (i,n) if (i > 1) {
        for (int j = 2*i; j < n; j += i) {
            dump(i,j,calc(i,j));
            b[j] += calc(i,j);
        }
    }
    vector<int> can(n+1);
    rep1 (j,n-1) if (n % j == 0) ans += b[j], can[j] = 1;
    cout << ans << "\n";
    dump(b);

    int q; cin >> q;
    rep (_,q) {
        int x,y; cin >> x >> y;
        if (y < n) {
            mint val = calc(x,y);
            b[y] += val;
            if (can[y]) ans += val;
        } else {
            ans += b[x];
            can[x] = 1;
        }
        cout << ans << "\n";
    }
}

yukicoder

結果

テストケース

ソースコード