Submission #984457

#	Time	Username	Problem	Language	Result	Execution time	Memory
984457		Ahmed57	Paths (BOI18_paths)	C++17	100 / 100	455 ms	100540 KiB

paths

#include <bits/stdc++.h>

using namespace std;
#define int long long
int n,m,k;
vector<int> adj[300001];
int dp[300001][(1<<5)],arr[300001];
int solve(int i,int mask){
    if(dp[i][mask]!=-1)return dp[i][mask];
    int c1 = 1;
    for(auto j:adj[i]){
        if(mask&(1<<arr[j]))continue;
        c1+=solve(j,mask^(1<<arr[j]));
    }return dp[i][mask] = c1;
}
signed main(){
    cin>>n>>m>>k;
    for(int i = 1;i<=n;i++){
        cin>>arr[i];
        arr[i]--;
    }
    for(int i = 1;i<=m;i++){
        int a,b;cin>>a>>b;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }
    long long all = 0;
    memset(dp,-1,sizeof dp);
    for(int i = 1;i<=n;i++)all+=solve(i,(1<<arr[i]));
    cout<<all-n<<endl;
}

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