URAL 1242 Werewolf (DFS)

最新推荐文章于 2019-06-30 15:02:43 发布

原创最新推荐文章于 2019-06-30 15:02:43 发布 · 446 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#URAL #1242 #Werewolf #DFS #有向连通

Talk is cheap Show me the code 同时被 2 个专栏收录

168 篇文章

订阅专栏

ACM-ICPC

154 篇文章

订阅专栏

本文介绍了一个基于C语言实现的算法，该算法通过构建村民之间的亲属关系，并排除特定村民及其祖先和后代的关系，最终找出未受影响的村民。文章详细展示了如何使用结构体、数组等数据结构来管理这些复杂关系。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include <stdio.h>
#define MAX_VILLAGERS 1000

int numOfVillagers;
typedef struct Relative{
	int villager;
	int next;
}Relative;
Relative relativeArray[2 * MAX_VILLAGERS + 1];
int relativeNum;
int ancestorLastAdded[MAX_VILLAGERS + 1];
int descendantLastAdded[MAX_VILLAGERS + 1];
int isHuman[MAX_VILLAGERS + 1];


void addRelative(int head, int relativeLastAdded[], int relative){
	relativeNum++;
	relativeArray[relativeNum].villager = relative;
	relativeArray[relativeNum].next = relativeLastAdded[head];
	relativeLastAdded[head] = relativeNum;
}
void excludeRelatives(int victim, int relativeLastAdded[]){
	isHuman[victim] = 1;
	int relativeIndex;
	for (relativeIndex = relativeLastAdded[victim]; relativeIndex != 0; relativeIndex = relativeArray[relativeIndex].next){
		int villager = relativeArray[relativeIndex].villager;
		//只会单单往ancestor或者单单往descendant深搜
		excludeRelatives(villager, relativeLastAdded);
	}
}

int main(){

	scanf("%d", &numOfVillagers);
	char str[6];
	//注意输入处理
	while (scanf("%s", str) != EOF && str[0] != 'B'){
		int child = 0;
		int i;
		for (i = 0; str[i] != '\0'; i++)
			child = child * 10 + str[i] - '0';
		int parent;
		scanf("%d", &parent);
		addRelative(child, ancestorLastAdded, parent);
		addRelative(parent, descendantLastAdded, child);
	}

	int victim;
	while (scanf("%d", &victim) != EOF){
		//无需再用的数据甭存储，输入后立马处理
		excludeRelatives(victim, ancestorLastAdded);
		excludeRelatives(victim, descendantLastAdded);
	}

	int found = 0;
	int villager;
	for (villager = 1; villager <= numOfVillagers; villager++)
		if (!isHuman[villager]){
			printf("%d ", villager);
			found = 1;
		}
	printf("%s", found ? "\n" : "0\n");
	
	return 0;
}