# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
109308 | Diuven | Factories (JOI14_factories) | C++14 | 5228 ms | 143736 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 "factories.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef pair<int, lint> pil;
typedef vector<int> Vint;
typedef vector<pil> Vpil;
const lint LNF = 2e18;
const int MAX = 5e5 + 10;
const int LG = 19;
int nu[MAX], ri[MAX], iv[MAX], dep[MAX], n;
int st[MAX][LG];
lint D[MAX];
vector<pil> G[MAX];
void dfs1(int v, int p, int cnt=0, lint sum=0){
static int now = 0;
nu[v] = ++now, ri[v] = nu[v], iv[nu[v]] = v;
dep[v] = cnt, D[v] = sum;
for(pil e:G[v]){
int x; lint c; tie(x,c) = e;
if(x==p) continue;
st[x][0] = v;
for(int i=1; i<LG; i++)
st[x][i] = st[st[x][i-1]][i-1];
dfs1(x,v,cnt+1,sum+c);
ri[v] = ri[x];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |