程序员人生网站导航

UVA 818 Cutting Chains (DFS)

栏目：互联网时间：2014-11-05 08:13:33

What a find! Anna Locke has just bought several links of chain some of which may be connected. They are made from zorkium, a material that was frequently used to manufacture jewelry in the last century, but is not used for that purpose anymore. It has its very own shine, incomparable to gold or silver, and impossible to describe to anyone who has not seen it first hand.

Anna wants the pieces joined into a single end-to-end strand of chain. She takes the links to a jeweler who tells her that the cost of joining them depends on the number of chain links that must be opened and closed. In order to minimize the cost, she carefully calculates the minimum number of links that have to be opened to rejoin all the links into a single sequence. This turns out to be more difficult than she at first thought. You must solve this problem for her.

Input

The input consists of descriptions of sets of chain links, one set per line. Each set is a list of integers delimited by one or more spaces. Every description starts with an integer n, which is the number of chain links in the set, where 1 ≤n ≤15. We will label the links 1, 2,..., n. The integers following n describe which links are connected to each other. Every connection is specified by a pair of integers i,j where 1 ≤i,j ≤n and i ≠j, indicating that chain links i and j are connected, i.e., one passes through the other. The description for each set is terminated by the pair ⑴ ⑴, which should not be processed.

The input is terminated by a description starting with n = 0. This description should not be processed and will not contain data for connected links.

Output

For each set of chain links in the input, output a single line which reads

Set N: Minimum links to open is M

where N is the set number and M is the minimal number of links that have to be opened and closed such that all links can be joined into one single chain.

Sample Input	Output for the Sample Input
5 1 2 2 3 4 5 ⑴ ⑴ 7 1 2 2 3 3 1 4 5 5 6 6 7 7 4 ⑴ ⑴ 4 1 2 1 3 1 4 ⑴ ⑴ 3 1 2 2 3 3 1 ⑴ ⑴ 3 1 2 2 1 ⑴ ⑴ 0	Set 1: Minimum links to open is 1 Set 2: Minimum links to open is 2 Set 3: Minimum links to open is 1 Set 4: Minimum links to open is 1 Set 5: Minimum links to open is 1

Sample Input

Output for the Sample Input

5 1 2 2 3 4 5 ⑴ ⑴
7 1 2 2 3 3 1 4 5 5 6 6 7 7 4 ⑴ ⑴
4 1 2 1 3 1 4 ⑴ ⑴
3 1 2 2 3 3 1 ⑴ ⑴
3 1 2 2 1 ⑴ ⑴
0

Set 1: Minimum links to open is 1
Set 2: Minimum links to open is 2
Set 3: Minimum links to open is 1
Set 4: Minimum links to open is 1
Set 5: Minimum links to open is 1

题意：1个环，不完全，问最少open几个才能组成1个完全的环.

#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<limits.h> typedef long long LL; using namespace std; #define REPF( i , a , b ) for ( int i = a ; i <= b ; ++ i ) #define REP( i , n ) for ( int i = 0 ; i < n ; ++ i ) #define CLEAR( a , x ) memset ( a , x , sizeof a ) int mp[15][15]; int vis[15]; int n,cnt; bool ok(int s)//ok判断1个环接2个以上的环的不合法状态, { REP(i,n) { if(s&(1<<i)) continue; int num=0; REP(j,n) { if(s&(1<<j)) continue; if(mp[i][j]) num++; } if(num>2) return true; } return false; } bool dfs(int s,int now,int pre) { vis[now]=1; REP(i,n) { if(!mp[now][i]||(s&(1<<i))||i==pre) continue; if(vis[i]) return true; if(dfs(s,i,now)) return true; } return false; } bool circle(int s)//circle判断成环的不合法状态 { REP(i,n) { if(vis[i]||(s&(1<<i))) continue; cnt++; if(dfs(s,i,⑴)) return true; } return false; } int cal(int s)//计算open环的个数 { return s==0?0:cal(s>>1)+(s&1); } int solve() { int ans=0x3f3f3f; int status=1<<n; REP(stau,status)//枚举状态1：代表open { cnt=0;CLEAR(vis,0); if(ok(stau)||circle(stau)) continue;//ok判断1个环接2个以上的环的不合法状态,circle判断成环的不合法状态 if(cal(stau)>=cnt⑴) ans=min(ans,cal(stau)); } return ans; } int main() { int x,y; int cas=1; while(~scanf("%d",&n)&&n) { CLEAR(mp,0); while(~scanf("%d%d",&x,&y)&&(x!=⑴&&y!=⑴)) mp[x⑴][y⑴]=mp[y⑴][x⑴]=1; printf("Set %d: Minimum links to open is %d ",cas++,solve()); } return 0; }

------分隔线----------------------------

上一篇 SharePoint 2013 通过审计获取文档下载次数

下一篇 JAVA学习第五十七课 ― IO流（十一）

------分隔线----------------------------