| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 332611 |
2020-12-03T01:32:12 Z |
YJU |
Power Plant (JOI20_power) |
C++14 |
|
7 ms |
9708 KB |
#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const ll MOD=1e9+7;
const ll MOD2=998244353;
const ll N=4e5+5;
const ll K=350;
const ld pi=acos(-1);
const ll INF=(1LL<<60);
#define SQ(i) ((i)*(i))
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()
ll n,x,y,h[N],dp[N],ans,col[N];
vector<ll> v[N];
string s;
void DFS(ll nd,ll pa){
h[nd]=col[nd];dp[nd]=0;
for(auto i:v[nd]){
if(i==pa)continue;
DFS(i,nd);
dp[nd]+=dp[i];
h[nd]+=h[i];
}
dp[nd]=max(dp[nd],h[nd]+col[nd]);
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);
cin>>n;
REP(i,n-1)cin>>x>>y,v[x].pb(y),v[y].pb(x);
cin>>s;
REP(i,n)if(s[i]=='1')col[i+1]=1;
REP1(i,n){
DFS(i,0);
ans=max(ans,dp[i]-h[i]);
}
cout<<ans<<"\n";
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
9708 KB |
Output is correct |
| 2 |
Correct |
7 ms |
9708 KB |
Output is correct |
| 3 |
Correct |
7 ms |
9708 KB |
Output is correct |
| 4 |
Correct |
6 ms |
9708 KB |
Output is correct |
| 5 |
Correct |
7 ms |
9708 KB |
Output is correct |
| 6 |
Correct |
7 ms |
9708 KB |
Output is correct |
| 7 |
Correct |
7 ms |
9708 KB |
Output is correct |
| 8 |
Incorrect |
7 ms |
9708 KB |
Output isn't correct |
| 9 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
9708 KB |
Output is correct |
| 2 |
Correct |
7 ms |
9708 KB |
Output is correct |
| 3 |
Correct |
7 ms |
9708 KB |
Output is correct |
| 4 |
Correct |
6 ms |
9708 KB |
Output is correct |
| 5 |
Correct |
7 ms |
9708 KB |
Output is correct |
| 6 |
Correct |
7 ms |
9708 KB |
Output is correct |
| 7 |
Correct |
7 ms |
9708 KB |
Output is correct |
| 8 |
Incorrect |
7 ms |
9708 KB |
Output isn't correct |
| 9 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
9708 KB |
Output is correct |
| 2 |
Correct |
7 ms |
9708 KB |
Output is correct |
| 3 |
Correct |
7 ms |
9708 KB |
Output is correct |
| 4 |
Correct |
6 ms |
9708 KB |
Output is correct |
| 5 |
Correct |
7 ms |
9708 KB |
Output is correct |
| 6 |
Correct |
7 ms |
9708 KB |
Output is correct |
| 7 |
Correct |
7 ms |
9708 KB |
Output is correct |
| 8 |
Incorrect |
7 ms |
9708 KB |
Output isn't correct |
| 9 |
Halted |
0 ms |
0 KB |
- |
