oj.uz

Submission #992597

# Submission time Handle Problem Language Result Execution time Memory
992597 2024-06-04T18:47:09 Z vysniak_grossmeister Power Plant (JOI20_power) C++17
47 / 100
 17 ms 17756 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,tune=native")
using namespace std;

const int N = 1e5 * 2ll;

typedef long long ll;
string s;
vector<ll>g[N];

ll ans = 0ll;

ll dp[N];

void dfs(ll v, ll p){

    if(s[v - 1] == '1'){

        for(auto to : g[v]){


            if(to != p){

                dfs(to, v);

                dp[v] = dp[v] + dp[to];

                // just take subtree of child so ->>...

                ans = max(ans, dp[to] + 1ll);


            }




        }

        if(dp[v] >= 2ll){

            dp[v] -= 1ll;

        }
        else{

            dp[v] = max(dp[v], 1ll);

        }

        // because v will break;

    }
    else{

        for(auto to : g[v]){

            if(to != p){

                dfs(to, v);

                dp[v] += dp[to];

                // just take subtree of child so ->>...

                ans = max(ans, dp[to] + 0ll);

            }

        }


    }

    ans = max(ans, dp[v]);

}



int main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);

ll n;
cin >> n;

for(ll i = 1; i <= n - 1; ++i){
    ll a, b;
    cin >> a >> b;
    g[a].push_back(b);
    g[b].push_back(a);
}


cin >> s;

dfs(1ll, -1ll);

cout << ans << endl;

return 0;

}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 2 ms 6492 KB Output is correct
6 Correct 1 ms 6328 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 2 ms 6488 KB Output is correct
13 Correct 2 ms 6492 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 2 ms 6492 KB Output is correct
19 Correct 1 ms 6492 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct

Subtask #2
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 2 ms 6492 KB Output is correct
6 Correct 1 ms 6328 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 2 ms 6488 KB Output is correct
13 Correct 2 ms 6492 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 2 ms 6492 KB Output is correct
19 Correct 1 ms 6492 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 2 ms 6492 KB Output is correct
23 Correct 2 ms 6492 KB Output is correct
24 Correct 2 ms 6492 KB Output is correct
25 Correct 2 ms 6492 KB Output is correct
26 Correct 2 ms 6492 KB Output is correct
27 Correct 2 ms 6488 KB Output is correct
28 Correct 2 ms 6492 KB Output is correct
29 Correct 2 ms 6544 KB Output is correct
30 Correct 2 ms 6492 KB Output is correct
31 Correct 2 ms 6492 KB Output is correct
32 Correct 2 ms 6492 KB Output is correct
33 Correct 2 ms 6492 KB Output is correct
34 Correct 2 ms 6492 KB Output is correct
35 Correct 2 ms 6492 KB Output is correct
36 Correct 2 ms 6492 KB Output is correct
37 Correct 2 ms 6492 KB Output is correct
38 Correct 2 ms 6488 KB Output is correct
39 Correct 2 ms 6492 KB Output is correct
40 Correct 2 ms 6492 KB Output is correct
41 Correct 2 ms 6492 KB Output is correct
42 Correct 3 ms 6488 KB Output is correct
43 Correct 2 ms 6492 KB Output is correct
44 Correct 2 ms 6524 KB Output is correct
45 Correct 2 ms 6492 KB Output is correct
46 Correct 2 ms 6492 KB Output is correct
47 Correct 2 ms 6492 KB Output is correct
48 Correct 1 ms 6492 KB Output is correct
49 Correct 2 ms 6492 KB Output is correct
50 Correct 2 ms 6492 KB Output is correct
51 Correct 2 ms 6492 KB Output is correct
52 Correct 2 ms 6488 KB Output is correct
53 Correct 2 ms 6492 KB Output is correct
54 Correct 2 ms 6488 KB Output is correct
55 Correct 2 ms 6488 KB Output is correct
56 Correct 2 ms 6492 KB Output is correct
57 Correct 2 ms 6516 KB Output is correct
58 Correct 2 ms 6488 KB Output is correct
59 Correct 2 ms 6492 KB Output is correct
60 Correct 2 ms 6492 KB Output is correct
61 Correct 2 ms 6492 KB Output is correct
62 Correct 2 ms 6492 KB Output is correct
63 Correct 3 ms 6492 KB Output is correct

Subtask #3
0.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 2 ms 6492 KB Output is correct
6 Correct 1 ms 6328 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 2 ms 6488 KB Output is correct
13 Correct 2 ms 6492 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 2 ms 6492 KB Output is correct
19 Correct 1 ms 6492 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 2 ms 6492 KB Output is correct
23 Correct 2 ms 6492 KB Output is correct
24 Correct 2 ms 6492 KB Output is correct
25 Correct 2 ms 6492 KB Output is correct
26 Correct 2 ms 6492 KB Output is correct
27 Correct 2 ms 6488 KB Output is correct
28 Correct 2 ms 6492 KB Output is correct
29 Correct 2 ms 6544 KB Output is correct
30 Correct 2 ms 6492 KB Output is correct
31 Correct 2 ms 6492 KB Output is correct
32 Correct 2 ms 6492 KB Output is correct
33 Correct 2 ms 6492 KB Output is correct
34 Correct 2 ms 6492 KB Output is correct
35 Correct 2 ms 6492 KB Output is correct
36 Correct 2 ms 6492 KB Output is correct
37 Correct 2 ms 6492 KB Output is correct
38 Correct 2 ms 6488 KB Output is correct
39 Correct 2 ms 6492 KB Output is correct
40 Correct 2 ms 6492 KB Output is correct
41 Correct 2 ms 6492 KB Output is correct
42 Correct 3 ms 6488 KB Output is correct
43 Correct 2 ms 6492 KB Output is correct
44 Correct 2 ms 6524 KB Output is correct
45 Correct 2 ms 6492 KB Output is correct
46 Correct 2 ms 6492 KB Output is correct
47 Correct 2 ms 6492 KB Output is correct
48 Correct 1 ms 6492 KB Output is correct
49 Correct 2 ms 6492 KB Output is correct
50 Correct 2 ms 6492 KB Output is correct
51 Correct 2 ms 6492 KB Output is correct
52 Correct 2 ms 6488 KB Output is correct
53 Correct 2 ms 6492 KB Output is correct
54 Correct 2 ms 6488 KB Output is correct
55 Correct 2 ms 6488 KB Output is correct
56 Correct 2 ms 6492 KB Output is correct
57 Correct 2 ms 6516 KB Output is correct
58 Correct 2 ms 6488 KB Output is correct
59 Correct 2 ms 6492 KB Output is correct
60 Correct 2 ms 6492 KB Output is correct
61 Correct 2 ms 6492 KB Output is correct
62 Correct 2 ms 6492 KB Output is correct
63 Correct 3 ms 6492 KB Output is correct
64 Runtime error 17 ms 17756 KB Execution killed with signal 6
65 Halted 0 ms 0 KB -