# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
997331 | DanielPr8 | Power Plant (JOI20_power) | C++14 | 80 ms | 31384 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 <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvl = vector<vll>;
using vb = vector<bool>;
using pll = pair<ll,ll>;
using vpl = vector<pll>;
using vvp = vector<vpl>;
#define f first
#define s second
#define pb push_back
#define all(v) v.begin(),v.end()
vvl g;
vb gen;
vll dp0, dp1;
ll ans = 0;
void dfs(ll cur, ll par){
if(!gen[cur]){
for(ll i:g[cur]){
if(i==par)continue;
dfs(i, cur);
dp0[cur]+=dp0[i];
dp1[cur] = max(dp1[cur], dp1[i]);
}
}
else{
ll mx=0;
for(ll i:g[cur]){
if(i==par)continue;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |