WOJ1240-Perfect Service
来源:互联网 发布:kali linux xfce 编辑:程序博客网 时间:2024/06/03 08:21
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 by exactly 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.
输入格式
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.
输出格式
The output contains one line for each test case. Each line contains a positive integer, which is the perfect service number.
样例输入
6 1 32 33 44 54 60 2 1 2-1
样例输出
21
#include <stdio.h>#include <math.h>#include <string.h>#define N 10007struct 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(){int x,y,i; 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(i=1;i<n;i++) { 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;}
- WOJ1240-Perfect Service
- POJ 3398 Perfect Service
- POJ-3398-Perfect Service
- UVA 1218Perfect Service
- UVa1218 Perfect Service
- 1218 - Perfect Service
- UVa 1218 Perfect Service
- Uva-1218 Perfect Service
- UVA-1218 Perfect Service
- UVA1218 - Perfect Service
- UVa-1228 Perfect Service
- UVA1218 Perfect Service
- UVA 1218 Perfect Service
- POJ 3398 Perfect Service
- poj3398 Perfect Service
- poj 3398 Perfect Service
- POJ 3398 Perfect Service
- UVa1218 Perfect service[树规]
- Magical String问题及解法
- Markdown 语法手册
- 【DATABASE】Left Join /Right Join/Inner Join
- 概念数据模型、逻辑数据模型、物理数据模型详解
- JMeter目录及关键配置分析
- WOJ1240-Perfect Service
- 构造函数,原型,实例三者的关系
- logback logback.xml 常用配置详解
- WebView与JavaScript交互
- php中ob缓存机制
- Cocos2d-x里面如何实现MVC(完)
- 将两张(多张图片)合成一张图片
- 【学习摘记】马士兵JDBC技术_课时15_JDBC处理可更新的结果集
- C++31:继承权限和访问