#684824 (C++14) No.1634 Sorting Integers (Multiple of K) Hard

• 問題: No.1634 Sorting Integers (Multiple of K) Hard
• ユーザー: karinohito
• 提出日時: 2021-07-30 22:58:03
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 1,054 ms / 3,000 ms
• コード長: 1,990 bytes
• コンパイル時間: 2,337 ms
• コンパイル使用メモリ: 194,972 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-09-16 02:50:16
• 合計ジャッジ時間: 21,319 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

ファイルパターン	結果
sample	AC * 4
other	AC * 28

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
//#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
//using namespace atcoder;
using ll = long long;
#define all(A) A.begin(),A.end()
using vll = vector<ll>;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
using Graph = vector<vector<ll>>;
vector<vll> BOX;
//max C size 通りの全列挙
void next_combination(ll size, ll max, vll now_vector) {
    ll now_size = now_vector.size();
    if (now_size == size) {
        BOX.push_back(now_vector);
    }
    else {
        vll next = now_vector;
        if (now_size == 0) {
            for (ll i = 0; i < max; i++) {
                next.push_back(i);
                next_combination(size, max, next);
                next.pop_back();
            }
        }
        else {
            ll LAST = next[now_size - 1];
            for (ll i = LAST + 1; i < max; i++) {
                next.push_back(i);
                next_combination(size, max, next);
                next.pop_back();
            }
        }
    }
    return;
}
int main() {
    ll N, K;
    cin >> N >> K;
    vll C(9);
    vll D;
    vll per(15, 1);
    rep(i, 14) {
        per[i + 1] = per[i] * (i + 1);
    }
    ll PPP = 1;
    rep(i, 9) {
        cin >> C[i];
        PPP *= per[C[i]];
        rep(j, C[i])D.push_back(i + 1);
    }
    ll pp = 1;
    rep(i, N / 2) {
        pp *= 10;
    }
    next_combination(N / 2, N, {});
    ll an = 0;
    set<vll> Poo;
    rep(i, BOX.size()) {
        map<ll, ll> M1;
        map<ll, ll> M2;
        vll AUU = BOX[i];
        vll AU;
        set<ll> S;
        rep(k, AUU.size()) {
            S.insert(AUU[k]);
            AU.push_back(D[AUU[k]]);
        }
        if (Poo.count(AU))continue;
        Poo.insert(AU);
        vll BU;
        rep(k, N) {
            if (!S.count(k))BU.push_back(D[k]);
        }
        ll kk = 1;
        do {
            kk = 1;
            ll x = 0;
            rep(u, AU.size()) {
                x += AU[u] * kk;
                kk *= 10;
                kk %= K;
                x %= K;
            }
            M1[x]++;
        } while (next_permutation(all(AU)));
        ll pp = kk;
        do {
            kk = pp;
            ll x = 0;
            rep(u, BU.size()) {
                x += BU[u] * kk;
                kk *= 10;
                kk %= K;
                x %= K;
            }
            if (x == 0)x += K;
            M2[x]++;
        } while (next_permutation(all(BU)));
        for (auto w : M1) {
            if (M2.count(K - w.first)) {
                an += w.second * M2[K - w.first];
            }
        }
    }
    cout << an << endl;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX