# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
6084 | 2014-06-19T17:45:48 Z | baneling100 | 어르신 집배원 (BOI14_postmen) | C++ | 500 ms | 22112 KB |
#include <stdio.h> #include <algorithm> #include <vector> using namespace std; typedef pair <int,int> ppair; vector <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) { int i, j=A[now].size(); for(i=0 ; i<j ; i++) if(Ban[A[now][i].second]==0) { Ban[A[now][i].second]=1; process(A[now][i].first); } 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
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 14 ms | 12012 KB | Output is correct |
2 | Correct | 19 ms | 12032 KB | Output is correct |
3 | Correct | 16 ms | 12116 KB | Output is correct |
4 | Correct | 17 ms | 12288 KB | Output is correct |
5 | Correct | 14 ms | 12128 KB | Output is correct |
6 | Correct | 20 ms | 12512 KB | Output is correct |
7 | Correct | 30 ms | 13492 KB | Output is correct |
8 | Correct | 16 ms | 12328 KB | Output is correct |
9 | Correct | 153 ms | 19936 KB | Output is correct |
10 | Correct | 15 ms | 12288 KB | Output is correct |
11 | Correct | 17 ms | 12288 KB | Output is correct |
12 | Correct | 84 ms | 20216 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 14 ms | 12084 KB | Output is correct |
2 | Correct | 14 ms | 12032 KB | Output is correct |
3 | Correct | 12 ms | 12160 KB | Output is correct |
4 | Correct | 18 ms | 12416 KB | Output is correct |
5 | Correct | 15 ms | 12160 KB | Output is correct |
6 | Correct | 14 ms | 12416 KB | Output is correct |
7 | Correct | 28 ms | 13372 KB | Output is correct |
8 | Correct | 15 ms | 12336 KB | Output is correct |
9 | Correct | 120 ms | 19832 KB | Output is correct |
10 | Correct | 15 ms | 12264 KB | Output is correct |
11 | Correct | 14 ms | 12288 KB | Output is correct |
12 | Correct | 94 ms | 20216 KB | Output is correct |
13 | Correct | 102 ms | 22112 KB | Output is correct |
14 | Correct | 108 ms | 19168 KB | Output is correct |
15 | Execution timed out | 1074 ms | 19308 KB | Time limit exceeded |
16 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 12 ms | 12160 KB | Output is correct |
2 | Correct | 11 ms | 12032 KB | Output is correct |
3 | Correct | 12 ms | 12080 KB | Output is correct |
4 | Correct | 17 ms | 12416 KB | Output is correct |
5 | Correct | 14 ms | 12160 KB | Output is correct |
6 | Correct | 15 ms | 12416 KB | Output is correct |
7 | Correct | 25 ms | 13364 KB | Output is correct |
8 | Correct | 13 ms | 12288 KB | Output is correct |
9 | Correct | 145 ms | 19852 KB | Output is correct |
10 | Correct | 17 ms | 12288 KB | Output is correct |
11 | Correct | 22 ms | 12288 KB | Output is correct |
12 | Correct | 106 ms | 20256 KB | Output is correct |
13 | Correct | 93 ms | 22008 KB | Output is correct |
14 | Correct | 104 ms | 19084 KB | Output is correct |
15 | Execution timed out | 1090 ms | 19204 KB | Time limit exceeded |
16 | Halted | 0 ms | 0 KB | - |