Rikka with Graph
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1048 Accepted Submission(s): 507
Problem Description
As we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to practice. There is one of them:
Yuta has a non-direct graph with n vertices and n+1 edges. Rikka can choose some of the edges (at least one) and delete them from the graph.
Yuta wants to know the number of the ways to choose the edges in order to make the remaining graph connected.
It is too difficult for Rikka. Can you help her?
Yuta has a non-direct graph with n vertices and n+1 edges. Rikka can choose some of the edges (at least one) and delete them from the graph.
Yuta wants to know the number of the ways to choose the edges in order to make the remaining graph connected.
It is too difficult for Rikka. Can you help her?
Input
The first line contains a number
T(T≤30)
——The number of the testcases.
For each testcase, the first line contains a number n(n≤100) .
Then n+1 lines follow. Each line contains two numbers u,v , which means there is an edge between u and v.
For each testcase, the first line contains a number n(n≤100) .
Then n+1 lines follow. Each line contains two numbers u,v , which means there is an edge between u and v.
Output
For each testcase, print a single number.
Sample Input
1 3 1 2 2 3 3 1 1 3
Sample Output
9
Source
题意:有n个点,n+1条边,问去掉至少一条边还能使图连通的方法有几种。
题解:最少n-1条边能形成通路,直接枚举去掉任意一条边和两条边是否还是树,并查集判断
代码:
#include<cstdio>
int per[110],used[110],u[110],v[110];
int find(int x)
{
if(per[x]==x) return x;
return per[x]=find(per[x]);
}
void merge (int x, int y)
{
int fx = find(x);
int fy = find(y);
if(fx!=fy)
per[fx]=fy;
}
int n;
int judge(int x)
{
for(int i=1;i<=n+1;i++) per[i]=i;
for(int i=1;i<=n+1;i++)
{
if(used[i])
merge(u[i],v[i]);
}
int cnt=0;
for(int j=1;j<=n;j++)
{
if(per[j]==j)
cnt++;
}
if(cnt>1)
return 0;
else
return 1;
}
int main()
{
int t,a,b;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
for(int i=1;i<=n+1;i++)
{
scanf("%d%d",&u[i],&v[i]);
used[i]=1;
}
int ans=0;
for(int i=1;i<=n+1;i++)
{
used[i]=0;
if(judge(i))
ans++;
for(int j=i+1;j<=n+1;j++)
{
used[j]=0;
if(judge(j))
ans++;
used[j]=1;
}
used[i]=1;
}
printf("%d\n",ans);
}
return 0;
}