# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
583194 | czhang2718 | Pastiri (COI20_pastiri) | C++17 | 627 ms | 83508 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 pair<int, int> pii;
#define f first
#define s second
const int N=5e5+1;
int n, k;
vector<int> adj[N];
bool mark[N];
int dp[N], d[N];
vector<int> ans;
void dfs(int x, int par){
dp[x]=-1;
if(!d[x]) mark[x]=1;
for(int k:adj[x]){
if(k==par) continue;
dfs(k, x);
if(mark[k]) mark[x]=1;
dp[x]=max(dp[x], dp[k]-1);
}
if(mark[x] && dp[x]==d[x]) mark[x]=0;
if(mark[x] && d[par]!=d[x]+1){
ans.push_back(x);
dp[x]=d[x];
mark[x]=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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |