# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
824111 | alvingogo | The short shank; Redemption (BOI21_prison) | C++14 | 72 ms | 36540 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>
#pragma GCC optimize("Ofast")
#define AquA cin.tie(0);ios_base::sync_with_stdio(0);
#define fs first
#define sc second
#define p_q priority_queue
#define int long long
using namespace std;
struct no{
vector<int> ch;
int dep=-1,dp=0;
};
vector<no> g;
void dfs(int r,int f){
g[r].dep=g[f].dep+1;
g[r].dp=g[r].dep;
for(auto h:g[r].ch){
dfs(h,r);
g[r].dp=max(g[r].dp,g[h].dp);
}
}
vector<int> z;
void dfs2(int r,int f,int y){
pair<int,int> mx(-1,-1);
for(auto h:g[r].ch){
mx=max(mx,{g[h].dp,h});
}
for(auto h:g[r].ch){
if(mx.sc==h){
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |