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

• 問題: No.1634 Sorting Integers (Multiple of K) Hard
• ユーザー: karinohito
• 提出日時: 2021-07-31 02:41:01
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 450 ms / 3,000 ms
• コード長: 1,755 bytes
• コンパイル時間: 2,326 ms
• コンパイル使用メモリ: 198,484 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-09-16 05:36:44
• 合計ジャッジ時間: 10,869 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,248 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	4 ms; 5,376 KB
testcase_04	AC	3 ms; 5,376 KB
testcase_05	AC	94 ms; 5,376 KB
testcase_06	AC	96 ms; 5,376 KB
testcase_07	AC	95 ms; 5,376 KB
testcase_08	AC	276 ms; 5,376 KB
testcase_09	AC	2 ms; 5,376 KB
testcase_10	AC	2 ms; 5,376 KB
testcase_11	AC	446 ms; 5,376 KB
testcase_12	AC	367 ms; 5,376 KB
testcase_13	AC	446 ms; 5,376 KB
testcase_14	AC	450 ms; 5,376 KB
testcase_15	AC	442 ms; 5,376 KB
testcase_16	AC	450 ms; 5,376 KB
testcase_17	AC	99 ms; 5,376 KB
testcase_18	AC	126 ms; 5,376 KB
testcase_19	AC	194 ms; 5,376 KB
testcase_20	AC	123 ms; 5,376 KB
testcase_21	AC	19 ms; 5,376 KB
testcase_22	AC	179 ms; 5,376 KB
testcase_23	AC	242 ms; 5,376 KB
testcase_24	AC	360 ms; 5,376 KB
testcase_25	AC	396 ms; 5,376 KB
testcase_26	AC	426 ms; 5,376 KB
testcase_27	AC	438 ms; 5,376 KB
testcase_28	AC	441 ms; 5,376 KB
testcase_29	AC	443 ms; 5,376 KB
testcase_30	AC	441 ms; 5,376 KB
testcase_31	AC	444 ms; 5,376 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<vector<int>> BOX;
//max C size 通りの全列挙
int k = 0;
vector<int> now_vector;
void next_combination(int size, int max, int k) {

	if (k == size) {
		BOX.push_back(now_vector);
	}
	else {
		
		if (k == 0) {
			for (int i = 0; i < max; i++) {
				now_vector[k] = i;
				k++;
				next_combination(size, max, k);
				k--;
			}
		}
		else {
			int LAST = now_vector[k - 1];
			for (int i = LAST + 1; i < max; i++) {
				now_vector[k] = i;
				k++;
				next_combination(size, max, k);
				k--;
			}
		}
	}
	return;
}



int main() {
	int N, K;
	cin >> N >> K;

	vector<int> C(9);
	vector<int> D;
	rep(i, 9) {
		cin >> C[i];
		rep(j, C[i])D.push_back(i + 1);
	}
	int n = N / 2;
	now_vector.assign(n, -1);
	next_combination(n, N, 0);
	ll an = 0;
	unordered_set<string> Poo;
	vll kkk(N, 1);
	rep(i, N - 1) {
		kkk[i + 1] = kkk[i] * 10;
		kkk[i + 1] %= K;
	}
	rep(i, BOX.size()) {

		string AU;
		unordered_set<int> S;
		rep(k, n) {
			S.insert(BOX[i][k]);
			AU.push_back(D[BOX[i][k]]);
		}
		if (Poo.count(AU))continue;
		Poo.insert(AU);
		string BU;
		rep(k, N) {
			if (!S.count(k))BU.push_back(D[k]);
		}
		ll x = 0;
		unordered_map<ll, ll> M1;
		do {
			x = 0;
			rep(u, n) {
				x += (AU[u]) * kkk[u];
			}
			x %= K;
			M1[x]++;
		} while (next_permutation(all(AU)));

		do {
			x = 0;
			rep(u, N - n) {
				x += (BU[u]) * kkk[u + N / 2];
			}
			x %= K;
			if (x == 0)x += K;
			an += M1[K - x];

		} while (next_permutation(all(BU)));


	}
	cout << an << endl;
}