| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 943574 | abcvuitunggio | Arboras (RMI20_arboras) | C++17 | 5061 ms | 30080 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>
#define int long long
using namespace std;
const int mod=1000000007;
int n,p[100001],d[100001],q,h[100001],tin[100001],tout[100001],pos[100001],nxt[100001],t,res,lazy[400001];
vector <int> ke[100001];
vector <pair <int, int>> ke2[100001];
pair <int, int> mx[100001][2],st[400001];
void dfs(int u){
nxt[u]=u;
tin[u]=++t;
pos[t]=u;
mx[u][0]={d[u],u};
for (int v:ke[u]){
h[v]=h[u]+1;
d[v]+=d[u];
dfs(v);
ke2[u].push_back({tout[v],v});
if (mx[v][0]>mx[u][0]){
mx[u][1]=mx[u][0];
mx[u][0]=mx[v][0];
}
else
mx[u][1]=max(mx[u][1],mx[v][0]);
}
res=(res+mx[u][0].first+mx[u][1].first-d[u]*2)%mod;
nxt[mx[u][0].second]=u;
tout[u]=t;
}
void build(int node, int l, int r){
| # | 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... | ||||