제출 #1143015

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1143015		Noproblem29	Power Plant (JOI20_power)	C++20	0 / 100	2 ms	2632 KiB

power

#include<bits/stdc++.h>
using namespace std;
#ifndef BADGNU
#pragma GCC target("sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#endif
#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp> 
using namespace __gnu_pbds;
#define ll long long
#define int ll
#define ld long double
#define y1 cheza
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T> using ordered_set = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
template<class T> using ordered_multiset = tree<T,null_type,less_equal<T>,rb_tree_tag,tree_order_statistics_node_update>;
const int N=1e5+100;
const int M=5001;
const int B=447;
const int mod=998244353;
const ll INF=1e18;
const int dx[]={1,-1,0,0};
const int dy[]={0,0,1,-1};
const double eps=1e-6;
int n;
vector<int>g[N];
int ok[N];
int dp[N];
void dfs(int x,int p){
    dp[x]=0;
    for(auto i:g[x]){
        if(i!=p){
            dfs(i,x);
            dp[x]+=dp[i];
        }
    }
    dp[x]=max(ok[x],dp[x]-ok[x]);
}
void test(){
    cin>>n;
    for(int i=1,x,y;i<n;i++){
        cin>>x>>y;
        g[x].push_back(y);
        g[y].push_back(x);
    }
    for(int i=1;i<=n;i++){
        char x;
        cin>>x;
        ok[i]=x-'0';
    }
    int ans=0;
    for(int i=1;i<=n;i++){
        dfs(i,i);
        ans=max(ans,dp[i]);
    }
    cout<<ans<<'\n';




}



/*

*/
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    // cout.tie(nullptr);
    int t2=1;
    // cin>>t2;
    for(int i=1;i<=t2;i++){
        test();
    }
}

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