結果

問題 No.2507 Yet Another Subgraph Counting
ユーザー heno239heno239
提出日時 2023-10-13 22:04:49
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 780 ms / 2,000 ms
コード長 8,199 bytes
コンパイル時間 2,353 ms
コンパイル使用メモリ 163,088 KB
実行使用メモリ 18,088 KB
最終ジャッジ日時 2024-09-15 17:46:40
合計ジャッジ時間 8,378 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 22 ms
17,004 KB
testcase_01 AC 22 ms
17,008 KB
testcase_02 AC 22 ms
16,896 KB
testcase_03 AC 21 ms
17,024 KB
testcase_04 AC 22 ms
16,896 KB
testcase_05 AC 24 ms
17,132 KB
testcase_06 AC 22 ms
16,896 KB
testcase_07 AC 21 ms
16,896 KB
testcase_08 AC 22 ms
16,896 KB
testcase_09 AC 22 ms
16,896 KB
testcase_10 AC 22 ms
16,896 KB
testcase_11 AC 24 ms
17,024 KB
testcase_12 AC 23 ms
16,884 KB
testcase_13 AC 22 ms
16,896 KB
testcase_14 AC 25 ms
17,132 KB
testcase_15 AC 22 ms
16,996 KB
testcase_16 AC 22 ms
16,896 KB
testcase_17 AC 25 ms
17,024 KB
testcase_18 AC 23 ms
16,896 KB
testcase_19 AC 23 ms
17,152 KB
testcase_20 AC 23 ms
16,896 KB
testcase_21 AC 23 ms
17,004 KB
testcase_22 AC 23 ms
16,896 KB
testcase_23 AC 34 ms
17,132 KB
testcase_24 AC 24 ms
17,152 KB
testcase_25 AC 39 ms
17,204 KB
testcase_26 AC 133 ms
17,408 KB
testcase_27 AC 31 ms
17,024 KB
testcase_28 AC 48 ms
17,152 KB
testcase_29 AC 23 ms
16,896 KB
testcase_30 AC 150 ms
17,408 KB
testcase_31 AC 75 ms
18,088 KB
testcase_32 AC 76 ms
18,088 KB
testcase_33 AC 25 ms
17,024 KB
testcase_34 AC 23 ms
17,152 KB
testcase_35 AC 24 ms
17,132 KB
testcase_36 AC 23 ms
16,896 KB
testcase_37 AC 302 ms
17,964 KB
testcase_38 AC 760 ms
17,964 KB
testcase_39 AC 139 ms
17,956 KB
testcase_40 AC 455 ms
18,088 KB
testcase_41 AC 650 ms
18,088 KB
testcase_42 AC 780 ms
17,968 KB
testcase_43 AC 39 ms
17,408 KB
testcase_44 AC 75 ms
18,084 KB
testcase_45 AC 25 ms
17,132 KB
testcase_46 AC 24 ms
17,024 KB
testcase_47 AC 72 ms
17,956 KB
testcase_48 AC 22 ms
17,024 KB
testcase_49 AC 131 ms
18,088 KB
testcase_50 AC 23 ms
17,024 KB
testcase_51 AC 39 ms
17,408 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
//ll mod = 1;
constexpr ll mod = 998244353;
//constexpr ll mod = 1000000007;
const int mod17 = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;

using ld = double;
typedef pair<ld, ld> LDP;
const ld eps = 1e-10;
const ld pi = acosl(-1.0);

