天梯赛 - L2-002 链表去重

GG思密达，第二个测试点的三分怎么也拿不上，我还是比较熟悉指针，用指针来写~，写完去上概率论

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

 #include <iostream>
 #include <cstdio>
 #include <cstring>
 #include <algorithm>
 using namespace std;
 const int maxn = 1e5+;
 struct _NODE_
 {
     int addr;
     int key;
     int abskey;
     int Next;
     _NODE_  *NextNode;
 };
 _NODE_ node[maxn];
 int vis[maxn];
 bool cmp(_NODE_ A,_NODE_ B)
 {
     return A.addr<B.addr;
 }
 _NODE_  *Head1 = NULL,*Travel1 = NULL;
 _NODE_  *Head2 = NULL,*Travel2 = NULL;
 void Print(_NODE_ *v1)
 {
     while(v1->NextNode!=NULL)
     {
         v1 = v1->NextNode;
         if(v1->NextNode==NULL)
         {
             printf("%05d %d %d\n",v1->addr,v1->key,v1->Next);
         }
         else
         {
             printf("%05d %d %05d\n",v1->addr,v1->key,v1->Next);
         }
     }
 }
 int main()
 {
     int HeadAddr,n;
     scanf("%d %d",&HeadAddr,&n);
     for(int i=;i<n;i++)
     {
         scanf("%d %d %d",&node[i].addr,&node[i].key,&node[i].Next);
         node[i].abskey = abs(node[i].key);
         node[i].NextNode = NULL;
     }
     sort(node,node+n,cmp);
     int tt = n;
     int NextAddr = HeadAddr;
     Head1 = Travel1 = new _NODE_;
     Head1->NextNode = NULL;
     Head2 = Travel2 = new _NODE_;
     Head2->NextNode = NULL;
     while(tt--)
     {
         int l = ;
         int r = n-;
         while(l<=r)
         {
             int mid = (l+r)/;
             if(node[mid].addr<NextAddr)
             {
                 l = mid+;
             }
             else if(node[mid].addr>NextAddr)
             {
                 r = mid;
             }
             else
             {
                 if(vis[node[mid].abskey])
                 {
                     Travel2->Next = node[mid].addr;
                     Travel2->NextNode = &node[mid];
                     Travel2 = Travel2->NextNode;
                     NextAddr = node[mid].Next;
                 }
                 else
                 {
                     Travel1->Next = node[mid].addr;
                     vis[node[mid].abskey] = ;
                     Travel1->NextNode = &node[mid];
                     Travel1 = Travel1->NextNode;
                     NextAddr = node[mid].Next;
                 }
                 break;
             }
         }
     }
     Travel1->Next = -;
     Travel2->Next = -;
     Print(Head1);
     Print(Head2);
     return ;
 }