oj.uz

Submission #867091

# Submission time Handle Problem Language Result Execution time Memory
867091 2023-10-27T16:47:44 Z HossamHero7 The Xana coup (BOI21_xanadu) C++14
100 / 100
 125 ms 45220 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
vector<vector<int>> adj;
vector<int> on;
const int N = 1e5+5;
ll dp[N][3][2];
ll solve(int node,int par,int pressed,bool color){
    ll &ret = dp[node][pressed][color];
    if(~ret) return ret;
    ret = 1e9;
    if(pressed != 1){
        int sz = adj[node].size();
        if(node) sz --;
        vector<vector<ll>> dp2(2,vector<ll>(2));
        vector<pair<ll,ll>> ops;
        for(auto ch : adj[node]){
            if(ch == par) continue;
            ops.push_back({solve(ch,node,1,on[ch]^1) + 1 , solve(ch,node,0,on[ch])});
        }
        dp2[sz&1][color] = 0;
        dp2[sz&1][!color] = 1e9;
        for(int i=sz-1;i>=0;i--){
            for(int j=0;j<2;j++){
                dp2[i&1][j] = min(dp2[i+1&1][j]+ops[i].second , dp2[i+1&1][j^1] + ops[i].first);
            }
        }
        ret = min(ret,dp2[0][0]);
    }
    if(pressed != 0){
        int sz = adj[node].size();
        if(node) sz --;
        vector<vector<ll>> dp2(2,vector<ll>(2));
        vector<pair<ll,ll>> ops;
        for(auto ch : adj[node]){
            if(ch == par) continue;
            ops.push_back({solve(ch,node,1,on[ch]) + 1 , solve(ch,node,0,on[ch]^1)});
        }
        dp2[sz&1][color] = (pressed == 1 ? 0 : 1e9);
        dp2[sz&1][!color] = (pressed == 2 ? 0 : 1e9);
        for(int i=sz-1;i>=0;i--){
            for(int j=0;j<2;j++){
                dp2[i&1][j] = min(dp2[i+1&1][j]+ops[i].second , dp2[i+1&1][j^1] + ops[i].first);
            }
        }
        ret = min(ret,dp2[0][0] + (pressed == 2));
    }
    return ret;
}
void solve(){
    int n;
    cin>>n;
    adj.resize(n);
    for(int i=0;i<n-1;i++){
        int a,b;
        cin>>a>>b;
        a -- , b --;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }
    on.resize(n);
    for(int i=0;i<n;i++){
        int x;cin>>x;
        if(x) on[i] = 1;
    }
    memset(dp,-1,sizeof(dp));
    ll ans = solve(0,n,2,on[0]);
    if(ans >= 1e9) cout<<"impossible"<<endl;
    else cout<<ans<<endl;
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);      cout.tie(0);
    int t=1;
    //cin>>t;
    while(t--){
        solve();
    }
    return 0;
}

Compilation message

xanadu.cpp: In function 'll solve(int, int, int, bool)':
xanadu.cpp:26:40: warning: suggest parentheses around '+' in operand of '&' [-Wparentheses]
   26 |                 dp2[i&1][j] = min(dp2[i+1&1][j]+ops[i].second , dp2[i+1&1][j^1] + ops[i].first);
      |                                       ~^~
xanadu.cpp:26:70: warning: suggest parentheses around '+' in operand of '&' [-Wparentheses]
   26 |                 dp2[i&1][j] = min(dp2[i+1&1][j]+ops[i].second , dp2[i+1&1][j^1] + ops[i].first);
      |                                                                     ~^~
xanadu.cpp:44:40: warning: suggest parentheses around '+' in operand of '&' [-Wparentheses]
   44 |                 dp2[i&1][j] = min(dp2[i+1&1][j]+ops[i].second , dp2[i+1&1][j^1] + ops[i].first);
      |                                       ~^~
xanadu.cpp:44:70: warning: suggest parentheses around '+' in operand of '&' [-Wparentheses]
   44 |                 dp2[i&1][j] = min(dp2[i+1&1][j]+ops[i].second , dp2[i+1&1][j^1] + ops[i].first);
      |                                                                     ~^~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4952 KB Output is correct