template<typename T>
void chmin(T& a, T b) {
	a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
	a = max(a, b);
}
template<typename T>
vector<T> vmerge(vector<T>& a, vector<T>& b) {
	vector<T> res;
	int ida = 0, idb = 0;
	while (ida < a.size() || idb < b.size()) {
		if (idb == b.size()) {
			res.push_back(a[ida]); ida++;
		}
		else if (ida == a.size()) {
			res.push_back(b[idb]); idb++;
		}
		else {
			if (a[ida] < b[idb]) {
				res.push_back(a[ida]); ida++;
			}
			else {
				res.push_back(b[idb]); idb++;
			}
		}
	}
	return res;
}
template<typename T>
void cinarray(vector<T>& v) {
	rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
	rep(i, v.size()) {
		if (i > 0)cout << " "; cout << v[i];
	}
	cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	//if (x == 0)return 0;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
//mod should be <2^31
struct modint {
	int n;
	modint() :n(0) { ; }
	modint(ll m) {
		if (m < 0 || mod <= m) {
			m %= mod; if (m < 0)m += mod;
		}
		n = m;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
bool operator<(modint a, modint b) { return a.n < b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= (int)mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	a = abs(a); b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}
template<typename T>
void addv(vector<T>& v, int loc, T val) {
	if (loc >= v.size())v.resize(loc + 1, 0);
	v[loc] += val;
}
/*const int mn = 2000005;
bool isp[mn];
vector<int> ps;
void init() {
	fill(isp + 2, isp + mn, true);
	for (int i = 2; i < mn; i++) {
		if (!isp[i])continue;
		ps.push_back(i);
		for (int j = 2 * i; j < mn; j += i) {
			isp[j] = false;
		}
	}
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	if (res == st.begin())return st.end();
	res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	return res;
}
using mP = pair<modint, modint>;
mP operator+(mP a, mP b) {
	return { a.first + b.first,a.second + b.second };
}
mP operator+=(mP& a, mP b) {
	a = a + b; return a;
}
mP operator-(mP a, mP b) {
	return { a.first - b.first,a.second - b.second };
}
mP operator-=(mP& a, mP b) {
	a = a - b; return a;
}
LP operator+(LP a, LP b) {
	return { a.first + b.first,a.second + b.second };
}
LP operator+=(LP& a, LP b) {
	a = a + b; return a;
}
LP operator-(LP a, LP b) {
	return { a.first - b.first,a.second - b.second };
}
LP operator-=(LP& a, LP b) {
	a = a - b; return a;
}

mt19937 mt(time(0));

const string drul = "DRUL";
string senw = "SENW";
//DRUL,or SENW
//int dx[4] = { 1,0,-1,0 };
//int dy[4] = { 0,1,0,-1 };

//------------------------------------

vector<vector<int>> ads[14];
void init() {
	for (int n = 0; n <= 13; n++) {
		ads[n].resize(1 << n);
		rep(i, (1 << n)-1) {
			int le = 0;
			rep(j, n) {
				if (i & (1 << j))continue;
				le = j; break;
			}
			int ri = (1 << n) - 1 - i;
			for (int b = ri;; b = ri & (b - 1)) {
				if (b & (1 << le))ads[n][i].push_back(b);
				if (b == 0)break;
			}
		}
	}
}
bool exi[13][13];
void solve() {
	int n, m; cin >> n >> m;
	vector<ll> dp(1 << n);
	dp[0] = 1;
	rep(i, m) {
		int a, b; cin >> a >> b; a--; b--;
		exi[a][b] = exi[b][a] = true;
	}
	vector<ll> prering(1 << n);
	rep(s, n) {
		vector<vector<ll>> dp(1 << n, vector<ll>(n));
		dp[(1 << s)][s] = 1;
		rep(i, (1 << n))rep(j, n) {
			if (!dp[i][j])continue;
			rep(k, n) {
				if (!exi[j][k])continue;
				if (k == s) {
					prering[i] += dp[i][j];
				}
				if (i & (1 << k))continue;
				dp[i | (1 << k)][k] += dp[i][j];
			}
		}
	}
	rep(i, (1 << n)) {
		int c = 0;
		rep(j, n)if (i & (1 << j))c++;
		if (c == 0) {

		}
		else if (c == 1) {
			prering[i] = 1;
		}
		else if (c == 2) {
			prering[i] = 0;
		}
		else {
			prering[i] /= 2 * c;
		}
	}
	for (int s = 1; s < (1 << n); s++) {
		int le = 0;
		rep(i, n)if(s& (1 << i)) {
			le = i; break;
		}
		for (int b = s;; b = s & (b - 1)) {
			if (b == 0)break;
			if (b & (1 << le)) {
				if (!prering[b])continue;
				vector<int> ids;
				vector<int> cs;
				int rs = s ^ b;
				rep(i, n)if (rs & (1 << i)) {
					ids.push_back(i);
					int c = 0;
					rep(j, n)if (b & (1 << j))if (exi[j][i])c++;
					cs.push_back(c);
				}
				int sz = ids.size();
				vector<ll> coef(1 << sz);
				rep(i, (1 << sz)) {
					int x = 0;
					rep(j, sz) {
						if (i & (1 << j)) {
							coef[i] += cs[j];
							x |= (1 << ids[j]);
						}
					}
					coef[i] *= dp[x];
				}
				vector<ll> subdp(1 << sz);
				subdp[0] = 1;
				rep(i, (1 << sz)) {
					//cout << "? " << sz << " " << i << "\n";
					for (int ad : ads[sz][i]) {
						subdp[i | ad] += subdp[i] * coef[ad];
					}
				}
				dp[s] += subdp.back() * prering[b];
				//cout << s << " " << b << " "; coutarray(subdp);
			}
		}
	}
	//coutarray(dp);
	vector<ll> lasdp(1 << n);
	lasdp[0] = 1;
	rep(i, (1 << n)) {
		for (int ad : ads[n][i]) {
			lasdp[i | ad] += lasdp[i] * dp[ad];
		}
	}
	cout << lasdp.back() << "\n";
}

void expr() {
	ll num[14] = {};
	num[0] = 1;
	ll sum = 0;
	for (int n = 1; n <= 13; n++) {
		for (int c = 1; c <= n; c++) {
			if (c == 2)continue;
			ll val = num[n - c];
			val *= comb(n - 1, c - 1);
			num[n] += val;
		}
		cout << n << " " << num[n] << "\n";
		sum += (ll)comb(13,n) * num[n];
	}
	cout << sum << "\n";
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed<<setprecision(10);
	//init_f();
	init();
	//init2();
	//while(true)
	//expr();
	//int t; cin >> t; rep(i, t)
		solve();
	return 0;
}
0