# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
670265 | MilosMilutinovic | Jail (JOI22_jail) | C++14 | 0 ms | 0 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 <iostream>
#include <algorithm>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<iomanip>
#include<ctime>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<bitset>
#include<cassert>
#define pb push_back
#define mk make_pair
using namespace std;
int n,m,go[120005][22],dep[120005],s[120005],t[120005];
void dfs(int v,int pr)
{
go[v][0]=pr;
for(int u:e[v])if(u!=pr)dep[u]=dep[v]+1,dfs(u,v);
}
int lca(int u,int v)
{
if(dep[u]<dep[v])swap(u,v);
for(int i=19;i>=0;i--)if(dep[go[u][i]]>=dep[v])u=go[u][i];
for(int i=19;i>=0;i--)if(go[u][i]!=go[v][i])u=go[u][i],v=go[v][i];
return u==v?u:go[u][0];
}
int deg[120005];vector<int> e[120005];
void init(){for(int i=1;i<=m;i++)deg[i]=0,e[i].clear();}
void adde(int x,int y){deg[y]++;e[x].pb(y);}
bool on(int x,int y,int z){int l=lca(x,y);return in(l,z)&&in(z,x)&&in();}
void solve()
{
scanf("%d",&n);
dfs(1,1);
for(int i=1;i<=n;i++)for(int j=1;j<20;j++)go[i][j]=go[go[i][j-1]][j-1];
scanf("%d",&m);
for(int i=1;i<=m;i++)scanf("%d%d",&s[i],&t[i]);
init();
for(int i=1;i<=m;i++)for(int j=1;j<=m;j++)if(i!=j&&on(s[i],t[i],s[j]))adde(j,i);
}
int main()
{
int t;scanf("%d",&t);
while(t--)solve();
return 0;
}