제출 #864452

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
864452		maks007	Paths (BOI18_paths)	C++14	100 / 100	523 ms	73820 KiB

paths

#include "bits/stdc++.h"

using namespace std;

#define int long long

vector <int> color;
vector <vector <int>> g, dp;

signed main () {
	int n, m, k;
	cin >> n >> m >> k;
	color.resize(n);
	g.resize(n);
	dp.resize(n, vector <int> (1 << k, 0));
	for(int i = 0; i < n; i ++) {
		cin >> color[i];
		color[i] --;
	}
	for(int i = 0, u, v; i < m; i ++) {
		cin >> u >> v;
		u --, v --;
		g[u].push_back(v);
		g[v].push_back(u);
		if(color[u] == color[v]) continue;
		dp[v][(1 << color[u]) ^ (1 << color[v])] += 1;
		dp[u][(1 << color[u]) ^ (1 << color[v])] += 1;
	}
	for(int mask = 0; mask < (1 << k); mask ++) {
		for(int i = 0; i < n; i ++) {
			if(dp[i][mask] == 0 || (!(mask & (1 << color[i])))) continue;
			for(auto j : g[i]) {
				if(mask & (1 << color[j])) continue;
				dp[j][mask ^ (1 << color[j])] += dp[i][mask];
			}
		}
	}
	int ans = 0;
	for(int mask = 0; mask < (1 << k); mask ++) {
		for(int i = 0; i < n; i ++) {
			ans += dp[i][mask];
		}
	}
	cout << ans;
	return 0;
}

• Subtask 1: 23 / 23
• Subtask 2: 20 / 20
• Subtask 3: 27 / 27
• Subtask 4: 30 / 30