oj.uz

Submission #867214

# Submission time Handle Problem Language Result Execution time Memory
867214 2023-10-28T00:45:22 Z 12345678 Power Plant (JOI20_power) C++17
0 / 100
 2 ms 4956 KB 
#include <bits/stdc++.h>

using namespace std;

const int nx=2e5+5;
int n, u, v, dp[2][nx];
vector<int> d[nx];
string s;

void dfs(int u, int p)
{
    if (s[u-1]=='1')
    {
        int cnt=0;
        for (auto v:d[u])
        {
            if (v==p) continue;
            dfs(v, u);
            dp[1][u]=max(dp[1][u], dp[0][v]+1);
            if (dp[0][v]>0) cnt++, dp[0][u]+=dp[0][v];
        }
        if (cnt>=2) dp[0][u]--;
        if (dp[0][u]==0) dp[0][u]=1;
    }
    else
    {
        for (auto v:d[u])
        {
            if (v==p) continue;
            dfs(v, u);
            dp[1][u]=max(dp[1][u], dp[1][v]);
            dp[0][u]+=dp[0][v];
        }
    }
    //cout<<u<<' '<<dp[0][u]<<' '<<dp[1][u]<<'\n';
}

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n;
    for (int i=0; i<n-1; i++) cin>>u>>v, d[u].push_back(v), d[v].push_back(u);
    cin>>s;
    dfs(1, 1);
    cout<<max(dp[0][1], dp[1][1]);
}

Subtask #1
0.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Correct 1 ms 4956 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 Incorrect 2 ms 4952 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #2
0.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Correct 1 ms 4956 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 Incorrect 2 ms 4952 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #3
0.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Correct 1 ms 4956 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 Incorrect 2 ms 4952 KB Output isn't correct
13 Halted 0 ms 0 KB -