oj.uz

답안 #6086

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
6086 2014-06-19T18:24:10 Z baneling100 어르신 집배원 (BOI14_postmen) C++
55 / 100
 500 ms 78032 KB 
#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

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.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 12136 KB Output is correct
2 Correct 12 ms 12032 KB Output is correct
3 Correct 16 ms 12160 KB Output is correct
4 Correct 17 ms 12396 KB Output is correct
5 Correct 12 ms 12168 KB Output is correct
6 Correct 15 ms 12580 KB Output is correct
7 Correct 26 ms 13952 KB Output is correct
8 Correct 12 ms 12416 KB Output is correct
9 Correct 81 ms 24092 KB Output is correct
10 Correct 15 ms 12288 KB Output is correct
11 Correct 16 ms 12416 KB Output is correct
12 Correct 83 ms 24184 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 12032 KB Output is correct
2 Correct 12 ms 12032 KB Output is correct
3 Correct 11 ms 12032 KB Output is correct
4 Correct 16 ms 12416 KB Output is correct
5 Correct 11 ms 12160 KB Output is correct
6 Correct 14 ms 12672 KB Output is correct
7 Correct 31 ms 13928 KB Output is correct
8 Correct 13 ms 12416 KB Output is correct
9 Correct 103 ms 24184 KB Output is correct
10 Correct 15 ms 12396 KB Output is correct
11 Correct 14 ms 12416 KB Output is correct
12 Correct 75 ms 24288 KB Output is correct
13 Correct 109 ms 25208 KB Output is correct
14 Correct 106 ms 22496 KB Output is correct
15 Correct 100 ms 24568 KB Output is correct
16 Correct 113 ms 25160 KB Output is correct
17 Correct 103 ms 20472 KB Output is correct
18 Correct 106 ms 23544 KB Output is correct

Subtask #3
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 12128 KB Output is correct
2 Correct 13 ms 12136 KB Output is correct
3 Correct 11 ms 12032 KB Output is correct
4 Correct 13 ms 12392 KB Output is correct
5 Correct 12 ms 12288 KB Output is correct
6 Correct 14 ms 12672 KB Output is correct
7 Correct 26 ms 13824 KB Output is correct
8 Correct 17 ms 12288 KB Output is correct
9 Correct 71 ms 24212 KB Output is correct
10 Correct 18 ms 12288 KB Output is correct
11 Correct 17 ms 12416 KB Output is correct
12 Correct 83 ms 24288 KB Output is correct
13 Correct 127 ms 25304 KB Output is correct
14 Correct 107 ms 22508 KB Output is correct
15 Correct 112 ms 24568 KB Output is correct
16 Correct 106 ms 25208 KB Output is correct
17 Correct 115 ms 20528 KB Output is correct
18 Correct 124 ms 23648 KB Output is correct
19 Execution timed out 633 ms 78032 KB Time limit exceeded
20 Halted 0 ms 0 KB -