# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
205335 | MohamedAhmed04 | Railway (BOI17_railway) | C++14 | 447 ms | 68596 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 ;
const int MAX = 1e5 + 10 ;
int arr[MAX] , sz[MAX] , in[MAX] , out[MAX] , Min[MAX] , Max[MAX] , P[MAX][22] , dep[MAX] , lca[MAX] ;
int n , m , k , tim = 1 ;
vector< vector<int> >adj(MAX) ;
vector< vector<int> >v(MAX) ;
vector< vector<int> >Er(MAX) ;
set<int>s[MAX] ;
vector<int>ans ;
map< pair<int , int> , int>idx ;
void dfs(int node , int par)
{
in[node] = tim++ ;
sz[node] = 1 ;
P[node][0] = par ;
for(int i = 1 ; i < 20 ; ++i)
P[node][i] = P[P[node][i-1]][i-1] ;
for(auto &child : adj[node])
{
if(child == par)
continue ;
dep[child] = dep[node] + 1 ;
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... |