# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
245198 | m3r8 | Railway (BOI17_railway) | C++14 | 299 ms | 49756 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 <stdio.h>
#include <set>
#include <vector>
#include <algorithm>
#define N 100100
std::vector<int> adj[N];
std::vector<int> lll[N];
int num[N];
int sst[N];
std::vector<int> erg;
std::set<int> avi[N];
std::vector<int> st[N];
std::vector<int> en[N];
int cnt = 1;
int k;
int in[N];
int out[N];
int pre[N][20];
int bef(int v, int u){
if(v == 0)return 1;
if(u == 0)return 0;
return in[u] >= in[v] && out[u] <= out[v];
};
int lca(int v, int u){
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... |