# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
239538 | dsjong | Railway (BOI17_railway) | C++14 | 241 ms | 37620 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;
vector<int>adj[200005];
int ind[200005], tim[200005];
int dep[200005];
int a[200005]; //actual rmq array (corresponding depths of tour vector)
vector<int>tour;
int timer=0;
void dfs(int i,int p){
tim[i]=timer++;
if(!dep[i]) dep[i]=dep[p]+1;
ind[i]=tour.size();
tour.push_back(i);
for(int j:adj[i]){
if(j!=p){
dfs(j,i);
tour.push_back(i);
}
}
}
int st[200005][20];
void build(int n){
for(int i=0;i<n;i++){
st[i][0]=i;
}
for(int j=1;(1<<j)<=n;j++){
for(int i=0;i+(1<<j)<=n;i++){
if(a[st[i][j-1]]>a[st[i+(1<<(j-1))][j-1]]){
st[i][j]=st[i+(1<<(j-1))][j-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... |