去重链表

最新推荐文章于 2024-07-17 13:37:15 发布

真的是沐白

最新推荐文章于 2024-07-17 13:37:15 发布

阅读量355

点赞数

分类专栏：思维

本文链接：https://blog.csdn.net/dreamjay1997/article/details/79675463

版权

思维专栏收录该内容

57 篇文章 1 订阅

订阅专栏

题目链接：https://www.patest.cn/contests/gplt/L2-002

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <map>
#include <algorithm>
#include <cstring>

using namespace std;

const int inf = 1e6 + 10;
struct node{
char af[10];
char bf[10];
int val;
}th[inf];

int b[inf];
int s[inf];
int k1, k2;
bool fou[inf];
int main()
{
memset(fou, false, sizeof(fou));
char head[10];
int num;
scanf("%s %d", &head, &num);
getchar();
int k = 0;
for(int i = 0; i < num; i ++){
char u[10], v[10];
int val;
scanf("%s %d %s", &u, &val, &v);
strcpy(th[atoi(u)].af, u);
strcpy(th[atoi(u)].bf, v);
th[atoi(u)].val = val;
//cout << th[atoi(u)].af << " " << th[atoi(v)].bf << endl;
}
while(atoi(head) != -1){
if(!fou[abs(th[atoi(head)].val)]){
fou[abs(th[atoi(head)].val)] = true;
b[k1 ++] = atoi(head);
}else {
s[k2 ++] = atoi(head);
}
strcpy(head, th[atoi(head)].bf);
}
for(int i = 0; i < k1; i ++){
cout << th[b[i]].af << ' ' << th[b[i]].val << ' ';
if(i != k1 - 1) cout << th[b[i + 1]].af;
else cout << -1;
cout << endl;
//cout << b[i] << " ";
}
for(int i = 0; i < k2; i ++){
cout << th[s[i]].af << ' ' << th[s[i]].val << ' ';
if(i != k2 - 1) cout << th[s[i + 1]].af;
else cout << -1;
cout << endl;
//cout << s[i] << ' ';
}
return 0;