제출 #1230816

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1230816		ender_shayan	Power Plant (JOI20_power)	C++17	47 / 100	1593 ms	31428 KiB

power

#include <bits/stdc++.h>

using namespace std;

// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;

typedef long long ll;
typedef long double	ld;
typedef pair<int, int>	pii  ;
typedef pair<ll, ll>	pll  ;
typedef vector<pii>     vii  ;
typedef vector<int>     veci ;
typedef vector<pll>     vll  ;
typedef vector<ll>      vecll;

// find_by_order             order_of_key

//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define F		        first
#define S		        second
#define pb		        push_back
#define endl            '\n'
#define Mp		        make_pair
#define all(x)          x.begin(), x.end()
#define debug(x)        cerr << #x << " = " << x << endl
#define set_dec(x)	    cout << fixed << setprecision(x);
#define fast_io         ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io         freopen("in.txt" , "r" , stdin) ; freopen("out.txt" , "w" , stdout);
#define lb              lower_bound
#define ub              upper_bound
#define for1(n)         for(int i=1;i<=n;i++)
#define for0(n)         for(int i=0;i<n;i++)
#define forn(n)         for(int i=n;i>0;i--)
#define pq              priority_queue <pii, vector<pii>, greater<pii>>


const ll mod = 1e9+7 ;// 998244353 ;// 1e9+9;

ll inf=1e18;
const int N=1e6+100,L=21,bs=701;
int A[N],B[N],C[N],D[N],E[N],n,m,k,q,dp[N],pre[N],dpp[N],vis[N],ans;
vector<int>g[N];
string s;
void dfs(int v,int p=0){
    dp[v]=0;
    int mx=0;
    for(int u:g[v])if(u!=p){
        dfs(u,v);
        dp[v]+=dp[u];
        mx=max(mx,dp[u]);
    }
    if(s[v]=='1'){
        dp[v]=max(dp[v]-1,1);
        mx++;
    }
    ans=max(ans,max(dp[v],mx));
    

}
int main(){
    fast_io
    cin>>n;
    for1(n-1){
        int u,v;cin>>u>>v;
        g[u].pb(v);
        g[v].pb(u);
    }
    cin>>s;s='0'+s;
    for1(n)if(s[i]=='1'){
        dfs(i);
        ans=max(ans,dp[i]);
    }
    cout<<ans<<endl;




}

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