Submission #867214

#	Time	Username	Problem	Language	Result	Execution time	Memory
867214		12345678	Power Plant (JOI20_power)	C++17	0 / 100	2 ms	4956 KiB

power

#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 / 6
• Subtask 2: 0 / 41
• Subtask 3: 0 / 53