UVA - 1267 Network

Input
Your program is to read the input from standard input. The input consists of T test cases. The number
of test cases (T) is given in the ﬁrst line of the input. The ﬁrst line of each test case contains an integer
n (3 ≤ n ≤ 1, 000) which is the number of nodes of the tree network. The next line contains two
integers s (1 ≤ s ≤ n) and k (k ≥ 1) where s is the VOD server and k is the distance value for ensuring
the quality of service. In the following n − 1 lines, each line contains a pair of nodes which represent
an edge of the tree network.
Output
Your program is to write to standard output. Print exactly one line for each test case. The line should
contain an integer that is the minimum number of the needed replicas.
Sample Input
2

12 2
1 2
2 3
3 4
4 5
5 6
7 5
8 5
4 9
10 3
2 12
12 14
13 14
14 11
14
3 4
1 2
2 3
3 4
4 5
5 6
7 5
8 5
4 9
10 3
2 12
12 14
13 14
14 11
Sample Output
1
0

vector建立边关系，如何判断是叶子节点，从任一点dfs范围搜索

#include <cstdio>
#include <vector>using namespace std;
const int MAX = 1000 + 5;
int cover[MAX], fa[MAX], n, s, k;
vector<int> gr[MAX], nodes[MAX];//gr是边，nodes是该深度的叶子节点void dfs(int u, int f, int d);void dfs2(int u, int f, int d);int main() {int T;scanf("%d", &T);for (int base = 0; base < T; ++base) {for (int i = 0; i < MAX; ++i) {cover[i] = 0, fa[i] = 0, gr[i].clear(), nodes[i].clear();}scanf("%d%d%d", &n, &s, &k);  //有回车可以无视for (int i = 0; i < n - 1; ++i) {int u, v;scanf("%d%d", &u, &v);  //建立双边关系
            gr[u].push_back(v);gr[v].push_back(u);}dfs(s, -1, 0);int ans = 0;for (int h = n - 1; h > k; --h) { //从最深开始for (int j = 0; j < nodes[h].size(); ++j) {int v = nodes[h][j];if (cover[v])continue;for (int i = 0; i < k; ++i) {v = fa[v];}dfs2(v, -1, 0); //从该节点dfsans++;}}printf("%d\n", ans);}
}void dfs2(int u, int f, int d) {cover[u] = 1;for (int i = 0; i < gr[u].size(); ++i) {int v = gr[u][i];if (v != f and d < k)dfs2(v, u, d + 1);}
}void dfs(int u, int f, int d) {fa[u] = f;  //建立父节点int nc = gr[u].size();if (nc == 1 and d > k)nodes[d].push_back(u); //是叶子节点存进去for (int i = 0; i < nc; ++i) {int v = gr[u][i];if (v != f)dfs(v, u, d + 1); //不是叶子节点继续地柜
    }
}

转载于:https://www.cnblogs.com/wangsong/p/7587603.html

UVA - 1267 Network相关推荐

UVA - 315 Network(tarjan求割点)
题目链接:点击查看题目大意:给出一个由n台电脑互相连接而成的网络系统,其中有一些电脑如果一旦损坏,则会造成整个网络出现缺口,导致某些地方无法互相连通,我们称这种电脑为关键点,题目需要求出有多少个关键 ...
OI 刷题记录——每周更新
每周日更新 2016.05.29 UVa中国麻将(Chinese Mahjong,Uva 11210) UVa新汉诺塔问题(A Different Task,Uva 10795) NOIP2012同余 ...
解题报告：【kuangbin带你飞】专题九连通图
目录 A.POJ 1236 Network of Schools(有向图缩点) B.UVA 315 Network(找割点) C.UVA 796 Critical Links(桥) D.POJ 369 ...
kuangbin带你飞专题合集
题目列表 [kuangbin带你飞]专题一简单搜索 [kuangbin带你飞]专题二搜索进阶 [kuangbin带你飞]专题三 Dancing Links [kuangbin带你飞]专题四最短路 ...
算法学习经典例题整理
陆续会对本篇博客进行更新! 搜索:https://vjudge.net/contest/292597 区间DP:https://vjudge.net/contest/293892 树状背包:https ...
[kuangbin带你飞]专题九连通图
A. POJ 1236 Network of Schoolst 题意:有n个学校,每个学校都可以给它名单上的学校发送软件.然后现在问你至少需要给多少个学校发送软件. 思路:求出强连通分量的个数,每一 ...
π-Algorithmist分类题目（2）
原题网站:Algorithmist,http://www.algorithmist.com/index.php/Main_Page π-Algorithmist分类题目(2) Set Theory U ...
紫书《算法竞赛入门经典》
紫书<算法竞赛入门经典>题目一览第3章数组和字符串(例题) UVA 272 TEX Quotes UVA 10082 WERTYU UVA 401 Palindromes UVA 34 ...
kuangbin带你飞专题1-23 题单
kuangbin大神,对于打过ACM比赛的ACMer,无人不知无人不晓. 在此,附上vjudge平台上一位大神整理的[kuangbin带你飞]专题目录链接. [kuangbin带你飞专题目录1-23] ...

UVA - 1267 Network

UVA - 1267 Network相关推荐

最新文章

热门文章