pat 1076

1076. Forwards on Weibo (30)

时间限制

3000 ms

内存限制

32000 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

Weibo is known as the Chinese version of Twitter. One user on Weibo may have many followers, and may follow many other users as well. Hence a social network is formed with followers relations. When a user makes a post on Weibo, all his/her followers can view and forward his/her post, which can then be forwarded again by their followers. Now given a social network, you are supposed to calculate the maximum potential amount of forwards for any specific user, assuming that only L levels of indirect followers are counted.

Input Specification:

Each input file contains one test case. For each case, the first line contains 2 positive integers: N (<=1000), the number of users; and L (<=6), the number of levels of indirect followers that are counted. Hence it is assumed that all the users are numbered from 1 to N. Then N lines follow, each in the format:

M[i] user_list[i]

where M[i] (<=100) is the total number of people that user[i] follows; anduser_list[i] is a list of the M[i] users that are followed by user[i]. It is guaranteed that no one can follow oneself. All the numbers are separated by a space.

Then finally a positive K is given, followed by K UserID's for query.

Output Specification:

For each UserID, you are supposed to print in one line the maximum potential amount of forwards this user can triger, assuming that everyone who can view the initial post will forward it once, and that only L levels of indirect followers are counted.

Sample Input:

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

Sample Output:

4
5

#include <stdio.h>
#include <string.h>
#include <queue>
using namespace std;

int map[1010][1010], vis[1010];
int n, l, k;

struct Node
{
	int level;
	int node;
	int num;
} node[1010];

queue<Node> Q;

void bfs(int t)
{
	Node tmp, tt;
	int i;
	memset(vis, 0, sizeof(vis));

	while(!Q.empty())
		Q.pop();
	
	node[t].level = 0;
	node[t].num = 0;
	node[t].node = t;
	vis[t] = 1;

	Q.push(node[t]);

	while(!Q.empty())
	{
		tmp = Q.front();
		Q.pop();

		int nd = tmp.node;

		for(i = 1; i <= n; i++)
		{
			if(vis[i] == 0 && map[nd][i] == 1 && tmp.level + 1 <= l)
			{
				vis[i] = 1;
				tt.level = tmp.level + 1;
				tt.node = i;
				tt.num = 0;
				node[t].num++;
				Q.push(tt);
			}
		}
	}
}

int main()
{
	int i, j, cnt, a;

	scanf("%d%d", &n, &l);

	for(i = 1; i <= n; i++)
	{
		scanf("%d", &cnt);

		for(j = 1; j <= cnt; j++)
		{
			scanf("%d", &a);
			map[a][i] = 1;  //a的追随者是i
		}
	}

	scanf("%d", &k);

	for(i = 1; i <= n; i++)
		bfs(i);

	for(i = 1; i <= k; i++)
	{
		scanf("%d", &a);
		printf("%d\n", node[a].num);
	}
	return 0;
}
//这道题用dfs一个测试案例超时，一个测试案例错误。超时可以理解，错误不知道为什么，找了很长时间也没发现原因。代码：
#include <stdio.h>
#include <string.h>

int map[1010][1010], vis[1010];
int n, l, k, sum;

void dfs(int t, int level)
{
	int i;

	if(level > l) return;

	vis[t] = 1;

	for(i = 1; i <= n; i++)
	{
		if(vis[i] == 0 && map[t][i] == 1 && level + 1 <= l) //如果i是t的追随者
		{
			sum++;
			dfs(i, level+1);
		}
	}
}

int main()
{
	int i, j, cnt, tmp;

	scanf("%d%d", &n, &l);

	if(l > 6) l = 6;

	for(i = 1; i <= n; i++)
	{
		scanf("%d", &cnt);

		for(j = 1; j <= cnt; j++)
		{
			scanf("%d", &tmp);
			map[tmp][i] = 1; //tmp的追随者是i
		}
	}

	scanf("%d", &k);

	for(i = 1; i <= k; i++)
	{
		scanf("%d", &tmp);
		sum = 0;
		memset(vis, 0, sizeof(vis));
		dfs(tmp, 0);
		printf("%d\n", sum);
	}
	return 0;
}