Submission #522509

#	Time	Username	Problem	Language	Result	Execution time	Memory
522509		Leonardo_Paes	Paths (BOI18_paths)	C++17	23 / 100	83 ms	15348 KiB

paths

#include <bits/stdc++.h>
using namespace std;

const int maxn = 1e5+10, maxl = 1<<5 - 1;

int c[maxn];
vector<int> grafo[maxn];

int dp[maxn][maxl];

int solve(int u, int mask){
	if(dp[u][mask] != -1) return dp[u][mask];
	int tot = 1;
	for(int v : grafo[u]) if(!(mask&c[v])) tot += solve(v, mask^c[v]);
	return dp[u][mask] = tot;
}

int main(){
	ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
	int n, m, k;
	cin >> n >> m >> k;
	for(int i=1; i<=n; i++){
		cin >> c[i];
		c[i] = (1<<(c[i]-1));
	}
	for(int i=1; i<=m; i++){
		int u, v;
		cin >> u >> v;
		grafo[u].push_back(v);
		grafo[v].push_back(u);
	}
	long long ans = 0;
	memset(dp, -1, sizeof dp);
	for(int i=1; i<=n; i++) ans += solve(i, c[i]);
	cout << ans - n << "\n";
	return 0;
}

Compilation message (stderr)

paths.cpp:4:38: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
    4 | const int maxn = 1e5+10, maxl = 1<<5 - 1;
      |                                    ~~^~~

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