제출 #707720

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
707720		stevancv	Paths (BOI18_paths)	C++14	100 / 100	343 ms	97232 KiB

paths

#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
const int N = 3e5 + 5;
const int inf = 2e9;
const int mod = 1e9 + 7;
vector<int> g[N];
ll dp[N][32];
int a[N];
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n, m, k;
    cin >> n >> m >> k;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        a[i] -= 1;
        dp[i][1 << a[i]] = 1;
    }
    for (int i = 0; i < m; i++) {
        int u, v;
        cin >> u >> v;
        u -= 1; v -= 1;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    ll ans = 0;
    for (int mask = 0; mask < (1 << k); mask++) {
        for (int i = 0; i < n; i++) {
            if ((mask & (1 << a[i])) == 0) continue;
            for (int j : g[i]) {
                if ((mask & (1 << a[j])) == 0) continue;
                dp[i][mask] += dp[j][mask ^ (1 << a[i])];
            }
            ans += dp[i][mask];
        }
    }
    cout << ans - n << en;
    return 0;
}

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