oj.uz

Submission #952054

# Submission time Handle Problem Language Result Execution time Memory
952054 2024-03-23T04:49:38 Z mocha Paths (BOI18_paths) C++14
100 / 100
 80 ms 42768 KB 
#include <bits/stdc++.h>
#define int long long
#define ff first
#define ss second
using namespace std;
const int mx = 3e5+5;

int n, m, k;
int cnt[1<<5][mx];
int tmp[1<<5][mx];
int c[mx];
vector<pair<int, int>> e;
int ans1, ans2, ans3, ans4, ans5;
vector<int> nums[6];
int ans;

void print(int x) {
	while (x) {
		cout << (x&1);
		x>>=1;
	}
	cout << "\n";
}

void init() {
	for (int i=0;i<1<<k;i++) {
		int ii=i, cnt=0;
		while (ii) {
			cnt += (ii&1);
			ii >>= 1;
		}
		nums[cnt].push_back(i);
	}
}

void get1() {
	for (auto [u, v]:e) {
		cnt[c[v]][u]++;
		cnt[c[u]][v]++;
	}
	for (int i=1;i<=n;i++) {
		for (int j=1;j<1<<k;j<<=1) {	
			if (j == c[i]) continue;
			ans1 += cnt[j][i];
		}
	}
}

void get2() {
	for (int i=1;i<=n;i++) {
		for (int x = 1;x<1<<k;x<<=1) {
			if (x == c[i]) continue;
			for (int y = 1; y < 1<<k ; y<<=1) {
				if ( y == c[i] or x == y) continue;
				int tmp = cnt[x][i] * cnt[y][i];
				ans2 += cnt[x][i] * cnt[y][i];
			}
		}
	}
}

void get3() {
	for (auto [u, v]:e) {
		if (c[u] == c[v]) continue;
		for (int x = 1;x<1<<k;x<<=1) {
			if (x == c[u] or x == c[v]) continue;
			for (int y = 1; y < 1<<k ; y<<=1) {
				if (y == c[u] or y == c[v] or x == y) continue;
				ans3 += cnt[x][v] * cnt[y][u] * 2;
			}
		}
	}
}

void get4() {
	for (auto [u, v]:e) {	
		if (c[u] == c[v]) continue;
		for (int i=1;i<1<<k;i<<=1) {
			if (i != c[u] and i != c[v]) {
				cnt[i|c[u]][v] += cnt[i][u];
				cnt[i|c[v]][u] += cnt[i][v];
			}
		}
	}
	int mask = 1<<5;
	mask--;
	for (int i=1;i<=n;i++) {
		for (int j:nums[2]) {
			if (j & c[i]) continue;
			int inv = (~(j|c[i])) & mask;
			ans4 += cnt[j][i] * cnt[inv][i];
		}
	}
}


signed main() {
	cin.tie(0);ios::sync_with_stdio(0);

	cin >> n >> m >> k;
	e.resize(m);
	init();
	for (int i=1;i<=n;i++) {
		int x;
		cin >> x; x--;
		c[i] = 1<<x;
	}
	for (int i=0;i<m;i++) {
		cin >> e[i].ff >> e[i].ss;
	}
	if (k == 1) {
		ans = 0;
	} else if (k == 2) {
		get1();
		ans = ans1;
	} else if (k == 3) {
		get1(); get2();
		ans = ans1 + ans2;
	} else if (k == 4) {
		get1(); get2(); get3();
		ans = ans1 + ans2 + ans3;
	} else {
		get1(); get2(); get3(); get4();
		ans = ans1 + ans2 + ans3 + ans4;
	}
	cout << ans << "\n";
}

Compilation message

