oj.uz

답안 #598156

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
598156 2022-07-17T18:04:34 Z urosk The Xana coup (BOI21_xanadu) C++14
100 / 100
 79 ms 18860 KB 
#define here cerr<<"===========================================\n"
#include <bits/stdc++.h>
#define ld double
#define ll long long
#define llinf 100000000000000000LL // 10^17
#define pb push_back
#define popb pop_back
#define fi first
#define sc second
#define endl '\n'
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define sz(a) (ll)(a.size())
#define all(a) a.begin(),a.end()
#define ceri(a,l,r) {for(ll i_ = l;i_<=r;i_++) cerr<<a[i_]<< " ";cerr<<endl;}
#define daj_mi_malo_vremena ios_base::sync_with_stdio(false);cerr.tie(0);cout.tie(0);cin.tie(0);

using namespace std;

#define maxn 100005
ll n;
vector<ll> g[maxn];
ll dp[maxn][2][2];
ll a[maxn];
void dfs(ll u,ll par){
    if(a[u]==1){
        dp[u][0][1] = 1;
        dp[u][0][0] = n+1;
        dp[u][1][0] = 0;
        dp[u][1][1] = n+1;
    }else{
        dp[u][0][0] = 0;
        dp[u][0][1] = n+1;
        dp[u][1][0] = n+1;
        dp[u][1][1] = 1;
    }
    ll sum = 0;
    for(ll s : g[u]){
        if(s==par) continue;
        dfs(s,u);
        for(ll k = 0;k<2;k++){
            ll dp0 = dp[u][0][k];
            ll dp1 = dp[u][1][k];
            dp[u][0][k] = min(dp0 + dp[s][k][0],dp1 + dp[s][k][1]);
            dp[u][1][k] = min(dp0 + dp[s][k][1],dp1 + dp[s][k][0]);
        }
    }
}
int main(){
	daj_mi_malo_vremena
    cin >> n;
    for(ll i = 1;i<=n-1;i++){
        ll x,y; cin >> x >> y;
        g[x].pb(y);
        g[y].pb(x);
    }
    for(ll i = 1;i<=n;i++) cin >> a[i];
    dfs(1,1);
    ll ans = min(dp[1][0][1],dp[1][0][0]);
    if(ans>=n+1) cout<<"impossible"<<endl;
    else cout<<ans<<endl;
	return 0;
}
/*
5
1 2
1 3
2 4
2 5
0 1 0 1 1

*/

Compilation message

xanadu.cpp: In function 'void dfs(long long int, long long int)':
xanadu.cpp:37:8: warning: unused variable 'sum' [-Wunused-variable]
   37 |     ll sum = 0;
      |        ^~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 2 ms 2688 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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 2 ms 2688 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 2684 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 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2684 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 1 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

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 18780 KB Output is correct
2 Correct 57 ms 18488 KB Output is correct
3 Correct 51 ms 18860 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 18792 KB Output is correct
2 Correct 44 ms 18488 KB Output is correct
3 Correct 53 ms 18796 KB Output is correct
4 Correct 51 ms 10840 KB Output is correct
5 Correct 60 ms 11752 KB Output is correct
6 Correct 77 ms 11848 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 15 ms 5672 KB Output is correct
9 Correct 50 ms 11524 KB Output is correct
10 Correct 52 ms 11620 KB Output is correct
11 Correct 49 ms 11948 KB Output is correct
12 Correct 74 ms 12236 KB Output is correct
13 Correct 59 ms 11592 KB Output is correct
14 Correct 63 ms 12152 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 2 ms 2688 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 2684 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 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2684 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 1 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 46 ms 18780 KB Output is correct
18 Correct 57 ms 18488 KB Output is correct
19 Correct 51 ms 18860 KB Output is correct
20 Correct 43 ms 18792 KB Output is correct
21 Correct 44 ms 18488 KB Output is correct
22 Correct 53 ms 18796 KB Output is correct
23 Correct 51 ms 10840 KB Output is correct
24 Correct 60 ms 11752 KB Output is correct
25 Correct 77 ms 11848 KB Output is correct
26 Correct 1 ms 2644 KB Output is correct
27 Correct 15 ms 5672 KB Output is correct
28 Correct 50 ms 11524 KB Output is correct
29 Correct 52 ms 11620 KB Output is correct
30 Correct 49 ms 11948 KB Output is correct
31 Correct 74 ms 12236 KB Output is correct
32 Correct 59 ms 11592 KB Output is correct
33 Correct 63 ms 12152 KB Output is correct
34 Correct 1 ms 2684 KB Output is correct
35 Correct 2 ms 2644 KB Output is correct
36 Correct 1 ms 2644 KB Output is correct
37 Correct 2 ms 2644 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 2644 KB Output is correct
42 Correct 2 ms 2644 KB Output is correct
43 Correct 1 ms 2644 KB Output is correct
44 Correct 2 ms 2684 KB Output is correct
45 Correct 66 ms 18740 KB Output is correct
46 Correct 46 ms 18564 KB Output is correct
47 Correct 45 ms 18768 KB Output is correct
48 Correct 43 ms 10912 KB Output is correct
49 Correct 47 ms 11732 KB Output is correct
50 Correct 77 ms 11936 KB Output is correct
51 Correct 2 ms 2688 KB Output is correct
52 Correct 15 ms 5596 KB Output is correct
53 Correct 49 ms 11528 KB Output is correct
54 Correct 50 ms 11608 KB Output is correct
55 Correct 49 ms 11856 KB Output is correct
56 Correct 60 ms 12208 KB Output is correct
57 Correct 46 ms 11580 KB Output is correct
58 Correct 56 ms 12236 KB Output is correct
59 Correct 18 ms 5520 KB Output is correct
60 Correct 42 ms 10664 KB Output is correct
61 Correct 51 ms 11380 KB Output is correct
62 Correct 56 ms 11592 KB Output is correct
63 Correct 79 ms 11616 KB Output is correct
64 Correct 52 ms 11496 KB Output is correct
65 Correct 43 ms 12068 KB Output is correct
66 Correct 44 ms 12040 KB Output is correct
67 Correct 36 ms 11796 KB Output is correct
68 Correct 51 ms 11748 KB Output is correct
69 Correct 37 ms 11840 KB Output is correct
70 Correct 37 ms 11776 KB Output is correct