제출 #741110

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
741110		AverageAmogusEnjoyer	Amusement Park (CEOI19_amusementpark)	C++17	0 / 100	1 ms	212 KiB

amusementpark

/*
ID: dalpone1
TASK: amusementpark
LANG: C++
*/
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end() 
#define pb push_back
#define ll long long
#define nl '\n'
const int N = 19, mod = 998244353;
int n, m;
ll dp[1 << N], compute[N];
vector<int> adj[N];
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> m;
	for (ll i = 1; i < N; i++) {
		compute[i] = (1 << (i-1)) * i;
	}
	for (int i = 0, s, e; i < m; i++) {
		cin >> s >> e;
		s--, e--;
		adj[s].pb(e);
		adj[e].pb(s);
	}
	int sz = 1 << n;
	for (int i = 0; i < sz; i++) {
		ll add = 0;
		for (int j = 0; j < n; j++) {
			if ((i & (1 << j)) == 0) continue;
			int count = 0;
			for (int k: adj[j])
				if ((1 << k) & i) 
					count++;
			add += compute[count];
			dp[i] = ((dp[i] % mod) + (dp[i ^ (1 << j)] % mod)) % mod;
		}
		add /= 2;
		dp[i] = ((dp[i] % mod) + (add % mod)) % mod;
	}
	cout << dp[sz-1];
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 12
• Subtask 3: 0 / 23
• Subtask 4: 0 / 21
• Subtask 5: 0 / 37