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

提出ソース

結果

問題	No.1261 数字集め
ユーザー	haruki_K
提出日時	2020-10-17 03:10:25
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	4,925 ms / 8,000 ms
コード長	8,148 bytes
コンパイル時間	3,397 ms
コンパイル使用メモリ	213,668 KB
実行使用メモリ	22,848 KB
最終ジャッジ日時	2024-07-21 05:41:28
合計ジャッジ時間	305,016 ms
ジャッジサーバーID （参考情報）	judge1 / judge3

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	4,880 ms 22,688 KB
testcase_01	AC	1,466 ms 9,992 KB
testcase_02	AC	2,870 ms 17,152 KB
testcase_03	AC	3,145 ms 17,508 KB
testcase_04	AC	2,010 ms 12,416 KB
testcase_05	AC	4,475 ms 22,016 KB
testcase_06	AC	2,275 ms 13,568 KB
testcase_07	AC	2,832 ms 18,016 KB
testcase_08	AC	1,790 ms 11,540 KB
testcase_09	AC	2,194 ms 13,952 KB
testcase_10	AC	97 ms 5,376 KB
testcase_11	AC	4,348 ms 21,760 KB
testcase_12	AC	3,973 ms 19,832 KB
testcase_13	AC	3,209 ms 18,208 KB
testcase_14	AC	293 ms 5,376 KB
testcase_15	AC	1,550 ms 10,408 KB
testcase_16	AC	3,646 ms 18,048 KB
testcase_17	AC	2,609 ms 15,224 KB
testcase_18	AC	1,851 ms 10,880 KB
testcase_19	AC	3,451 ms 17,536 KB
testcase_20	AC	419 ms 5,376 KB
testcase_21	AC	4,821 ms 22,712 KB
testcase_22	AC	4,886 ms 22,656 KB
testcase_23	AC	4,795 ms 22,720 KB
testcase_24	AC	4,767 ms 22,800 KB
testcase_25	AC	4,857 ms 22,784 KB
testcase_26	AC	4,789 ms 22,728 KB
testcase_27	AC	4,799 ms 22,772 KB
testcase_28	AC	4,925 ms 22,784 KB
testcase_29	AC	4,781 ms 22,656 KB
testcase_30	AC	4,807 ms 22,656 KB
testcase_31	AC	4,877 ms 22,756 KB
testcase_32	AC	4,800 ms 22,768 KB
testcase_33	AC	4,752 ms 22,748 KB
testcase_34	AC	4,906 ms 22,784 KB
testcase_35	AC	4,820 ms 22,848 KB
testcase_36	AC	4,746 ms 22,828 KB
testcase_37	AC	4,813 ms 22,784 KB
testcase_38	AC	4,676 ms 22,656 KB
testcase_39	AC	4,675 ms 22,784 KB
testcase_40	AC	4,825 ms 22,784 KB
testcase_41	AC	4,852 ms 22,784 KB
testcase_42	AC	4,824 ms 22,784 KB
testcase_43	AC	4,857 ms 22,724 KB
testcase_44	AC	4,032 ms 20,352 KB
testcase_45	AC	768 ms 7,040 KB
testcase_46	AC	2,057 ms 12,672 KB
testcase_47	AC	1,348 ms 9,856 KB
testcase_48	AC	3,284 ms 17,608 KB
testcase_49	AC	4,672 ms 20,352 KB
testcase_50	AC	3,482 ms 18,468 KB
testcase_51	AC	875 ms 7,552 KB
testcase_52	AC	57 ms 5,376 KB
testcase_53	AC	903 ms 7,552 KB
testcase_54	AC	1,007 ms 8,320 KB
testcase_55	AC	478 ms 5,632 KB
testcase_56	AC	607 ms 6,272 KB
testcase_57	AC	3,048 ms 16,980 KB
testcase_58	AC	792 ms 7,168 KB
testcase_59	AC	3,485 ms 20,736 KB
testcase_60	AC	1,003 ms 8,064 KB
testcase_61	AC	1,417 ms 9,984 KB
testcase_62	AC	3,567 ms 18,944 KB
testcase_63	AC	513 ms 6,016 KB
testcase_64	AC	4,482 ms 22,144 KB
testcase_65	AC	2,626 ms 15,744 KB
testcase_66	AC	2,292 ms 13,744 KB
testcase_67	AC	3,504 ms 19,088 KB
testcase_68	AC	2,179 ms 13,056 KB
testcase_69	AC	2,047 ms 12,800 KB
testcase_70	AC	1,432 ms 10,808 KB
testcase_71	AC	3,411 ms 18,276 KB
testcase_72	AC	1,066 ms 8,804 KB
testcase_73	AC	1,354 ms 9,728 KB
testcase_74	AC	604 ms 6,400 KB
testcase_75	AC	1,828 ms 12,416 KB
testcase_76	AC	2,848 ms 16,992 KB
testcase_77	AC	2,842 ms 19,252 KB
testcase_78	AC	9 ms 5,376 KB
testcase_79	AC	3,599 ms 19,840 KB
testcase_80	AC	45 ms 5,376 KB
testcase_81	AC	291 ms 5,376 KB
testcase_82	AC	2,858 ms 16,240 KB
testcase_83	AC	1,220 ms 9,088 KB
testcase_84	AC	4,777 ms 22,784 KB
testcase_85	AC	4,739 ms 22,656 KB
testcase_86	AC	4,851 ms 22,784 KB
testcase_87	AC	4,824 ms 22,656 KB
testcase_88	AC	4,773 ms 22,604 KB
testcase_89	AC	4,860 ms 22,732 KB
testcase_90	AC	4,921 ms 22,768 KB
testcase_91	AC	4,757 ms 22,840 KB
testcase_92	AC	4,910 ms 22,784 KB
testcase_93	AC	4,828 ms 22,784 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

結果

テストケース

ソースコード