1133. Splitting A Linked List (25)
来源:互联网 发布:linux 新建用户 权限 编辑:程序博客网 时间:2024/06/06 12:55
//最后一个测试点错误,不知道错哪里?????????????
#include<cstdio>#include<algorithm>using namespace std;const int maxn=100010;struct Node{ int cla,cla1; int data; int add,next;}node[maxn],ans[maxn];bool cmp(Node a,Node b){ if(a.cla!=b.cla) return a.cla<b.cla; else return a.cla1<b.cla1;}int main(){ int head,n,k; scanf("%d%d%d",&head,&n,&k); for(int i=0;i<n;i++){ int add,data,next; scanf("%d%d%d",&add,&data,&next); node[add].data=data; node[add].add=add; node[add].next=next; if(data<0) node[add].cla=1; else if(data>=0&&data<=k) node[add].cla=2; else node[add].cla=3; }// printf("-----------------\n"); int cnt=0; while(head!=-1){ ans[cnt]=node[head]; ans[cnt].cla1=cnt++; head=node[head].next; } sort(ans,ans+cnt,cmp); for(int i=0;i<cnt;i++){ printf("%05d %d ",ans[i].add,ans[i].data); if(i<cnt-1) printf("%05d\n",ans[i+1].add); else printf("-1\n"); } return 0;}
阅读全文
0 0
- 1133. Splitting A Linked List (25)
- 1133. Splitting A Linked List (25)
- 1133. Splitting A Linked List (25)
- 1133. Splitting A Linked List (25)
- 1133. Splitting A Linked List (25)
- 1133. Splitting A Linked List (25)
- 1133. Splitting A Linked List (25)
- PAT甲级 1133. Splitting A Linked List (25)
- 1133. Splitting A Linked List (25)-PAT甲级真题
- 1133. Splitting A Linked List (25)(结构体)
- PAT 甲级 1133. Splitting A Linked List (25)
- 1133. Splitting A Linked List (25)[链表处理]
- PAT-1133 Splitting A Linked List(链表分解)
- PAT A 1052. Linked List Sorting (25)
- PAT A 1074. Reversing Linked List (25)
- 1097. Deduplication on a Linked List (25)
- 1097. Deduplication on a Linked List (25)
- 1097. Deduplication on a Linked List (25)
- linux----进程间通信
- HibernateUtil升级
- 第一次来到csdn博客
- 正则表达式-简介
- nginx安装
- 1133. Splitting A Linked List (25)
- Git初识
- 正则表达式-语法
- cvFindContours/findContours提取轮廓
- sql基本知识
- nyoj303-序号互换(进制转换)
- 学习python 中的scrapy爬虫框架艰辛路,不推荐看,主要纪录自己学习笔记的
- spring boot
- dispatch-servlet.xml与applicationContext.xml