paths.cpp: In function 'void get1()':
paths.cpp:37:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   37 |  for (auto [u, v]:e) {
      |            ^
paths.cpp: In function 'void get2()':
paths.cpp:55:9: warning: unused variable 'tmp' [-Wunused-variable]
   55 |     int tmp = cnt[x][i] * cnt[y][i];
      |         ^~~
paths.cpp: In function 'void get3()':
paths.cpp:63:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   63 |  for (auto [u, v]:e) {
      |            ^
paths.cpp: In function 'void get4()':
paths.cpp:76:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   76 |  for (auto [u, v]:e) {
      |            ^

Subtask #1
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 1 ms 8540 KB Output is correct
8 Correct 1 ms 8540 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 11340 KB Output is correct
2 Correct 31 ms 11576 KB Output is correct
3 Correct 64 ms 21728 KB Output is correct
4 Correct 38 ms 13396 KB Output is correct
5 Correct 40 ms 7260 KB Output is correct
6 Correct 54 ms 17488 KB Output is correct
7 Correct 61 ms 21736 KB Output is correct
8 Correct 65 ms 21584 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 1 ms 8540 KB Output is correct
8 Correct 1 ms 8540 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 37 ms 11340 KB Output is correct
12 Correct 31 ms 11576 KB Output is correct
13 Correct 64 ms 21728 KB Output is correct
14 Correct 38 ms 13396 KB Output is correct
15 Correct 40 ms 7260 KB Output is correct
16 Correct 54 ms 17488 KB Output is correct
17 Correct 61 ms 21736 KB Output is correct
18 Correct 65 ms 21584 KB Output is correct
19 Correct 34 ms 11340 KB Output is correct
20 Correct 30 ms 11100 KB Output is correct
21 Correct 60 ms 21584 KB Output is correct
22 Correct 38 ms 13396 KB Output is correct
23 Correct 36 ms 7256 KB Output is correct
24 Correct 52 ms 17616 KB Output is correct
25 Correct 62 ms 21584 KB Output is correct
26 Correct 63 ms 21584 KB Output is correct
27 Correct 38 ms 13140 KB Output is correct
28 Correct 45 ms 13396 KB Output is correct
29 Correct 80 ms 25936 KB Output is correct
30 Correct 63 ms 19796 KB Output is correct
31 Correct 61 ms 19540 KB Output is correct
32 Correct 79 ms 25812 KB Output is correct
33 Correct 1 ms 8540 KB Output is correct
34 Correct 1 ms 8540 KB Output is correct
35 Correct 1 ms 6492 KB Output is correct
36 Correct 1 ms 4444 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 1 ms 8540 KB Output is correct
39 Correct 2 ms 8540 KB Output is correct
40 Correct 1 ms 8540 KB Output is correct
41 Correct 1 ms 4692 KB Output is correct
42 Correct 1 ms 6488 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 16732 KB Output is correct
2 Correct 24 ms 32776 KB Output is correct
3 Correct 11 ms 8792 KB Output is correct
4 Correct 20 ms 13648 KB Output is correct
5 Correct 21 ms 11612 KB Output is correct
6 Correct 42 ms 42524 KB Output is correct
7 Correct 15 ms 11244 KB Output is correct
8 Correct 26 ms 17748 KB Output is correct
9 Correct 25 ms 13820 KB Output is correct
10 Correct 24 ms 17744 KB Output is correct
11 Correct 30 ms 42108 KB Output is correct
12 Correct 33 ms 38236 KB Output is correct
13 Correct 34 ms 42268 KB Output is correct
14 Correct 38 ms 42624 KB Output is correct
15 Correct 38 ms 42768 KB Output is correct
16 Correct 1 ms 8540 KB Output is correct
17 Correct 1 ms 8540 KB Output is correct
18 Correct 1 ms 6520 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 0 ms 464 KB Output is correct
21 Correct 1 ms 8540 KB Output is correct
22 Correct 1 ms 8540 KB Output is correct
23 Correct 1 ms 8536 KB Output is correct
24 Correct 1 ms 4444 KB Output is correct
25 Correct 1 ms 6492 KB Output is correct