poj 3398 (树上的最小支配集)
?入門題吧。。。
?
Perfect Service
Description A network is composed of?N?computers connected by?N?? 1 communication links such that any two computers can be communicated via a unique route. Two computers are said to be?adjacent?if there is a communication link between them. The?neighbors?of a computer is the set of computers which are adjacent to it. In order to quickly access and retrieve large amounts of information, we need to select some computers acting as?servers?to provide resources to their neighbors. Note that a server can serve all its neighbors. A set of servers in the network forms a?perfect service?if every client (non-server) is served byexactly one?server. The problem is to find a minimum number of servers which forms a perfect service, and we call this number?perfect service number. We assume that?N?(≤ 10000) is a positive integer and these?N?computers are numbered from 1 to?N. For example, Figure 1 illustrates a network comprised of six computers, where black nodes represent servers and white nodes represent clients. In Figure 1(a), servers 3 and 5 do not form a perfect service because client 4 is adjacent to both servers 3 and 5 and thus it is served by two servers which contradicts the assumption. Conversely, servers 3 and 4 form a perfect service as shown in Figure 1(b). This set also has the minimum cardinality. Therefore, the perfect service number of this example equals two. Your task is to write a program to compute the perfect service number. Input The input consists of a number of test cases. The format of each test case is as follows: The first line contains one positive integer,?N, which represents the number of computers in the network. The next?N?? 1 lines contain all of the communication links and one line for each link. Each line is represented by two positive integers separated by a single space. Finally, a 0 at the (N + 1)th line indicates the end of the first test case. The next test case starts after the previous ending symbol 0. A ?1 indicates the end of the whole inputs. Output The output contains one line for each test case. Each line contains a positive integer, which is? Sample Input 6 1 3 2 3 3 4 4 5 4 6 0 2 1 2 -1Sample Output 2 1Source Kaohsiung 2006 |
?
#include <stdio.h> #include <math.h> #include <string.h> #include <iostream> using namespace std; #define N 20010struct node {int to,next; }edge[2*N];int cnt,pre[N]; int n; int mark[N]; int f[N]; int g[N]; int num;void add_edge(int u,int v) {edge[cnt].to=v;edge[cnt].next=pre[u];pre[u]=cnt++; }void DFS(int s) {mark[s]=1;g[num++]=s;for(int p=pre[s];p!=-1;p=edge[p].next){int v=edge[p].to;if(mark[v]==0){f[v]=s;DFS(v);}} }int greedy() {int set[N];memset(set,0,sizeof(set));memset(mark,0,sizeof(mark));int sum=0;for(int i=num-1;i>=0;i--){int k=g[i];if(mark[k]==0){if(set[f[k]]==0){set[f[k]]=1;sum++;}mark[k]=1;mark[f[k]]=1;mark[f[f[k]]]=1;}}return sum; }int main() {while(scanf("%d",&n)&&(n!=-1)){if(n==0) continue;cnt=0;num=0;memset(pre,-1,sizeof(pre));memset(f,0,sizeof(f));for(int i=1;i<n;i++){int x,y;scanf("%d%d",&x,&y);add_edge(x,y);add_edge(y,x);}f[1]=1;memset(mark,0,sizeof(mark));DFS(1);printf("%d\n",greedy());}return 0; }?
轉載于:https://www.cnblogs.com/chenhuan001/archive/2013/03/18/2965858.html
總結
以上是生活随笔為你收集整理的poj 3398 (树上的最小支配集)的全部內容，希望文章能夠幫你解決所遇到的問題。
- 上一篇： 树形控件Tree Control
- 下一篇： 运行管理员线程和用户线程小练习