当前位置:网站首页>Pat 1097 duplication on a linked list (25 points)
Pat 1097 duplication on a linked list (25 points)
2022-07-06 12:08:00 【Python ml】
#include <iostream>
#include <vector>
#include <set>
using namespace std;
struct node{
int address,val;
};
int Data[100005],Next[100005];
int main() {
int first,n,temp;
cin>>first>>n;
vector<node>a(n),a1,a2;
for(int i=0;i<n;i++){
scanf("%d",&temp);
scanf("%d %d",&Data[temp],&Next[temp]);
}
int i=0;
while(first!=-1){
a[i++]={
first,Data[first]};
first=Next[first];
}
set<int>s;
for(int i=0;i<n;i++){
if(s.find(abs(a[i].val))==s.end()){
s.insert(abs(a[i].val));
a1.push_back({
a[i].address,a[i].val});
}else{
a2.push_back({
a[i].address,a[i].val});
}
}
for(int i=0;i<a1.size();i++){
printf("%05d %d ",a1[i].address,a1[i].val);
if(i!=a1.size()-1) printf("%05d\n",a1[i+1].address);
else cout<<-1<<endl;
}
for(int i=0;i<a2.size();i++){
printf("%05d %d ",a2[i].address,a2[i].val);
if(i!=a2.size()-1) printf("%05d\n",a2[i+1].address);
else cout<<-1<<endl;
}
system("pause");
return 0;
}
#include <cstdio>
#include <stdlib.h>
#include <algorithm>
using namespace std;
const int maxn = 100000;
struct NODE {
int address, key, next, num = 2 * maxn;
}node[maxn];
bool exist[maxn];
int cmp1(NODE a, NODE b){
return a.num < b.num;
}
int main() {
int begin, n, cnt1 = 0, cnt2 = 0, a;
scanf("%d%d", &begin, &n);
for(int i = 0; i < n; i++) {
scanf("%d", &a);
scanf("%d%d", &node[a].key, &node[a].next);
node[a].address = a;
}
for(int i = begin; i != -1; i = node[i].next) {
if(exist[abs(node[i].key)] == false) {
exist[abs(node[i].key)] = true;
node[i].num = cnt1;
cnt1++;
}
else {
node[i].num = maxn + cnt2;
cnt2++;
}
}
sort(node, node + maxn, cmp1);
int cnt = cnt1 + cnt2;
for(int i = 0; i < cnt; i++) {
if(i != cnt1 - 1 && i != cnt - 1) {
printf("%05d %d %05d\n", node[i].address, node[i].key, node[i+1].address);
} else {
printf("%05d %d -1\n", node[i].address, node[i].key);
}
}
return 0;
}
边栏推荐
- Embedded startup process
- Navigator object (determine browser type)
- ESP learning problem record
- 关键字 inline (内联函数)用法解析【C语言】
- vim命令行笔记
- STM32 how to locate the code segment that causes hard fault
- Détails du Protocole Internet
- Detailed explanation of Union [C language]
- Gallery's image browsing and component learning
- VSCode基础配置
猜你喜欢
E-commerce data analysis -- salary prediction (linear regression)
电商数据分析--薪资预测(线性回归)
高通&MTK&麒麟 手機平臺USB3.0方案對比
ES6语法总结--下篇(进阶篇 ES6~ES11)
Kaggle竞赛-Two Sigma Connect: Rental Listing Inquiries(XGBoost)
【ESP32学习-2】esp32地址映射
ESP learning problem record
ES6 grammar summary -- Part 2 (advanced part es6~es11)
[esp32 learning-2] esp32 address mapping
Apprentissage automatique - - régression linéaire (sklearn)
随机推荐
ToggleButton实现一个开关灯的效果
Time slice polling scheduling of RT thread threads
Fashion Gen: the general fashion dataset and challenge paper interpretation & dataset introduction
机器学习--决策树(sklearn)
小天才电话手表 Z3工作原理
FreeRTOS 任务函数里面的死循环
Reno7 60W super flash charging architecture
高通&MTK&麒麟 手機平臺USB3.0方案對比
XML file explanation: what is XML, XML configuration file, XML data file, XML file parsing tutorial
Esp8266 uses Arduino to connect Alibaba cloud Internet of things
E-commerce data analysis -- User Behavior Analysis
ESP learning problem record
ESP学习问题记录
GNN的第一个简单案例:Cora分类
冒泡排序【C语言】
R & D thinking 01 ----- classic of embedded intelligent product development process
Internet protocol details
Gallery之图片浏览、组件学习
Navigator object (determine browser type)
Analysis of charging architecture of glory magic 3pro