# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
355536 | Lam_lai_cuoc_doi | Power Plant (JOI20_power) | C++17 | 2 ms | 2668 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <cstdio>
#include <vector>
#define task ""
using namespace std;
using ll = long long;
using ld = long double;
const int N = 1e5 + 2;
const int Inf = 1e9 + 7;
vector<int> adj[N];
int n, dp[N], root;
bool vis[N];
string s;
void Read()
{
cin >> n;
for (int i = 1; i < n; ++i)
{
int u, v;
cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
}
cin >> s;
s = " " + s;
}
void dfs(int v)
{
dp[v] = s[v] - '0';
int sum(0);
for (auto i : adj[v])
if (dp[i] == -Inf)
{
dfs(i);
sum += dp[i];
dp[v] = max(dp[v], dp[i] + 1);
}
dp[v] = max(dp[v], sum - (s[v] - '0'));
}
int GetAns(int v)
{
fill(dp, dp + n + 1, -Inf);
root = v;
dfs(v);
return dp[v];
}
void Solve()
{
cout << GetAns(1);
}
int32_t main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
if (fopen(task ".INP", "r"))
{
freopen(task ".INP", "r", stdin);
freopen(task ".OUT", "w", stdout);
}
Read();
Solve();
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |