# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
593018 | jhnah917 | Jail (JOI22_jail) | C++14 | 5091 ms | 483328 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;
int N, K, P[22][121212], D[121212], C[121212];
vector<int> G[121212], G2[121212];
vector<pair<int,int>> Type[121212];
int In[121212];
void AddEdge(int s, int e){ G2[s].push_back(e); In[e] += 1; }
void Clear(){
for(int i=1; i<=N; i++) G[i].clear();
for(int i=1; i<=N; i++) G2[i].clear();
for(int i=1; i<=N; i++) Type[i].clear();
fill(In+1, In+N+1, 0);
}
void DFS(int v, int b=-1){
for(auto i : G[v]) if(i != b) P[0][i] = v, D[i] = D[v] + 1, DFS(i, v);
}
int Kth(int v, int k){
for(int i=0; k; i++, k>>=1) if(k & 1) v = P[i][v];
return v;
}
int LCA(int u, int v){
if(D[u] < D[v]) swap(u, v);
int diff = D[u] - D[v];
for(int i=0; diff; i++, diff>>=1) if(diff & 1) u = P[i][u];
if(u == v) return 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |