| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 763240 | nhphan0505 | Power Plant (JOI20_power) | C++17 | 1 ms | 340 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 int ll;
typedef pair<ll, ll> pii;
#define fi first
#define se second
#define gcd __gcd
#define endl '\n'
const int N=200050,M=1000000007;
const ll INF=0x3f3f3f3f3f3f3f3f;
ll n, u, v, cnt[N], dp[N], ans;
bool plant[N], visited[N];
char c;
vector<vector<ll>> adj;
void dfs(ll u){
visited[u]=1;
ll mx=0, ct=0, pos=0;
for(auto v:adj[u]){
if(!visited[v]){
dfs(v);
cnt[u]+=cnt[v];
mx=max(mx, cnt[v]);
if(cnt[v]) ++ct, pos=v;
}
}
if(plant[u]) dp[u]=mx+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... | ||||