Submission #1131525

#	Time	Username	Problem	Language	Result	Execution time	Memory
1131525		lopkus	Paths (BOI18_paths)	C++20	100 / 100	272 ms	57884 KiB

paths

#include <bits/stdc++.h>

#define int long long

using namespace std;

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n, m, k;
    cin >> n >> m >> k;
    vector<int> a(n + 1);
    for(int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    vector<int> adj[n + 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 dp[n + 1][1LL << k];
    for(int i = 0; i <= n; i++) {
        for(int j = 0; j < 1LL << k; j++) {
            dp[i][j] = 0;
        }
    }
    for(int i = 1; i <= n; i++) {
        a[i] -= 1;
        dp[i][1LL << a[i]] = 1;
    }
    for(int j = 0; j < (1LL << k); j++) {
        for(int i = 1; i <= n; i++) {
            if(j & (1LL << a[i])) {
                continue;
            }
            for(auto it : adj[i]) {
                if(!(j & (1LL << a[it]))) {
                    continue;
                }
                dp[i][j ^ (1LL << a[i])] += dp[it][j];
            }
        }
    }
    int ans = 0;
    for(int i = 1; i <= n; i++) {
        for(int j = 0; j < 1LL << k; j++) {
            ans += dp[i][j];
        }
    }
    cout << ans - n;
}

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