# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
343557 | parsabahrami | Paths (BOI18_paths) | C++17 | 451 ms | 56684 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
#define SZ(x) (int) x.size()
#define F first
#define S second
const int N = 3e5 + 10;
ll dp[40][N]; int n, m, k, C[N];
vector<int> adj[N];
int main() {
scanf("%d%d%d", &n, &m, &k);
for (int i = 1; i <= n; i++) scanf("%d", &C[i]), C[i]--;
for (int i = 1; i <= m; i++) {
int u, v; scanf("%d%d", &u, &v);
adj[u].push_back(v);
adj[v].push_back(u);
}
for (int i = 1; i <= n; i++) dp[1 << C[i]][i] = 1;
for (int i = 0; i < 1 << k; i++) {
for (int j = 1; j <= n; j++) {
if ((i & (1 << C[j])) == 0) continue;
for (int u : adj[j]) dp[i][j] += dp[i ^ (1 << C[j])][u];
}
}
ll res = 0;
for (int i = 1; i <= n; i++) for (int j = 0; j < 1 << k; j++) res += dp[j][i];
printf("%lld\n", res - n);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |