# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
76450 | nxteru | Factories (JOI14_factories) | C++14 | 7920 ms | 426136 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 <iostream>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long ll;
typedef double D;
typedef pair<int,ll> P;
#define M 1000000007
#define F first
#define S second
#define PB push_back
#define INF 100000000000000000
int n,k,par[500005][19],dp[500005],pre[500005],pro[500005],vs[1000005],id[500005],seg[(1<<21)+1],qx[500005],qy[500005];
ll x[500005],y[500005],ans,dps[1000005];
vector<P>g[500005];
vector<P>G[500005];
vector<int>cm;
vector<int>z;
void dfs(int v,int p,int d,ll da){
dps[k]=da;
vs[k]=v;
pre[v]=k++;
par[v][0]=p;
dp[v]=d;
for(int i=0;i<g[v].size();i++){
if(g[v][i].F!=p)dfs(g[v][i].F,v,d+1,da+g[v][i].S);
}
dps[k]=da;
vs[k]=v;
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... |