#1026086 (C++23(gcc13)) No.1634 Sorting Integers (Multiple of K) Hard

提出ソース

結果

問題	No.1634 Sorting Integers (Multiple of K) Hard
ユーザー	横山緑
提出日時	2024-11-11 08:33:21
言語	C++23(gcc13) (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	769 ms / 3,000 ms
コード長	8,765 bytes
コンパイル時間	6,600 ms
コンパイル使用メモリ	291,484 KB
実行使用メモリ	5,248 KB
最終ジャッジ日時	2024-11-11 08:33:43
合計ジャッジ時間	21,577 ms
ジャッジサーバーID （参考情報）	judge1 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,248 KB
testcase_02	AC	2 ms 5,248 KB
testcase_03	AC	6 ms 5,248 KB
testcase_04	AC	2 ms 5,248 KB
testcase_05	AC	344 ms 5,248 KB
testcase_06	AC	346 ms 5,248 KB
testcase_07	AC	354 ms 5,248 KB
testcase_08	AC	472 ms 5,248 KB
testcase_09	AC	2 ms 5,248 KB
testcase_10	AC	2 ms 5,248 KB
testcase_11	AC	727 ms 5,248 KB
testcase_12	AC	661 ms 5,248 KB
testcase_13	AC	725 ms 5,248 KB
testcase_14	AC	718 ms 5,248 KB
testcase_15	AC	764 ms 5,248 KB
testcase_16	AC	743 ms 5,248 KB
testcase_17	AC	161 ms 5,248 KB
testcase_18	AC	211 ms 5,248 KB
testcase_19	AC	317 ms 5,248 KB
testcase_20	AC	229 ms 5,248 KB
testcase_21	AC	30 ms 5,248 KB
testcase_22	AC	464 ms 5,248 KB
testcase_23	AC	564 ms 5,248 KB
testcase_24	AC	651 ms 5,248 KB
testcase_25	AC	691 ms 5,248 KB
testcase_26	AC	769 ms 5,248 KB
testcase_27	AC	758 ms 5,248 KB
testcase_28	AC	742 ms 5,248 KB
testcase_29	AC	766 ms 5,248 KB
testcase_30	AC	738 ms 5,248 KB
testcase_31	AC	760 ms 5,248 KB

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

ソースコード

raw source code

#line 1 "test/yukicoder/1634.test.cpp"
#define PROBLEM "https://yukicoder.me/problems/no/1634"
#line 2 "template.hpp"
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>
using namespace std;
// https://xn--kst.jp/blog/2019/08/29/cpp-comp/
// debug methods
// usage: debug(x,y);
// vector 出力できるように修正
template <typename T>
ostream& debug_print(ostream& os, const vector<T>& v) {
    os << "[";
    for (size_t i = 0; i < v.size(); ++i) {
        os << v[i];
        if (i < v.size() - 1) os << ", ";
    }
    os << "]";
    return os;
}
template <typename T>
ostream& debug_print(ostream& os, const T& var) {
    os << var;
    return os;
}
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define debug_1(x1) { cout << #x1 << ": "; debug_print(cout, x1) << endl; }
#define debug_2(x1, x2) { cout << #x1 << ": "; debug_print(cout, x1) << ", " << #x2 << ": "; debug_print(cout, x2) << endl; }
#define debug_3(x1, x2, x3) { cout << #x1 << ": "; debug_print(cout, x1) << ", " << #x2 << ": "; debug_print(cout, x2) << ", " << #x3 << ": "; debug_print(cout, x3) << endl; }
#define debug_4(x1, x2, x3, x4) { cout << #x1 << ": "; debug_print(cout, x1) << ", " << #x2 << ": "; debug_print(cout, x2) << ", " << #x3 << ": "; debug_print(cout, x3) << ", " << #x4 << ": "; debug_print(cout, x4) << endl; }
#define debug_5(x1, x2, x3, x4, x5) { cout << #x1 << ": "; debug_print(cout, x1) << ", " << #x2 << ": "; debug_print(cout, x2) << ", " << #x3 << ": "; debug_print(cout, x3) << ", " << #x4 << ": "; debug_print(cout, x4) << ", " << #x5 << ": "; debug_print(cout, x5) << endl; }

#ifdef LOCAL
#define debug(...) CHOOSE((__VA_ARGS__, debug_5, debug_4, debug_3, debug_2, debug_1, ~))(__VA_ARGS__)
#else
#define debug(...)
#endif

using ll = long long;
using vl = vector<ll>;
using Graph = vector<vector<ll>>;
using P = pair<ll, ll>;
#define all(v) v.begin(), v.end()
template <typename T> inline bool chmax(T &a, T b) {
    return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
    return ((a > b) ? (a = b, true) : (false));
}
#define rep1(i, n) for(ll i = 1; i <= ((ll)n); ++i)
// https://trap.jp/post/1224/
template <class... T> constexpr auto min(T... a) {
    return min(initializer_list<common_type_t<T...>>{a...});
}
template <class... T> constexpr auto max(T... a) {
    return max(initializer_list<common_type_t<T...>>{a...});
}
template <class... T> void input(T &...a) { (cin >> ... >> a); }
template <class T> void input(vector<T> &a) {
    for(T &x : a)
        cin >> x;
}
void print() { cout << '\n'; }
template <class T, class... Ts> void print(const T &a, const Ts &...b) {
    cout << a;
    (cout << ... << (cout << ' ', b));
    cout << '\n';
}
template <class Container, typename = void>
struct is_container : std::false_type {};
template <class Container>
struct is_container<Container, std::void_t<decltype(std::declval<Container>().begin()), decltype(std::declval<Container>().end())>> : std::true_type {};
template <class Container>
typename enable_if<is_container<Container>::value>::type print(const Container& x) {
    if (!x.empty()) {
        auto it = x.begin();
        for (; it != prev(x.end()); ++it) {
            cout << *it << " ";
        }
        cout << *it << "\n";  // 最後の要素を出力して改行
    }
}
#define INT(...)                                                               \
    int __VA_ARGS__;                                                           \
    input(__VA_ARGS__)
#define LL(...)                                                                \
    long long __VA_ARGS__;                                                     \
    input(__VA_ARGS__)
#define STR(...)                                                               \
    string __VA_ARGS__;                                                        \
    input(__VA_ARGS__)
#define REP1(a) for(ll i = 0; i < a; i++)
#define REP2(i, a) for(ll i = 0; i < a; i++)
#define REP3(i, a, b) for(ll i = a; i < b; i++)
#define REP4(i, a, b, c) for(ll i = a; i < b; i += c)
#define overload4(a, b, c, d, e, ...) e
#define rep(...) overload4(__VA_ARGS__, REP4, REP3, REP2, REP1)(__VA_ARGS__)

ll inf = 3e18;
vl dx = {1, -1, 0, 0};
vl dy = {0, 0, 1, -1};
#line 3 "data_structure/hash-map-variable-length.hpp"
template <class Val> struct HashMap {
    int sz, mask, cnt;
    vector<bool> used;
    vector<ll> keys;
    vector<Val> vals;
    HashMap(int n = 1) {
        sz = 1;
        while(sz < 2 * n) {
            sz <<= 1;
        }
        mask = sz - 1;
        cnt = 0;
        keys.resize(sz);
        vals.resize(sz);
        used.resize(sz);
    }

    Val &operator[](const ll &key) {
        if(cnt * 2 > sz) {
            reallocate();
        }
        ll i = index(key);
        if(!used[i]) {
            used[i] = true;
            keys[i] = key;
            cnt++;
        }
        return vals[i];
    }
    bool contains(const ll &key) {
        ll i = index(key);
        return used[i];
    }
    vector<pair<ll, Val>> enumerate() {
        vector<pair<ll, Val>> res;
        rep(i, sz) {
            if(used[i]) {
                res.push_back({keys[i], vals[i]});
            }
        }
        return res;
    }
  private:
    int hash(ll x) {
        // https://judge.yosupo.jp/submission/186759
        static const ll r =
            std::chrono::steady_clock::now().time_since_epoch().count();
        x += r;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return (x ^ (x >> 31)) & mask;
    }
    int index(const ll &key) {
        ll i = hash(key);
        while(used[i] and keys[i] != key) {
            i = (i + 1) & mask;
        }
        return i;
    }
    void reallocate() {
        ll old_sz = sz;
        sz <<= 1;
        mask = sz - 1;
        cnt = 0;

        vector<ll> old_keys;
        vector<Val> old_vals;
        vector<bool> old_used;
        keys.swap(old_keys);
        vals.swap(old_vals);
        used.swap(old_used);
        keys.resize(sz);
        vals.resize(sz);
        used.resize(sz);

        rep(i, old_sz) {
            if(old_used[i]) {
                ll key = old_keys[i];
                Val val = old_vals[i];
                (*this)[key] = val;
            }
        }
        return;
    }
};
#line 3 "test/yukicoder/1634.test.cpp"
void solve() {
    LL(n, k);
    vl a;
    vl c(10);
    rep1(i, 9) {
        cin >> c[i];
        // rep(_, c) { a.push_back(i); }
    }
    ll half = n / 2;
    vector<bool> b(n, true);
    rep(i, half) b[i] = false;
    ll ans = 0;
    auto make_map = [&k](vl x, const ll base = 1) {
        HashMap<ll> mp;
        do {
            ll now = 0;
            for(auto i : x) {
                now = 10 * now + i * base;
                now %= k;
            }
            mp[now]++;
        } while(next_permutation(all(x)));
        return mp;
    };
    ll ten = [&] {
        ll res = 1;
        rep(i, half) res *= 10;
        return res % k;
    }();
    vl cnt = {0};
    auto cul = [&]() {
        debug(cnt);
        vl x, y;
        rep1(i, 9) {
            rep(j, cnt[i]) x.push_back(i);
            rep(j, c[i] - cnt[i]) y.push_back(i);
        }
        debug(x,y);
        auto mx = make_map(x, ten);
        auto my = make_map(y);
        for(auto [k,v]:my.enumerate()){
            debug(k,v);
        }
        for(auto [key, val] : mx.enumerate()) {
            debug(key, val, ten);
            ll rem = k - key;
            if(rem == k)
                rem -= k;
            ans += my[rem] * val;
        }
        debug(ans);
    };
    auto dfs = [&](auto &self, int sum) {
        if(ssize(cnt) == 10) {
            if(sum == n - half) {
                cul();
            }
            return;
        }
        ll num = ssize(cnt);
        rep(i, c[num] + 1) {
            if(sum + i > n)
                break;
            cnt.push_back(i);
            self(self, sum + i);
            cnt.pop_back();
        }
    };
    dfs(dfs, 0);
    print(ans);
    return;
    do {
        vl x, y;
        rep(i, n) {
            if(b[i]) {
                x.push_back(a[i]);
            } else
                y.push_back(a[i]);
        }
        auto mx = make_map(x, ten);
        auto my = make_map(y);
        debug(x);
        for(auto [key, val] : mx.enumerate()) {
            debug(key, val, ten);
            ll rem = k - key;
            if(rem == k)
                rem -= k;
            ans += my[rem] * key;
        }
    } while(next_permutation(all(b)));
    print(ans);
}
int main() {
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    ll t = 1;
    rep(_, t) solve();
}