제출 #1358698

#제출 시각아이디문제언어결과실행 시간메모리
1358698namhhPaths (BOI18_paths)C++20
100 / 100
152 ms96048 KiB
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define fi first
#define se second
const int N = 3e5+5;
int n,m,k,a[N],dp[N][1 << 5];
vector<int>adj[N];
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> m >> k;
    for(int i = 1; i <= n; i++){
    	cin >> a[i];
    	a[i]--;
    	dp[i][1 << a[i]] = 1;
	}
	for(int i = 1; i <= m; i++){
		int u,v;
		cin >> u >> v;
		adj[u].push_back(v);
		adj[v].push_back(u);
	}
	int ans = -n;
	for(int i = 1; i < (1 << k); i++){
		for(int j = 1; j <= n; j++){
			if(i & (1 << a[j])){
				for(int u: adj[j]) dp[j][i] += dp[u][i^(1 << a[j])];
				ans += dp[j][i];
			}
		}
	}
	cout << ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...