oj.uz

Submission #680004

# Submission time Handle Problem Language Result Execution time Memory
680004 2023-01-09T18:52:09 Z WonderfulWhale The Xana coup (BOI21_xanadu) C++17
100 / 100
 96 ms 27572 KB 
#include <bits/stdc++.h>
using namespace std;

#define int int64_t
#define pb push_back
#define st first
#define nd second
#define pii pair<int, int>
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()

vector<int> G[100009];
int dp[100009][2][2];
bool tab[100009];

void dfs(int x, int y) {
	if(y != 0 and sz(G[x])==1) {
		dp[x][tab[x]][0] = 0;
		dp[x][!tab[x]][0] = 1e9;
		dp[x][!tab[x]][1] = 1;
		dp[x][tab[x]][1] = 1e9;
		return;
	}
	for(int z:G[x]) if(z != y) dfs(z, x);
	for(int a=0;a<2;a++) {
		for(int b=0;b<2;b++) {
			dp[x][a][b] += b;
			priority_queue<int> q;
			for(int z:G[x]) {
				if(z != y) {
					dp[x][a][b] += dp[z][b][0];
					q.push(dp[z][b][0]-dp[z][b][1]);
				}
			}
			if(tab[x]!=a&&b==0||tab[x]==a&&b==1) {
				dp[x][a][b] -= q.top();
				q.pop();
			}
			while(sz(q)>1) {
				int val1, val2;
				val1 = q.top();
				q.pop();
				val2 = q.top();
				q.pop();
				if(val1+val2>0) {
					dp[x][a][b] -= val1+val2;
				} else {
					break;
				}
			}
		}
	}
}

int32_t main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	int n;
	cin >> n;
	for(int i=0;i<n-1;i++) {
		int a, b;
		cin >> a >> b;
		G[a].pb(b);
		G[b].pb(a);
	}
	for(int i=1;i<=n;i++) {
		cin >> tab[i];
	}
	dfs(1, 0);
	if(min(dp[1][0][0], dp[1][0][1])>n) {
		cout << "impossible\n";
		return 0;
	}
	cout << min(dp[1][0][0], dp[1][0][1]) << "\n";
}

Compilation message

xanadu.cpp: In function 'void dfs(int64_t, int64_t)':
xanadu.cpp:35:16: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   35 |    if(tab[x]!=a&&b==0||tab[x]==a&&b==1) {
      |       ~~~~~~~~~^~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2676 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2680 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2676 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2680 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 1 ms 2644 KB Output is correct
10 Correct 2 ms 2668 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2772 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 27432 KB Output is correct
2 Correct 64 ms 27072 KB Output is correct
3 Correct 66 ms 27572 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 27352 KB Output is correct
2 Correct 92 ms 27072 KB Output is correct
3 Correct 77 ms 27492 KB Output is correct
4 Correct 73 ms 10316 KB Output is correct
5 Correct 76 ms 11068 KB Output is correct
6 Correct 82 ms 11244 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 21 ms 5488 KB Output is correct
9 Correct 70 ms 10932 KB Output is correct
10 Correct 83 ms 11004 KB Output is correct
11 Correct 70 ms 11996 KB Output is correct
12 Correct 89 ms 12388 KB Output is correct
13 Correct 67 ms 10936 KB Output is correct
14 Correct 85 ms 11464 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2676 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2680 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 1 ms 2644 KB Output is correct
10 Correct 2 ms 2668 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2772 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 81 ms 27432 KB Output is correct
18 Correct 64 ms 27072 KB Output is correct
19 Correct 66 ms 27572 KB Output is correct
20 Correct 72 ms 27352 KB Output is correct
21 Correct 92 ms 27072 KB Output is correct
22 Correct 77 ms 27492 KB Output is correct
23 Correct 73 ms 10316 KB Output is correct
24 Correct 76 ms 11068 KB Output is correct
25 Correct 82 ms 11244 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 21 ms 5488 KB Output is correct
28 Correct 70 ms 10932 KB Output is correct
29 Correct 83 ms 11004 KB Output is correct
30 Correct 70 ms 11996 KB Output is correct
31 Correct 89 ms 12388 KB Output is correct
32 Correct 67 ms 10936 KB Output is correct
33 Correct 85 ms 11464 KB Output is correct
34 Correct 2 ms 2644 KB Output is correct
35 Correct 1 ms 2644 KB Output is correct
36 Correct 2 ms 2672 KB Output is correct
37 Correct 2 ms 2676 KB Output is correct
38 Correct 1 ms 2644 KB Output is correct
39 Correct 2 ms 2644 KB Output is correct
40 Correct 2 ms 2644 KB Output is correct
41 Correct 2 ms 2672 KB Output is correct
42 Correct 1 ms 2644 KB Output is correct
43 Correct 1 ms 2676 KB Output is correct
44 Correct 2 ms 2644 KB Output is correct
45 Correct 70 ms 27328 KB Output is correct
46 Correct 87 ms 27124 KB Output is correct
47 Correct 73 ms 27492 KB Output is correct
48 Correct 70 ms 10328 KB Output is correct
49 Correct 85 ms 10992 KB Output is correct
50 Correct 69 ms 11248 KB Output is correct
51 Correct 2 ms 2644 KB Output is correct
52 Correct 21 ms 5440 KB Output is correct
53 Correct 64 ms 10932 KB Output is correct
54 Correct 79 ms 11036 KB Output is correct
55 Correct 88 ms 12024 KB Output is correct
56 Correct 73 ms 12344 KB Output is correct
57 Correct 76 ms 10972 KB Output is correct
58 Correct 72 ms 11472 KB Output is correct
59 Correct 22 ms 5448 KB Output is correct
60 Correct 69 ms 10060 KB Output is correct
61 Correct 76 ms 10724 KB Output is correct
62 Correct 80 ms 11060 KB Output is correct
63 Correct 96 ms 10928 KB Output is correct
64 Correct 72 ms 10904 KB Output is correct
65 Correct 68 ms 11320 KB Output is correct
66 Correct 51 ms 11316 KB Output is correct
67 Correct 57 ms 12924 KB Output is correct
68 Correct 68 ms 13084 KB Output is correct
69 Correct 54 ms 13016 KB Output is correct
70 Correct 61 ms 12976 KB Output is correct