// testaaaaa.cpp : 定义控制台应用程序的入口点。
//
/*
targin algorithm
*/
#include "stdafx.h"
#include<stdio.h>
#include<iostream>
#include<vector>
using namespace std;
#define n 12
int graph[n][n];
int query[n][n];
int fa[n];
vector<vector<int>> gra(n);
int ancstor[n];
bool visited[n];
int ans[n][n];
int findfa(int x)
{
return (x==fa[x]) ? x:(fa[x]=findfa(fa[x]));
}
void merge(int x,int y)
{
x=findfa(x);
y=findfa(y);
fa[x]=y;
}
void targin(int x,int fa)
{
for(int i=0;i<gra[x].size();i++)
{
int y=gra[x][i];
targin(y,x);
merge(y,x);
}
visited[x]=1;
for(int i=0;i<n;i++)
{
if(visited[i]&&query[x][i])
{
int tmp=findfa(i);
ans[x][i]=ans[i][x]=tmp;
query[x][i]=query[i][x]=0;
}
}
}
int main()
{
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
graph[i][j]=0;
graph[0][1]=1;
graph[1][4]=1;
graph[1][5]=1;
graph[0][2]=1;
graph[2][6]=1;
graph[2][7]=1;
graph[0][3]=1;
graph[7][8]=1;
graph[7][9]=1;
graph[8][10]=1;
graph[9][11]=1;
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
{
if(graph[i][j]!=0)
gra[i].push_back(j);
}
}
for(int i=0;i<n;i++) fa[i]=i;
memset(query,0,sizeof(query));
query[9][8]=1;query[6][11]=1;
query[8][9]=1;query[11][6]=1;
query[4][5]=1;query[5][4]=1;
targin(0,0);
cout<<ans[8][9]<<endl;//is supposed to be 1
return 0;
}
//
/*
targin algorithm
*/
#include "stdafx.h"
#include<stdio.h>
#include<iostream>
#include<vector>
using namespace std;
#define n 12
int graph[n][n];
int query[n][n];
int fa[n];
vector<vector<int>> gra(n);
int ancstor[n];
bool visited[n];
int ans[n][n];
int findfa(int x)
{
return (x==fa[x]) ? x:(fa[x]=findfa(fa[x]));
}
void merge(int x,int y)
{
x=findfa(x);
y=findfa(y);
fa[x]=y;
}
void targin(int x,int fa)
{
for(int i=0;i<gra[x].size();i++)
{
int y=gra[x][i];
targin(y,x);
merge(y,x);
}
visited[x]=1;
for(int i=0;i<n;i++)
{
if(visited[i]&&query[x][i])
{
int tmp=findfa(i);
ans[x][i]=ans[i][x]=tmp;
query[x][i]=query[i][x]=0;
}
}
}
int main()
{
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
graph[i][j]=0;
graph[0][1]=1;
graph[1][4]=1;
graph[1][5]=1;
graph[0][2]=1;
graph[2][6]=1;
graph[2][7]=1;
graph[0][3]=1;
graph[7][8]=1;
graph[7][9]=1;
graph[8][10]=1;
graph[9][11]=1;
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
{
if(graph[i][j]!=0)
gra[i].push_back(j);
}
}
for(int i=0;i<n;i++) fa[i]=i;
memset(query,0,sizeof(query));
query[9][8]=1;query[6][11]=1;
query[8][9]=1;query[11][6]=1;
query[4][5]=1;query[5][4]=1;
targin(0,0);
cout<<ans[8][9]<<endl;//is supposed to be 1
return 0;
}