# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
518695 | cig32 | Power Plant (JOI20_power) | C++17 | 1565 ms | 28228 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.
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
const int MAXN = 3e5 + 10;
const int MOD = 1e9 + 7;
#define int long long
vector<int> adj[MAXN];
char c[MAXN];
int dp[MAXN];
int dpf(int node, int prev) {
int sum = 0, mx = 0;
for(int x: adj[node]) {
if(x != prev) {
int d = dpf(x, node);
sum += d;
mx = max(mx, d);
}
}
if(prev == -1 && c[node] == '1') {
return dp[node] = max(mx + 1, sum - 1);
}
if(prev == -1 && c[node] == '0') {
return dp[node] = sum;
}
if(c[node] == '1') {
return dp[node] = max(1ll, sum - 1);
}
else {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |