oj.uz

Submission #767155

# Submission time Handle Problem Language Result Execution time Memory
767155 2023-06-26T12:51:27 Z bachhoangxuan Power Plant (JOI20_power) C++17
100 / 100
 139 ms 40780 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<pii,int>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=1e9+7;
const int maxn=200005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=500005;
const int maxl=20;
const int maxa=250000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=101;

void solve(){
    int n;cin >> n;
    vector<vector<int>> edge(n+1);
    vector<int> c(n+1,0),dp(n+1,-inf),dep(n+1,0);
    for(int i=1;i<n;i++){
        int u,v;cin >> u >> v;
        edge[u].push_back(v);
        edge[v].push_back(u);
    }
    for(int i=1;i<=n;i++){char ch;cin >> ch;c[i]=ch-'0';}
    int ans=0;
    function<void(int,int)> dfs = [&](int u,int p){
        dep[u]=dep[p]+c[u];
        int sum=-c[u];
        for(int v:edge[u]){
            if(v==p) continue;
            dfs(v,u);dp[u]=max(dp[u],dp[v]);
            sum+=max(0LL,dp[v]+dep[u]);
        }
        sum=max(sum,c[u]);ans=max(ans,sum);
        ans=max(ans,dp[u]+dep[u]+c[u]);
        dp[u]=max(dp[u],sum-dep[p]);
    };
    dfs(1,0);
    cout << ans << '\n';
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
6.0 / 6.0

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

Subtask #2
41.0 / 41.0

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

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 320 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 324 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 464 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 476 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 464 KB Output is correct
29 Correct 1 ms 596 KB Output is correct
30 Correct 1 ms 596 KB Output is correct
31 Correct 1 ms 464 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 1 ms 468 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 1 ms 468 KB Output is correct
37 Correct 1 ms 596 KB Output is correct
38 Correct 1 ms 468 KB Output is correct
39 Correct 1 ms 596 KB Output is correct
40 Correct 1 ms 468 KB Output is correct
41 Correct 1 ms 596 KB Output is correct
42 Correct 1 ms 468 KB Output is correct
43 Correct 1 ms 464 KB Output is correct
44 Correct 1 ms 468 KB Output is correct
45 Correct 1 ms 468 KB Output is correct
46 Correct 1 ms 464 KB Output is correct
47 Correct 1 ms 468 KB Output is correct
48 Correct 1 ms 596 KB Output is correct
49 Correct 1 ms 596 KB Output is correct
50 Correct 1 ms 468 KB Output is correct
51 Correct 1 ms 468 KB Output is correct
52 Correct 1 ms 468 KB Output is correct
53 Correct 1 ms 460 KB Output is correct
54 Correct 1 ms 468 KB Output is correct
55 Correct 1 ms 468 KB Output is correct
56 Correct 1 ms 480 KB Output is correct
57 Correct 1 ms 832 KB Output is correct
58 Correct 1 ms 468 KB Output is correct
59 Correct 1 ms 468 KB Output is correct
60 Correct 1 ms 596 KB Output is correct
61 Correct 1 ms 468 KB Output is correct
62 Correct 1 ms 596 KB Output is correct
63 Correct 1 ms 468 KB Output is correct
64 Correct 102 ms 19916 KB Output is correct
65 Correct 87 ms 19808 KB Output is correct
66 Correct 91 ms 19784 KB Output is correct
67 Correct 112 ms 19924 KB Output is correct
68 Correct 86 ms 19788 KB Output is correct
69 Correct 87 ms 19788 KB Output is correct
70 Correct 85 ms 19760 KB Output is correct
71 Correct 107 ms 19804 KB Output is correct
72 Correct 104 ms 19788 KB Output is correct
73 Correct 110 ms 39072 KB Output is correct
74 Correct 107 ms 38960 KB Output is correct
75 Correct 87 ms 20940 KB Output is correct
76 Correct 116 ms 20952 KB Output is correct
77 Correct 95 ms 19760 KB Output is correct
78 Correct 91 ms 19660 KB Output is correct
79 Correct 90 ms 19688 KB Output is correct
80 Correct 93 ms 19660 KB Output is correct
81 Correct 75 ms 19728 KB Output is correct
82 Correct 98 ms 19724 KB Output is correct
83 Correct 102 ms 27980 KB Output is correct
84 Correct 139 ms 31396 KB Output is correct
85 Correct 104 ms 30760 KB Output is correct
86 Correct 96 ms 21912 KB Output is correct
87 Correct 102 ms 20936 KB Output is correct
88 Correct 88 ms 20964 KB Output is correct
89 Correct 84 ms 21056 KB Output is correct
90 Correct 82 ms 20684 KB Output is correct
91 Correct 100 ms 21036 KB Output is correct
92 Correct 98 ms 21556 KB Output is correct
93 Correct 118 ms 25352 KB Output is correct
94 Correct 91 ms 28016 KB Output is correct
95 Correct 83 ms 25952 KB Output is correct
96 Correct 83 ms 23116 KB Output is correct
97 Correct 88 ms 20668 KB Output is correct
98 Correct 99 ms 20000 KB Output is correct
99 Correct 79 ms 19788 KB Output is correct
100 Correct 85 ms 24652 KB Output is correct
101 Correct 84 ms 21408 KB Output is correct
102 Correct 76 ms 20172 KB Output is correct
103 Correct 83 ms 20124 KB Output is correct
104 Correct 71 ms 20324 KB Output is correct
105 Correct 132 ms 33924 KB Output is correct
106 Correct 54 ms 20156 KB Output is correct
107 Correct 56 ms 20184 KB Output is correct
108 Correct 107 ms 40140 KB Output is correct
109 Correct 56 ms 20264 KB Output is correct
110 Correct 108 ms 40780 KB Output is correct
111 Correct 98 ms 19740 KB Output is correct