oj.uz

Submission #553888

# Submission time Handle Problem Language Result Execution time Memory
553888 2022-04-27T08:53:13 Z new_acc The Xana coup (BOI21_xanadu) C++14
100 / 100
 67 ms 29116 KB 
#include<bits/stdc++.h>
#define fi first
#define se second
#define pitem item*
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
const int N=1e5+10;
const int SS=1<<19;
const int INFi=1e9;
const ll INFl=1e13;
const ll mod2=998244353;
const ll mod=1e9+7;
const ll mod3=1000696969;
const ll p=70032301;
const ull p2=913;
const int L=20;
ll dp[N][2][2];
vi graf[N];
bool t[N];
void dfs(int v,int o){
	vl curr1,curr2;
	ll sum1=0,sum2=0;
	for(auto u:graf[v]){
		if(u==o) continue;
		dfs(u,v);
		sum1+=dp[u][t[u]][0],sum2+=dp[u][t[u]^1][0];
		curr1.push_back(dp[u][t[u]][1]-dp[u][t[u]][0]),curr2.push_back(dp[u][t[u]^1][1]-dp[u][t[u]^1][0]);
	}
	sort(curr1.begin(),curr1.end()),sort(curr2.begin(),curr2.end());
	dp[v][0][0]=min((ll)INFi,sum1),dp[v][1][1]=min((ll)INFi,sum2);
	dp[v][0][1]=INFi,dp[v][1][0]=INFi;
	ll cnt=0;
	for(int i=0;i<curr1.size();i++){
		cnt+=curr1[i];
		if(!(i&1)) dp[v][1][0]=min(dp[v][1][0],cnt+sum1);
		else dp[v][0][0]=min(dp[v][0][0],cnt+sum1);
	}
	cnt=0;	
	for(int i=0;i<curr2.size();i++){
		cnt+=curr2[i];
		if(!(i&1)) dp[v][0][1]=min(dp[v][0][1],cnt+sum2);
		else dp[v][1][1]=min(dp[v][1][1],cnt+sum2);
	}
	dp[v][1][1]++,dp[v][0][1]++;
	dp[v][1][1]=min(dp[v][1][1],(ll)INFi),dp[v][0][1]=min(dp[v][0][1],(ll)INFi);
}
void solve(){
	int n;
	cin>>n;
	for(int a,b,i=1;i<n;i++){
		cin>>a>>b;
		graf[a].push_back(b),graf[b].push_back(a);
	}
	for(int i=1;i<=n;i++) cin>>t[i];
	dfs(1,1);
	int res=min(dp[1][t[1]][0],dp[1][t[1]][1]);
	if(res==INFi) cout<<"impossible\n";
	else cout<<res<<"\n";
}
int main(){
	ios_base::sync_with_stdio(0),cin.tie(0);
	solve();
}

Compilation message

xanadu.cpp: In function 'void dfs(int, int)':
xanadu.cpp:36:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |  for(int i=0;i<curr1.size();i++){
      |              ~^~~~~~~~~~~~~
xanadu.cpp:42:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |  for(int i=0;i<curr2.size();i++){
      |              ~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2692 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2684 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2676 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2680 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2684 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2680 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 66 ms 29052 KB Output is correct
2 Correct 60 ms 28620 KB Output is correct
3 Correct 62 ms 29116 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 28912 KB Output is correct
2 Correct 63 ms 28620 KB Output is correct
3 Correct 63 ms 29084 KB Output is correct
4 Correct 52 ms 9496 KB Output is correct
5 Correct 64 ms 10108 KB Output is correct
6 Correct 60 ms 10364 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 17 ms 5364 KB Output is correct
9 Correct 64 ms 10424 KB Output is correct
10 Correct 60 ms 10576 KB Output is correct
11 Correct 63 ms 11932 KB Output is correct
12 Correct 67 ms 12344 KB Output is correct
13 Correct 54 ms 9888 KB Output is correct
14 Correct 60 ms 10312 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2692 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2684 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2676 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2680 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2684 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2680 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 66 ms 29052 KB Output is correct
18 Correct 60 ms 28620 KB Output is correct
19 Correct 62 ms 29116 KB Output is correct
20 Correct 65 ms 28912 KB Output is correct
21 Correct 63 ms 28620 KB Output is correct
22 Correct 63 ms 29084 KB Output is correct
23 Correct 52 ms 9496 KB Output is correct
24 Correct 64 ms 10108 KB Output is correct
25 Correct 60 ms 10364 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 17 ms 5364 KB Output is correct
28 Correct 64 ms 10424 KB Output is correct
29 Correct 60 ms 10576 KB Output is correct
30 Correct 63 ms 11932 KB Output is correct
31 Correct 67 ms 12344 KB Output is correct
32 Correct 54 ms 9888 KB Output is correct
33 Correct 60 ms 10312 KB Output is correct
34 Correct 2 ms 2644 KB Output is correct
35 Correct 2 ms 2680 KB Output is correct
36 Correct 2 ms 2644 KB Output is correct
37 Correct 2 ms 2644 KB Output is correct
38 Correct 2 ms 2680 KB Output is correct
39 Correct 2 ms 2644 KB Output is correct
40 Correct 2 ms 2680 KB Output is correct
41 Correct 2 ms 2684 KB Output is correct
42 Correct 2 ms 2644 KB Output is correct
43 Correct 2 ms 2644 KB Output is correct
44 Correct 2 ms 2644 KB Output is correct
45 Correct 64 ms 28996 KB Output is correct
46 Correct 59 ms 28624 KB Output is correct
47 Correct 62 ms 29048 KB Output is correct
48 Correct 52 ms 9484 KB Output is correct
49 Correct 61 ms 10292 KB Output is correct
50 Correct 65 ms 10372 KB Output is correct
51 Correct 2 ms 2644 KB Output is correct
52 Correct 18 ms 5332 KB Output is correct
53 Correct 62 ms 10352 KB Output is correct
54 Correct 64 ms 10584 KB Output is correct
55 Correct 64 ms 11928 KB Output is correct
56 Correct 64 ms 12328 KB Output is correct
57 Correct 56 ms 9888 KB Output is correct
58 Correct 59 ms 10324 KB Output is correct
59 Correct 18 ms 5256 KB Output is correct
60 Correct 55 ms 9600 KB Output is correct
61 Correct 65 ms 10284 KB Output is correct
62 Correct 62 ms 10460 KB Output is correct
63 Correct 62 ms 10572 KB Output is correct
64 Correct 60 ms 10500 KB Output is correct
65 Correct 49 ms 10820 KB Output is correct
66 Correct 48 ms 10904 KB Output is correct
67 Correct 48 ms 13176 KB Output is correct
68 Correct 43 ms 13120 KB Output is correct
69 Correct 51 ms 13156 KB Output is correct
70 Correct 46 ms 13100 KB Output is correct