# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
799401 | future | Election Campaign (JOI15_election_campaign) | C++17 | 195 ms | 32844 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 N=1e5+5;
int n,m;
vector<int>g[N];
int tab[18][N];
int depth[N];
int pos=0;
int in[N];
int out[N];
void DFS(int u,int par) {
pos++;
in[u]=pos;
for(auto v:g[u])
if(v!=par) {
tab[0][v]=u;
depth[v]=depth[u]+1;
DFS(v,u);
}
out[u]=pos;
}
void init() {
depth[1]=1;
DFS(1,0);
for(int i=1; i<=17; i++)
for(int j=1; j<=n; j++)
tab[i][j]=tab[i-1][tab[i-1][j]];
}
int LCA(int u,int v) {
# | 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... |