CCC 2011 J5 Unfriend 题解

最新推荐文章于 2021-01-07 20:45:53 发布

jiangtaizhe

最新推荐文章于 2021-01-07 20:45:53 发布

阅读量307

点赞数

分类专栏：题解文章标签： c++ 算法

本文链接：https://blog.csdn.net/jiangtaizhe/article/details/109318990

版权

该博客详细介绍了 CCC 2011 J5 题目，涉及社交网络中的人脉关系。问题要求计算在删除一个人及其邀请的联系人时，有多少种不同的删除组合。输入输出格式和样例数据也进行了说明。博主通过深度优先搜索（DFS）和动态规划（DP）方法进行了题解，并提供了DP状态转移方程。

摘要由CSDN通过智能技术生成

文章目录

- 题面
- 题目翻译
- 题目解析
- - - step 1
    - step2

题面

题目传送门（题目在第10页）
Problem Description
Mark invited some people to join his social network. Some of them invited new people, who
invited new people, and so on. Now there are $N$ people in the network, numbered from $1$ to $N$ .
Mark has decided to remove some people and keep others. There is one restriction: when removing
a person, he will also remove the people s/he invited, and the people they invited, and so on. Mark
will never remove himself, and we do not allow people to be invited by more than one person.
Mark can also decide to not remove anyone.
How many different sets of people can be removed?
Input Specification:
The first line contains a single integer $N$ ( $N \leq 6$ ), the number of people in the network. Next are
$N - 1$ lines telling us who invited each person. To be precise, line i in this set ( $1 \leq i \leq N - 1$ )
contains a single integer $j$ (with $j > i$ ), which indicates that person $j$ is the person who invited
person $i$ . Person $N$ is Mark.
Output Specification:
Output a single integer, the number of possible sets of people that can be removed.
Sample Input 1

3
3
3

Output for Sample Input 1
4
Explanation for Sample 1
The first number of the input indicates there are three people in the network. The next line tells
us that Person 1 was invited by Mark, while the last line tells us that Person 2 was also invited by
Mark. The sets of people that can be removed are $\{\}$ , ${1\}$ , ${2\}$ , ${1,2\}$ .
Sample Input 2
4 3 4 4
Output for Sample Input 2
6 10
Explanation for Sample 2
There are $4$ people in the network. Here is a table of who invited who: