PAT乙级1075 链表元素分类 (25 分)

Posted 2021-08-11 辉小歌

题目地址

#include<cstdio>
#include<iostream>
#include<vector>
#include<map>
using namespace std;
const int N=1e5+10;
struct node
{
	int id;
	int val;
}Node[N],ans[N];
int start,n,k;
map<int,int>mp,v,vis;
int main(void)
{
	cin>>start>>n>>k;
	for(int i=0;i<n;i++) 
	{
		int a,b,c; cin>>a>>b>>c;
		mp[a]=c,v[a]=b;
	}
	int index=0;
	while(1)
	{
		Node[index].id=start,Node[index].val=v[start];
		start=mp[start];
        if(Node[index].id>=0) index++;
		if(start==-1) break;
	}
	
	int s=0;
	for(int i=0;i<index;i++) 
	{
		if(Node[i].val<0) ans[s++]=Node[i],vis[Node[i].id]=-1;
	}
	for(int i=0;i<index;i++)
	{
		if(Node[i].val<=k&&vis[Node[i].id]!=-1) ans[s++]=Node[i],vis[Node[i].id]=-1;
	}
	for(int i=0;i<index;i++)
	{
		if(vis[Node[i].id]!=-1) ans[s++]=Node[i],vis[Node[i].id]=-1;
	}
	for(int i=0;i<index;i++)
	{
		printf("%05d %d ",ans[i].id,ans[i].val);
		if(i+1!=index) printf("%05d\\n",ans[i+1].id);
		else printf("-1\\n");
	}
}

#include<cstdio>
#include<iostream>
#include<map>
using namespace std;
const int N=1e5+10;
struct node
{
	int id;
	int val;
}L[N],ans[N];
map<int,int>mp,val,hush;
int st,n,k;
int main(void)
{
	cin>>st>>n>>k;
	for(int i=0;i<n;i++)
	{
		int a,b,c; cin>>a>>b>>c;
		mp[a]=c,val[a]=b;
	}
	int index=0;
	while(1)
	{
		L[index].id=st,L[index].val=val[st];
		if(st>=0) index++;
		st=mp[st];
		if(st==-1) break;
	} 
	n=index;
	index=0;
	for(int i=0;i<n;i++)  if(L[i].val<0) ans[index++]=L[i],hush[i]=-1;
	for(int i=0;i<n;i++)  if(L[i].val<=k&&hush[i]!=-1) ans[index++]=L[i],hush[i]=-1;
	for(int i=0;i<n;i++)  if(hush[i]!=-1) ans[index++]=L[i];
	for(int i=0;i<n;i++)
	{
		if(i+1!=n) printf("%05d %d %05d\\n",ans[i].id,ans[i].val,ans[i+1].id);
		else printf("%05d %d -1\\n",ans[i].id,ans[i].val);
	}
}