結果
問題 | No.1634 Sorting Integers (Multiple of K) Hard |
ユーザー | karinohito |
提出日時 | 2021-07-30 22:58:03 |
言語 | C++14 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 1,059 ms / 3,000 ms |
コード長 | 1,990 bytes |
コンパイル時間 | 2,116 ms |
コンパイル使用メモリ | 193,028 KB |
実行使用メモリ | 4,384 KB |
最終ジャッジ日時 | 2023-10-14 07:42:34 |
合計ジャッジ時間 | 21,766 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,348 KB |
testcase_01 | AC | 2 ms
4,348 KB |
testcase_02 | AC | 2 ms
4,352 KB |
testcase_03 | AC | 6 ms
4,348 KB |
testcase_04 | AC | 4 ms
4,352 KB |
testcase_05 | AC | 421 ms
4,352 KB |
testcase_06 | AC | 422 ms
4,352 KB |
testcase_07 | AC | 422 ms
4,348 KB |
testcase_08 | AC | 519 ms
4,348 KB |
testcase_09 | AC | 2 ms
4,348 KB |
testcase_10 | AC | 2 ms
4,348 KB |
testcase_11 | AC | 962 ms
4,352 KB |
testcase_12 | AC | 991 ms
4,348 KB |
testcase_13 | AC | 957 ms
4,380 KB |
testcase_14 | AC | 1,059 ms
4,352 KB |
testcase_15 | AC | 1,056 ms
4,348 KB |
testcase_16 | AC | 921 ms
4,352 KB |
testcase_17 | AC | 220 ms
4,352 KB |
testcase_18 | AC | 253 ms
4,352 KB |
testcase_19 | AC | 469 ms
4,348 KB |
testcase_20 | AC | 248 ms
4,348 KB |
testcase_21 | AC | 35 ms
4,352 KB |
testcase_22 | AC | 740 ms
4,348 KB |
testcase_23 | AC | 873 ms
4,348 KB |
testcase_24 | AC | 928 ms
4,348 KB |
testcase_25 | AC | 966 ms
4,352 KB |
testcase_26 | AC | 943 ms
4,352 KB |
testcase_27 | AC | 976 ms
4,352 KB |
testcase_28 | AC | 936 ms
4,352 KB |
testcase_29 | AC | 961 ms
4,384 KB |
testcase_30 | AC | 913 ms
4,352 KB |
testcase_31 | AC | 895 ms
4,352 KB |
ソースコード
//#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; }