# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
151247 | TadijaSebez | Factories (JOI14_factories) | C++11 | 4295 ms | 442172 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 ll long long
#define pb push_back
const ll inf=7e18;
const int N=1000050;
const int L=21;
int n;
vector<pair<int,int>> E[N],B[N];
void AddEdge(int u, int v, int w){ B[u].pb({v,w});B[v].pb({u,w});}
void Build(int u, int p)
{
vector<pair<int,int>> es;
for(auto e:E[u]) if(e.first!=p) es.pb(e);
int last=u;
for(int i=0;i<es.size();i++)
{
AddEdge(last,es[i].first,es[i].second);
if(i+2<es.size())
{
n++;
AddEdge(last,n,0);
last=n;
}
}
for(auto e:es) Build(e.first,u);
}
int go[N][L];
ll dep[N][L];
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... |