Submission #933672

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
933672	2024-02-26T04:38:39 Z	beepbeepsheep	The Xana coup (BOI21_xanadu)	C++17	100 / 100	76 ms	51444 KB

xanadu

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

typedef tree<long long, null_type, less_equal<>,
        rb_tree_tag, tree_order_statistics_node_update>
        ordered_set;
        
#define ll long long
#define ii pair<ll,ll>
#define iii tuple<ll,ll,ll>

#ifndef DEBUG
#define cerr if (0) cerr
#define endl '\n'
#endif

const ll inf=1e15;
const ll maxn=5e5+5;
const ll mod=1e9+7;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

vector<ll> adj[maxn];
ll arr[maxn];
ll dp[maxn][2][2];
ll dfs(ll x, ll p, ll fs, ll fp){
	if (dp[x][fs][fp]!=-1) return dp[x][fs][fp];
	ll parity=arr[x]^fs^fp;
	dp[x][fs][fp]=fs;
	priority_queue<ll,vector<ll>,greater<ll>> pq;
	for (auto u:adj[x]){
		if (u==p) continue;
		dfs(u,x,0,fs);
		dfs(u,x,1,fs);
		dp[x][fs][fp]+=dp[u][0][fs];
		pq.emplace(dp[u][1][fs]-dp[u][0][fs]);
	}
	if (parity==1 && pq.empty()){
		return dp[x][fs][fp]=inf;
	}
	if (parity){
		dp[x][fs][fp]+=pq.top();
		pq.pop();
	}
	while (pq.size()){
		ll a=pq.top();
		pq.pop();
		if (pq.empty()) break;
		ll b=pq.top();
		pq.pop();
		if (a+b>=0) break;
		dp[x][fs][fp]+=(a+b); //add if we can get negative result
		//i.e. savings 
	}
	return dp[x][fs][fp];
}
int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	memset(dp,-1,sizeof(dp));
 	ll n,a,b;
 	cin>>n;
 	for (int i=1;i<n;i++){
 		cin>>a>>b;
 		adj[a].emplace_back(b);
 		adj[b].emplace_back(a);
 	}
 	for (int i=1;i<=n;i++) cin>>arr[i];
 	dfs(1,0,0,0);
 	dfs(1,0,1,0);
 	ll ans=min(dp[1][0][0],dp[1][1][0]);
 	if (ans>=inf){
 		cout<<"impossible";
 	} else cout<<ans;
	return 0;
}

Subtask #1
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	29628 KB	Output is correct
2	Correct	5 ms	29704 KB	Output is correct
3	Correct	6 ms	29532 KB	Output is correct
4	Correct	5 ms	29784 KB	Output is correct
5	Correct	5 ms	29532 KB	Output is correct

Subtask #2
15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	29628 KB	Output is correct
2	Correct	5 ms	29704 KB	Output is correct
3	Correct	6 ms	29532 KB	Output is correct
4	Correct	5 ms	29784 KB	Output is correct
5	Correct	5 ms	29532 KB	Output is correct
6	Correct	5 ms	29528 KB	Output is correct
7	Correct	6 ms	29532 KB	Output is correct
8	Correct	5 ms	29532 KB	Output is correct
9	Correct	5 ms	29532 KB	Output is correct
10	Correct	5 ms	29684 KB	Output is correct
11	Correct	6 ms	29724 KB	Output is correct
12	Correct	5 ms	29528 KB	Output is correct
13	Correct	5 ms	29532 KB	Output is correct
14	Correct	6 ms	29532 KB	Output is correct
15	Correct	6 ms	29532 KB	Output is correct
16	Correct	5 ms	29532 KB	Output is correct

Subtask #3
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	56 ms	49756 KB	Output is correct
2	Correct	56 ms	51024 KB	Output is correct
3	Correct	60 ms	51284 KB	Output is correct

Subtask #4
40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	56 ms	49748 KB	Output is correct
2	Correct	58 ms	50880 KB	Output is correct
3	Correct	66 ms	51444 KB	Output is correct
4	Correct	54 ms	34496 KB	Output is correct
5	Correct	60 ms	34960 KB	Output is correct
6	Correct	71 ms	35076 KB	Output is correct
7	Correct	6 ms	29528 KB	Output is correct
8	Correct	21 ms	31324 KB	Output is correct
9	Correct	55 ms	34648 KB	Output is correct
10	Correct	55 ms	34804 KB	Output is correct
11	Correct	56 ms	35924 KB	Output is correct
12	Correct	73 ms	36180 KB	Output is correct
13	Correct	55 ms	35148 KB	Output is correct
14	Correct	56 ms	35164 KB	Output is correct

