oj.uz

Submission #312785

# Submission time Handle Problem Language Result Execution time Memory
312785 2020-10-14T11:20:10 Z Jarif_Rahman Power Plant (JOI20_power) C++17
0 / 100
 1 ms 384 KB 
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;
int n; str s;
vector <vector<int>> v;
ll ans =  0;
ll dfs(int nd, int ss){
    ll r = '0'-s[nd];
    bool bl = (r==-1);
    ll mx = 0;
    if(ss == -1 && s[nd] == '1' && v[nd].size() == 1) r = 1;
    else if(v[nd].size() <= 2 && s[nd] == '1' && ss != -1) r = 1;
    for(int x: v[nd]) if(x != ss){
        ll y =dfs(x, nd);
        mx = max(mx, y);
        r+=y;
    }
    if(bl) r = max(r, mx+1);
    ans = max(ans, max(r, (ll)s[nd] - '0'));
    if(v[nd].size() <= 2 && s[nd] == '1' && ss != -1)r-=2;
    return max(r, (ll)s[nd] - '0');
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n;
    v = vector<vector<int>> (n+1);
    for(int i = 1; i < n; i++){
        int a, b; cin >> a >> b;
        v[a].pb(b);
        v[b].pb(a);
    }
    cin >> s;
    s = "x"+s;
    ans = max(ans, dfs(1, -1));
    cout << ans << "\n";
}

Subtask #1
0.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Incorrect 1 ms 384 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Incorrect 1 ms 384 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Incorrect 1 ms 384 KB Output isn't correct
8 Halted 0 ms 0 KB -