# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
970998 | starchan | Power Plant (JOI20_power) | C++17 | 120 ms | 36936 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;
#define int long long
#define in array<int, 2>
#define pb push_back
#define pob pop_back
#define fast() ios_base::sync_with_stdio(false); cin.tie(NULL)
const int MX = 2e5+5;
const int INF = 1e17;
vector<int> adj[MX];
bool S[MX];
int dp[2][2][MX];
void dfs(int u, int p)
{
int V = 0; int W = 0; int UU = 0;
int rr = 0;
for(int v: adj[u])
{
if(v==p)
continue;
rr++;
dfs(v, u);
V = max(V, max(dp[0][0][v], dp[0][1][v]));
UU = max(UU, max(dp[1][0][v], dp[1][1][v]));
W+=max(dp[1][0][v], dp[1][1][v]);
}
if(rr == 0)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |