题目描述:https://zhuanlan.zhihu.com/p/526678876
https://blog.csdn.net/weixin_39765576/article/details/125127298
解法估计会超时,太恶心了。。。。
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
struct Node {
char father[10];
char self[10];
};
int node_index;
struct Node node[3000];
int server_index;
char server[1000][10] = {0};
/* 统计所有的服务器,牛客不能使用uthash,没想到更好的办法了,估计这里会超时 */
void server_add(char *serv)
{
for (int i = 0; i < server_index; i++) {
if (strcmp(server[i], serv) == 0) {
return;
}
}
strcpy(server[server_index++], serv);
}
int main(void)
{
char str[10000] = {0};
char str_error[1000] = {0};
int err_index = 0;
char error[100][10] = {0};
int res_index = 0;
char res[1000][10] = {0};
int left, right;
node_index = 0;
server_index = 0;
scanf("%s", str);
scanf("%s", str_error);
char *tmp;
tmp = strtok(str, ",");
sscanf(tmp, "%[^-]-%s", node[node_index].self, node[node_index].father);
server_add(node[node_index].self);
server_add(node[node_index].father);
node_index++;
while (1) {
tmp = strtok(NULL, ",");
if (tmp == NULL) break;
sscanf(tmp, "%[^-]-%s", node[node_index].self, node[node_index].father);
server_add(node[node_index].self);
server_add(node[node_index].father);
node_index++;
}
tmp = strtok(str_error, ",");
strcpy(error[err_index++], tmp);
while(1) {
tmp = strtok(NULL, ",");
if (tmp == NULL) break;
strcpy(error[err_index++], tmp);
}
/* BFS */
left = 0;
right = err_index;
int size;
char serve_tmp[10];
while (left < right) {
size = right - left;
for (int i = 0; i < size; i++) {
strcpy(serve_tmp, error[left++]);
for (int j = 0; j < node_index; j++) {
if (strcmp(node[j].father, serve_tmp) == 0) {
strcpy(error[right++], node[j].self);
}
}
}
}
int flag;
for (int i = 0; i < server_index; i++) {
flag = 0;
for (int j = 0; j < right; j++) {
if (strcmp(server[i], error[j]) == 0) {
flag = 1;
break;
}
}
if (flag == 0) strcpy(res[res_index++], server[i]);
}
for (int i = 0; i < res_index - 1; i++) {
printf("%s,", res[i]);
}
printf("%s\n", res[res_index - 1]);
return 0;
}