freopen 函数

来源：互联网发布：奥比岛刷奥币软件编辑：程序博客网时间：2024/06/06 00:37

题目：1133. Splitting A Linked List (25)

#include <iostream>#include <vector>#include <cstdio>#include <algorithm>using namespace std;struct xnode{    int add,val,next;};xnode node[100000];vector<xnode> p,q,r,ans;int head,n,k;int main(){    freopen("1.txt","r",stdin);    cin>>head>>n>>k;    for(int i=0;i<n;++i)    {        int add,val,next;        cin>>add>>val>>next;        node[add].add=add;        node[add].val=val;        node[add].next=next;    }    int x=head;    while(x!=-1)    {        if(node[x].val<0) p.push_back(node[x]);        else if(node[x].val>=0&&node[x].val<=k) q.push_back(node[x]);        else r.push_back(node[x]);        x=node[x].next;    }    ans=p;    for(auto ln:q) ans.push_back(ln);    for(auto ln:r) ans.push_back(ln);    int al=ans.size();    for(int i=0;i<al-1;++i)        printf("%05d %d %05d\n",ans[i].add,ans[i].val,ans[i+1].add);    printf("%05d %d -1\n",ans[al-1].add,ans[al-1].val);    return 0;}

33218 -4 6823768237 -6 4865248652 -2 1230912309 7 0000000000 0 9999999999 5 2333323333 10 0010000100 18 2777727777 11 -1

阅读全文

0 0