# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1096992 | vjudge1 | Factories (JOI14_factories) | C++17 | 2071 ms | 198116 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;
vector<vector<pair<int,long long>>> graph;
vector<vector<int>> sparse(20);
vector<int> in,out,first,depth,loga,col;
vector<long long> dist;
vector<long long> DP1,DP2;
void calc(int u,int p,long long &ans){
DP1[u]=1e15,DP2[u]=1e15;
if(col[u]==0){
DP1[u]=0;
}
else if(col[u]==1){
DP2[u]=0;
}
for(pair<int,long long> &x:graph[u]){
int v=x.first;
long long w=x.second;
if(v!=p){
calc(v,u,ans);
DP1[u]=min(DP1[u],DP1[v]+w);
DP2[u]=min(DP2[u],DP2[v]+w);
}
}
ans=min(ans,DP1[u]+DP2[u]);
}
int tim=0;
void DFS(int u,int p){
sparse[0].push_back(u);
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... |