Submission #797916

#	Time	Username	Problem	Language	Result	Execution time	Memory
797916		sentheta	Paths (BOI18_paths)	C++17	100 / 100	318 ms	100388 KiB

paths

// author : sentheta aka vanwij
#ifdef VANWIJ
	#include"/home/user/code/bits/stdc++.h"
	#define DBG 1
#else
	#include"bits/stdc++.h"
	#define DBG 0
#endif
using namespace std;

#define Int long long
#define V vector
#define pii pair<int,int>
#define ff first
#define ss second

static mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

#define pow2(x) (1LL<<(x))
#define msb(x) (63-__builtin_clzll(x))
#define bitcnt(x) (__builtin_popcountll(x))

#define nl '\n'
#define _ << ' ' <<
#define all(x) (x).begin(), (x).end()
#define rep(i,a,b) for(int i = (int)(a); i < (int)(b); i++)

#define cerr if(DBG) cout
#define dbg(x) {cerr << "?" << #x << " : " << (x) << endl << flush;}

#define int long long
// const Int MOD = 1e9+7;
const Int MOD = 998244353;
Int bpow(Int a,Int b){
	Int ret = 1;
	for(;b; a=a*a%MOD,b/=2) if(b&1) ret = ret*a%MOD;
	return ret;
}
Int inv(Int a){return bpow(a,MOD-2);}

void solve(); int TC, ALLTC;
signed main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout << fixed << setprecision(7);
	// cin >> ALLTC; for(TC=1; TC<=ALLTC; TC++) solve(); return 0;
	solve();
}












const int N = 3e5+5;
const int K = 5;

int n, m, k;
int a[N];
V<int> adj[N];

int dp[N][1<<K];

void solve(){
	
	cin >> n >> m >> k;
	
	rep(x,1,n+1){
		cin >> a[x];
		a[x]--;
		
		dp[x][1<<a[x]] = 1;
	}
	
	rep(i,0,m){
		int u, v;
		cin >> u >> v;
		
		adj[u].push_back(v);
		adj[v].push_back(u);
	}
	
	int ans = 0;
	rep(msk,0,1<<k) if(bitcnt(msk)>=2){
		rep(x,1,n+1) if(msk&1<<a[x]){
			for(int y : adj[x]){
				dp[x][msk] += dp[y][msk^1<<a[x]];
			}
			
			ans += dp[x][msk];
		}
	}
	
	cout << ans << nl;	
	
	
}

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