# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
58359 | Yehezkiel | Factories (JOI14_factories) | C++11 | 8077 ms | 229504 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;
#define fi first
#define se second
#define mp make_pair
#define eb emplace_back
typedef long long LL;
typedef long double LD;
typedef pair<int,int> pii;
const int logn=19;
const int MAXN=500000;
int par[logn+3][MAXN+5]={},depth[MAXN+5]={};
LL jarak[MAXN+5]={};
vector <pii> node[MAXN+5];
void inisLCA(int now,int _par,int _depth,LL _jarak){
depth[now]=_depth;
jarak[now]=_jarak;
par[0][now]=_par;
for(int i=1;i<logn;i++)
par[i][now]=par[i-1][par[i-1][now]];
for(auto v:node[now])
{
if(v.fi==_par)
continue;
inisLCA(v.fi,now,_depth+1,_jarak+v.se);
}
}
void inisLCA(){
inisLCA(1,0,0,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... |