Submission #930397

#	Time	Username	Problem	Language	Result	Execution time	Memory
930397		vjudge1	Paths (BOI18_paths)	C++17	100 / 100	533 ms	133228 KiB

paths

#pragma GCC optimize("O3", "unroll-loops") // "Ofast" 	
#pragma GCC target("avx2", "bmi", "bmi2", "lzcnt", "popcnt") 

#include <bits/stdc++.h>

#define int long long
#define vt vector
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define f first
#define s second
#define dbg(x) cerr << #x << " = " << x << '\n'
#define bit(x, i) ((x) >> (i) & 1)

using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;

const int N = 1e6 + 5, mod = 10056;
const ll inf = 1e18;
const ld eps = 1e-6;

ll add (ll a, ll b) {
	a += b;
	if (a < 0) a += mod;
	if (a >= mod) a -= mod;
	return a;
}

ll mul (ll a, ll b) {
	a *= b;
	if (a >= mod) a %= mod;
	return a;
}

int n, m, k, a[N], dp[N][40];
vt<int> g[N];

void solve () {
	cin >> n >> m >> k;
	for (int i = 1; i <= n; i++) cin >> a[i], a[i]--, dp[i][1 << a[i]]++;
	for (int i = 1; i <= m; i++) {
		int x, y;
		cin >> x >> y;
		g[x].pb(y), g[y].pb(x);
	}
	int ans = 0;
	for (int mask = 0; mask < (1 << k); mask++) {
		for (int i = 1; i <= n; i++) {
			for (int j: g[i]) {
				if (bit(mask, a[j])) continue;
				int nmask = mask ^ (1 << a[j]);
				dp[j][nmask] += dp[i][mask];
			}
		}
	}
	for (int mask = 0; mask < (1 << k); mask++) {
		if (__builtin_popcountll(mask) < 2) continue;
		for (int i = 1; i <= n; i++) ans += dp[i][mask];
	}
	cout << ans;
	cout << '\n';
}

bool testcases = 0;

signed main() {
	cin.tie(0) -> sync_with_stdio(0);
	int test = 1;
	if (testcases) cin >> test;
	for (int cs = 1; cs <= test; cs++) {
		solve();
	}
}

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