# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
185354 | nicolaalexandra | Railway (BOI17_railway) | C++14 | 758 ms | 131944 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 <bits/stdc++.h>
#define DIM 1000010
using namespace std;
int whatChain[DIM],positionInChain[DIM],chainFatherNode[DIM],Size[DIM],level[DIM];
int viz[DIM],low[DIM],niv[DIM],b[DIM],E[DIM*3],first[DIM],fth[DIM],p[DIM],v[DIM];
pair <int,int> rmq[20][DIM*3];
map <pair<int,int>,int> mch;
vector <int> chains[DIM],L[DIM],sol;
vector <pair<int,int> > a[DIM];
int n,m,k,i,j,nod,nr_chains,x,y,nr,lca,aux,K;
void dfs (int nod, int tata){
E[++k] = nod;
first[nod] = k;
niv[nod] = 1 + niv[tata];
fth[nod] = tata;
for (auto vecin:L[nod]){
if (vecin != tata){
dfs (vecin,nod);
E[++k] = nod;
}}
}
void pre_dfs (int nod, int tata){
viz[nod] = Size[nod] = 1;
level[nod] = 1+level[tata];
int ok = 0;
for (int i=0;i<L[nod].size();i++){
int vecin = L[nod][i];
if (!viz[vecin]){
ok = 1;
pre_dfs (vecin,nod);
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |