oj.uz

Submission #520647

# Submission time Handle Problem Language Result Execution time Memory
520647 2022-01-30T14:53:53 Z Sohsoh84 Paths (BOI18_paths) C++17
100 / 100
 1033 ms 70960 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;

#define all(x)			(x).begin(),(x).end()
#define X			first
#define Y			second
#define sep			' '
#define endl			'\n'
#define debug(x)		cerr << #x << ": " <<  x << endl;

const ll MAXN = 1e6 + 10;

int n, m, k, C[MAXN];
ll dp[MAXN], ans = 0;
vector<int> adj[MAXN], vert[MAXN];

int main() {
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	cin >> n >> m >> k;
	for (int i = 1; i <= n; i++) {
		cin >> C[i];
		C[i]--;
		vert[C[i]].push_back(i);
	}

	for (int i = 0; i < m; i++) {
		int u, v;
		cin >> u >> v;
		adj[u].push_back(v);
		adj[v].push_back(u);
	}

	for (int mask = 0; mask < (1 << k); mask++) {
		if (__builtin_popcount(mask) < 2) continue;
		vector<int> vec;
		for (int i = 0; i < k; i++)
			if (mask & (1 << i))
				vec.push_back(i);

		int sz = __builtin_popcount(mask);
		do {
			memset(dp, 0, sizeof dp);
			for (int e : vert[vec.front()])
				dp[e] = 1;

			for (int i = 1; i < sz; i++) {
				int ind = vec[i];
				for (int v : vert[ind]) {
					for (int u : adj[v]) {
						if (C[u] == vec[i - 1]) {
							dp[v] += dp[u];
						}
					}
					
					if (i == sz - 1) ans += dp[v];
				}
			}
		} while (next_permutation(all(vec)));
	}

	cout << ans << endl;
	return 0;
}

Subtask #1
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 55100 KB Output is correct
2 Correct 51 ms 55104 KB Output is correct
3 Correct 30 ms 55104 KB Output is correct
4 Correct 25 ms 55116 KB Output is correct
5 Correct 22 ms 47288 KB Output is correct
6 Correct 44 ms 55080 KB Output is correct
7 Correct 51 ms 55104 KB Output is correct
8 Correct 58 ms 55104 KB Output is correct
9 Correct 44 ms 55100 KB Output is correct
10 Correct 29 ms 55116 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 61644 KB Output is correct
2 Correct 89 ms 61092 KB Output is correct
3 Correct 287 ms 70432 KB Output is correct
4 Correct 101 ms 63052 KB Output is correct
5 Correct 92 ms 55236 KB Output is correct
6 Correct 226 ms 67816 KB Output is correct
7 Correct 296 ms 70332 KB Output is correct
8 Correct 290 ms 70960 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 55100 KB Output is correct
2 Correct 51 ms 55104 KB Output is correct
3 Correct 30 ms 55104 KB Output is correct
4 Correct 25 ms 55116 KB Output is correct
5 Correct 22 ms 47288 KB Output is correct
6 Correct 44 ms 55080 KB Output is correct
7 Correct 51 ms 55104 KB Output is correct
8 Correct 58 ms 55104 KB Output is correct
9 Correct 44 ms 55100 KB Output is correct
10 Correct 29 ms 55116 KB Output is correct
11 Correct 104 ms 61644 KB Output is correct
12 Correct 89 ms 61092 KB Output is correct
13 Correct 287 ms 70432 KB Output is correct
14 Correct 101 ms 63052 KB Output is correct
15 Correct 92 ms 55236 KB Output is correct
16 Correct 226 ms 67816 KB Output is correct
17 Correct 296 ms 70332 KB Output is correct
18 Correct 290 ms 70960 KB Output is correct
19 Correct 102 ms 61620 KB Output is correct
20 Correct 91 ms 60864 KB Output is correct
21 Correct 292 ms 70336 KB Output is correct
22 Correct 107 ms 63080 KB Output is correct
23 Correct 101 ms 55180 KB Output is correct
24 Correct 212 ms 67888 KB Output is correct
25 Correct 280 ms 70228 KB Output is correct
26 Correct 294 ms 70904 KB Output is correct
27 Correct 174 ms 60868 KB Output is correct
28 Correct 241 ms 62428 KB Output is correct
29 Correct 690 ms 70216 KB Output is correct
30 Correct 497 ms 66168 KB Output is correct
31 Correct 434 ms 66216 KB Output is correct
32 Correct 727 ms 70268 KB Output is correct
33 Correct 59 ms 55116 KB Output is correct
34 Correct 58 ms 55116 KB Output is correct
35 Correct 32 ms 55088 KB Output is correct
36 Correct 32 ms 55096 KB Output is correct
37 Correct 22 ms 47284 KB Output is correct
38 Correct 53 ms 55100 KB Output is correct
39 Correct 54 ms 55116 KB Output is correct
40 Correct 66 ms 55116 KB Output is correct
41 Correct 51 ms 55116 KB Output is correct
42 Correct 29 ms 55088 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 192 ms 55096 KB Output is correct
2 Correct 356 ms 56952 KB Output is correct
3 Correct 51 ms 56908 KB Output is correct
4 Correct 121 ms 60020 KB Output is correct
5 Correct 81 ms 60796 KB Output is correct
6 Correct 1033 ms 60000 KB Output is correct
7 Correct 99 ms 56888 KB Output is correct
8 Correct 259 ms 60092 KB Output is correct
9 Correct 157 ms 60792 KB Output is correct
10 Correct 175 ms 60788 KB Output is correct
11 Correct 597 ms 58460 KB Output is correct
12 Correct 627 ms 59676 KB Output is correct
13 Correct 650 ms 58524 KB Output is correct
14 Correct 956 ms 60152 KB Output is correct
15 Correct 953 ms 60344 KB Output is correct
16 Correct 55 ms 55112 KB Output is correct
17 Correct 49 ms 55100 KB Output is correct
18 Correct 30 ms 55116 KB Output is correct
19 Correct 27 ms 55016 KB Output is correct
20 Correct 23 ms 47180 KB Output is correct
21 Correct 78 ms 55116 KB Output is correct
22 Correct 54 ms 55112 KB Output is correct
23 Correct 54 ms 55104 KB Output is correct
24 Correct 53 ms 55128 KB Output is correct
25 Correct 31 ms 55116 KB Output is correct