# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
292920 | arnold518 | Power Plant (JOI20_power) | C++14 | 311 ms | 28536 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;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 2e5;
int N;
vector<int> adj[MAXN+10];
int T[MAXN+10];
int ans=0;
int dp[MAXN+10];
void dfs(int now, int bef)
{
dp[now]=0;
for(int nxt : adj[now])
{
if(nxt==bef) continue;
dfs(nxt, now);
if(T[nxt]) dp[now]+=max(1, dp[nxt]-1);
else dp[now]+=dp[nxt];
}
}
void dfs2(int now, int bef)
{
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... |