2 Correct 1 ms 4952 KB Output is correct
3 Correct 1 ms 4988 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4952 KB Output is correct
2 Correct 1 ms 4952 KB Output is correct
3 Correct 1 ms 4988 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Correct 1 ms 4952 KB Output is correct
7 Correct 1 ms 4956 KB Output is correct
8 Correct 1 ms 4956 KB Output is correct
9 Correct 1 ms 4956 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 1 ms 4956 KB Output is correct
12 Correct 1 ms 4956 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct
14 Correct 1 ms 4956 KB Output is correct
15 Correct 1 ms 4956 KB Output is correct
16 Correct 1 ms 4956 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 44884 KB Output is correct
2 Correct 97 ms 44380 KB Output is correct
3 Correct 98 ms 45140 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 45136 KB Output is correct
2 Correct 105 ms 44372 KB Output is correct
3 Correct 101 ms 45220 KB Output is correct
4 Correct 74 ms 11600 KB Output is correct
5 Correct 98 ms 12228 KB Output is correct
6 Correct 78 ms 12280 KB Output is correct
7 Correct 1 ms 5208 KB Output is correct
8 Correct 25 ms 7760 KB Output is correct
9 Correct 103 ms 12576 KB Output is correct
10 Correct 98 ms 12724 KB Output is correct
11 Correct 83 ms 15100 KB Output is correct
12 Correct 89 ms 15532 KB Output is correct
13 Correct 81 ms 11864 KB Output is correct
14 Correct 94 ms 12364 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4952 KB Output is correct
2 Correct 1 ms 4952 KB Output is correct
3 Correct 1 ms 4988 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Correct 1 ms 4952 KB Output is correct
7 Correct 1 ms 4956 KB Output is correct
8 Correct 1 ms 4956 KB Output is correct
9 Correct 1 ms 4956 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 1 ms 4956 KB Output is correct
12 Correct 1 ms 4956 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct
14 Correct 1 ms 4956 KB Output is correct
15 Correct 1 ms 4956 KB Output is correct
16 Correct 1 ms 4956 KB Output is correct
17 Correct 120 ms 44884 KB Output is correct
18 Correct 97 ms 44380 KB Output is correct
19 Correct 98 ms 45140 KB Output is correct
20 Correct 108 ms 45136 KB Output is correct
21 Correct 105 ms 44372 KB Output is correct
22 Correct 101 ms 45220 KB Output is correct
23 Correct 74 ms 11600 KB Output is correct
24 Correct 98 ms 12228 KB Output is correct
25 Correct 78 ms 12280 KB Output is correct
26 Correct 1 ms 5208 KB Output is correct
27 Correct 25 ms 7760 KB Output is correct
28 Correct 103 ms 12576 KB Output is correct
29 Correct 98 ms 12724 KB Output is correct
30 Correct 83 ms 15100 KB Output is correct
31 Correct 89 ms 15532 KB Output is correct
32 Correct 81 ms 11864 KB Output is correct
33 Correct 94 ms 12364 KB Output is correct
34 Correct 1 ms 4956 KB Output is correct
35 Correct 1 ms 4956 KB Output is correct
36 Correct 1 ms 5076 KB Output is correct
37 Correct 1 ms 4956 KB Output is correct
38 Correct 1 ms 4956 KB Output is correct
39 Correct 1 ms 4952 KB Output is correct
40 Correct 1 ms 4956 KB Output is correct
41 Correct 1 ms 4956 KB Output is correct
42 Correct 1 ms 4956 KB Output is correct
43 Correct 1 ms 4956 KB Output is correct
44 Correct 1 ms 5000 KB Output is correct
45 Correct 125 ms 44880 KB Output is correct
46 Correct 98 ms 44796 KB Output is correct
47 Correct 96 ms 45076 KB Output is correct
48 Correct 70 ms 11408 KB Output is correct
49 Correct 76 ms 12136 KB Output is correct
50 Correct 86 ms 12400 KB Output is correct
51 Correct 1 ms 5208 KB Output is correct
52 Correct 25 ms 7660 KB Output is correct
53 Correct 75 ms 12476 KB Output is correct
54 Correct 106 ms 12888 KB Output is correct
55 Correct 81 ms 14956 KB Output is correct
56 Correct 82 ms 15444 KB Output is correct
57 Correct 71 ms 11864 KB Output is correct
58 Correct 77 ms 12368 KB Output is correct
59 Correct 28 ms 7760 KB Output is correct
60 Correct 88 ms 11844 KB Output is correct
61 Correct 77 ms 12372 KB Output is correct
62 Correct 77 ms 12684 KB Output is correct
63 Correct 79 ms 12628 KB Output is correct
64 Correct 85 ms 12548 KB Output is correct
65 Correct 71 ms 12892 KB Output is correct
66 Correct 81 ms 12888 KB Output is correct
67 Correct 95 ms 16388 KB Output is correct
68 Correct 77 ms 16364 KB Output is correct
69 Correct 80 ms 16312 KB Output is correct
70 Correct 113 ms 16364 KB Output is correct