# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
197125 | arnold518 | Railway (BOI17_railway) | C++14 | 406 ms | 33312 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;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 1e5;
int N, M, K;
vector<pii> adj[MAXN+10];
vector<int> A[MAXN+10];
int idx[MAXN+10], cnt, C[MAXN+10];
int par[MAXN+10][30], dep[MAXN+10];
void dfs(int now, int bef, int depth)
{
par[now][0]=bef; dep[now]=depth;
idx[now]=++cnt;
for(auto nxt : adj[now])
{
if(nxt.first==bef) continue;
dfs(nxt.first, now, depth+1);
}
}
int lca(int u, int v)
{
int i, j;
if(dep[u]>dep[v]) swap(u, v);
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... |