# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
708657 | ToroTN | Factories (JOI14_factories) | C++14 | 8109 ms | 334916 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;
//#include "grader.cpp"
#define ll long long
#define pb push_back
#define X first
#define Y second
const int maxmum=500005,maxlift=25;
vector<pair<int,int> > v[maxmum];
int n,lv[maxmum],par[maxmum][maxlift];
ll dis[maxmum][maxlift],d[maxmum];
void dfs(int u,int p)
{
for(int i=0;i<v[u].size();i++)
{
int node=v[u][i].X,cost=v[u][i].Y;
if(node==p)continue;
lv[node]=lv[u]+1;
dis[node][0]=cost;
d[node]=d[u]+cost;
par[node][0]=u;
dfs(node,u);
}
}
int lca(int a,int b)
{
if(lv[a]<lv[b])swap(a,b);
for(int i=19;i>=0;i--)
{
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... |