# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1014694 | soumil69 | Putovanje (COCI20_putovanje) | C++17 | 186 ms | 33204 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>
using namespace std;
#define ve vector
#define ll long long
int n,tim,nume,sz;
ve<ve<pair<int,int> > > adj;
ve<int> lete,rite,tin,tout;
ve<ll> seg;
ve<ll> sinc,mulc;
ve<ve<int> > pars;
ve<int> dist;
ve<ll> cost;
int M=20;
void dfs(int cur,int par){
int sz=adj[cur].size();
pars[cur].resize(M,-1);
pars[cur][0]=par;
for(int i=1;i<M;i++){
int pr=pars[cur][i-1];
if(pr==-1){
break;
}
pars[cur][i]=pars[pr][i-1];
}
tin[cur]=tim;
for(int i=0;i<sz;i++){
if(adj[cur][i].first==par){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |