Submission #6086

#	Time	Username	Problem	Language	Result	Execution time	Memory
6086		baneling100	Senior Postmen (BOI14_postmen)	C++98	55 / 100	633 ms	78032 KiB

postmen

#include <stdio.h>
#include <algorithm>
#include <list>

using namespace std;

typedef pair <int,int> ppair;
list <ppair> A[500001];
int N, M, Ban[500001], Ans[500001], Top, S[500001], Len, Check[500001];

void input(void)
{
    int i, u, v;

    scanf("%d %d",&N,&M);
    for(i=1 ; i<=M ; i++)
    {
        scanf("%d %d",&u,&v);
        A[u].push_back(make_pair(v,i));
        A[v].push_back(make_pair(u,i));
    }
}

void process(int now)
{
    list <ppair> :: iterator it;
    int i, t1, t2;

    it=A[now].begin();
    while(it!=A[now].end())
    {
        t1=(*it).first;
        t2=(*it).second;
        A[now].erase(it);
        if(Ban[t2]==0)
        {
            Ban[t2]=1;
            process(t1);
        }
        it=A[now].begin();
    }
    Ans[++Top]=now;
}

void output(void)
{
    int i;

    for(i=1 ; i<=Top ; i++)
    {
        if(Check[Ans[i]])
        {
            while(S[Len]!=Ans[i])
            {
                printf("%d ",S[Len]);
                Check[S[Len]]=0;
                Len--;
            }
            printf("%d\n",S[Len]);
        }
        else
        {
            Check[Ans[i]]=1;
            S[++Len]=Ans[i];
        }
    }
}

int main(void)
{
    input();
    process(1);
    output();

    return 0;
}

Compilation message (stderr)

postmen.cpp: In function 'void process(int)':
postmen.cpp:27:9: warning: unused variable 'i' [-Wunused-variable]
     int i, t1, t2;
         ^
postmen.cpp: In function 'void input()':
postmen.cpp:15:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&N,&M);
     ~~~~~^~~~~~~~~~~~~~~
postmen.cpp:18:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d",&u,&v);
         ~~~~~^~~~~~~~~~~~~~~

• Subtask 1: 38 / 38
• Subtask 2: 17 / 17
• Subtask 3: 0 / 45