Subtask #5
30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	29628 KB	Output is correct
2	Correct	5 ms	29704 KB	Output is correct
3	Correct	6 ms	29532 KB	Output is correct
4	Correct	5 ms	29784 KB	Output is correct
5	Correct	5 ms	29532 KB	Output is correct
6	Correct	5 ms	29528 KB	Output is correct
7	Correct	6 ms	29532 KB	Output is correct
8	Correct	5 ms	29532 KB	Output is correct
9	Correct	5 ms	29532 KB	Output is correct
10	Correct	5 ms	29684 KB	Output is correct
11	Correct	6 ms	29724 KB	Output is correct
12	Correct	5 ms	29528 KB	Output is correct
13	Correct	5 ms	29532 KB	Output is correct
14	Correct	6 ms	29532 KB	Output is correct
15	Correct	6 ms	29532 KB	Output is correct
16	Correct	5 ms	29532 KB	Output is correct
17	Correct	56 ms	49756 KB	Output is correct
18	Correct	56 ms	51024 KB	Output is correct
19	Correct	60 ms	51284 KB	Output is correct
20	Correct	56 ms	49748 KB	Output is correct
21	Correct	58 ms	50880 KB	Output is correct
22	Correct	66 ms	51444 KB	Output is correct
23	Correct	54 ms	34496 KB	Output is correct
24	Correct	60 ms	34960 KB	Output is correct
25	Correct	71 ms	35076 KB	Output is correct
26	Correct	6 ms	29528 KB	Output is correct
27	Correct	21 ms	31324 KB	Output is correct
28	Correct	55 ms	34648 KB	Output is correct
29	Correct	55 ms	34804 KB	Output is correct
30	Correct	56 ms	35924 KB	Output is correct
31	Correct	73 ms	36180 KB	Output is correct
32	Correct	55 ms	35148 KB	Output is correct
33	Correct	56 ms	35164 KB	Output is correct
34	Correct	6 ms	29528 KB	Output is correct
35	Correct	6 ms	29532 KB	Output is correct
36	Correct	6 ms	29532 KB	Output is correct
37	Correct	5 ms	29724 KB	Output is correct
38	Correct	6 ms	29532 KB	Output is correct
39	Correct	6 ms	29532 KB	Output is correct
40	Correct	5 ms	29724 KB	Output is correct
41	Correct	5 ms	29528 KB	Output is correct
42	Correct	5 ms	29532 KB	Output is correct
43	Correct	5 ms	29648 KB	Output is correct
44	Correct	5 ms	29532 KB	Output is correct
45	Correct	60 ms	51216 KB	Output is correct
46	Correct	70 ms	51152 KB	Output is correct
47	Correct	63 ms	51280 KB	Output is correct
48	Correct	51 ms	34488 KB	Output is correct
49	Correct	56 ms	34904 KB	Output is correct
50	Correct	60 ms	34896 KB	Output is correct
51	Correct	7 ms	29528 KB	Output is correct
52	Correct	25 ms	31480 KB	Output is correct
53	Correct	54 ms	34800 KB	Output is correct
54	Correct	55 ms	34928 KB	Output is correct
55	Correct	56 ms	35920 KB	Output is correct
56	Correct	76 ms	36256 KB	Output is correct
57	Correct	56 ms	35008 KB	Output is correct
58	Correct	58 ms	35336 KB	Output is correct
59	Correct	23 ms	31320 KB	Output is correct
60	Correct	69 ms	34264 KB	Output is correct
61	Correct	60 ms	34504 KB	Output is correct
62	Correct	57 ms	35052 KB	Output is correct
63	Correct	70 ms	34640 KB	Output is correct
64	Correct	62 ms	34644 KB	Output is correct
65	Correct	68 ms	35160 KB	Output is correct
66	Correct	50 ms	35156 KB	Output is correct
67	Correct	53 ms	37296 KB	Output is correct
68	Correct	53 ms	36724 KB	Output is correct
69	Correct	53 ms	36804 KB	Output is correct
70	Correct	63 ms	36772 KB	Output is correct

Submission #933672

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 15.0 / 15.0

Subtask #3 10.0 / 10.0

Subtask #4 40.0 / 40.0

Subtask #5 30.0 / 30.0

Subtask #1
5.0 / 5.0

Subtask #2
15.0 / 15.0

Subtask #3
10.0 / 10.0

Subtask #4
40.0 / 40.0

Subtask #5
30.0 / 30.0