제출 #1310556

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1310556		Zbyszek99	Power Plant (JOI20_power)	C++20	100 / 100	72 ms	23284 KiB

power

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

bool is_special[200001];
vi graph[200001];
int dp[200001];
int ans = 0;

void dfs(int v, int pop)
{
    forall(it,graph[v])
    {
        if(it == pop) continue;
        dfs(it,v);
        if(is_special[v]) ans = max(ans,dp[it]+1);
        dp[v] += dp[it];
    }
    if(is_special[v]) dp[v] = max(dp[v]-1,1);
    ans = max(ans,dp[v]);
}

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //random_start();
    int n;
    cin >> n;
    rep(i,n-1)
    {
        int a,b;
        cin >> a >> b;
        graph[a].pb(b);
        graph[b].pb(a);
    }
    rep2(i,1,n)
    {
        char z;
        cin >> z;
        is_special[i] = z-'0';
    }
    dfs(1,1);
    cout << ans << "\n";
}

• Subtask 1: 6 / 6
• Subtask 2: 41 / 41
• Subtask 3: 53 / 53