Submission #1347085

#TimeUsernameProblemLanguageResultExecution timeMemory
1347085WarinchaiPaths (BOI18_paths)C++20
100 / 100
151 ms95484 KiB
#include<bits/stdc++.h>
#define int long long
using namespace std;

int dp[2][35][300005];
int c[300005];
vector<int>adj[300005];

int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n,m,k;cin>>n>>m>>k;
    for(int i=1;i<=n;i++){
        cin>>c[i];
        c[i]--;
    }
    for(int i=0;i<m;i++){
        int a,b;cin>>a>>b;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }
    int cur=0;
    for(int i=1;i<=n;i++){
        dp[0][(1<<c[i])][i]=1;
    }
    int ans=0;
    for(int i=2;i<=k;i++){
        cur^=1;
        for(int j=0;j<(1<<k);j++)for(int l=1;l<=n;l++)dp[cur][j][l]=0;
        for(int j=0;j<(1<<k);j++){
            for(int l=1;l<=n;l++){
                if(dp[cur^1][j][l]==0)continue;
                for(auto x:adj[l]){
                    if((j&(1<<c[x]))==0){
                        dp[cur][j|(1<<c[x])][x]+=dp[cur^1][j][l];
                    }
                }
            }
        }
        for(int j=0;j<(1<<k);j++)for(int l=1;l<=n;l++){
            if(__builtin_popcount(j)==i){
                ans+=dp[cur][j][l];
            }
        }
    }
    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...