# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
10725 | 2014-11-10T11:50:12 Z | dohyun0324 | 어르신 집배원 (BOI14_postmen) | C++ | 433 ms | 46892 KB |
#include<stdio.h> #include<algorithm> using namespace std; int p,n,m,pos[500010],chv[500010],dap[500010],top,cnt,w,che[500010]; struct data { int x,y,z; bool operator<(const data&r)const { return x<r.x; } }arr[1000010]; void dfs(int x) { int i,j; chv[x]=cnt; for(i=pos[x];;i++) { if(p) { dap[++top]=x; if(x==p) { for(j=1;j<top;j++) printf("%d ",dap[j]); printf("%d",dap[top]); printf("\n"); p=0; } else { chv[x]=0; break; } } if(arr[i].x!=x) break; if(che[arr[i].z]) continue; che[arr[i].z]=1; if(chv[arr[i].y]==cnt) { p=arr[i].y; top=0; dap[++top]=x; i++; chv[x]=0; break; } dfs(arr[i].y); } pos[x]=i; } int main() { int i,j,x,y; scanf("%d %d",&n,&m); for(i=1;i<=m;i++) { scanf("%d %d",&x,&y); w++; arr[w].x=x; arr[w].y=y; arr[w].z=i; w++; arr[w].x=y; arr[w].y=x; arr[w].z=i; } sort(arr+1,arr+w+1); for(i=1;i<=w;i++) { if(arr[i].x!=arr[i-1].x) pos[arr[i].x]=i; } for(i=1;i<=n;i++) { while(arr[pos[i]].x==i) { p=0; cnt++; dfs(i); } } return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 384 KB | Output is correct |
2 | Correct | 5 ms | 384 KB | Output is correct |
3 | Correct | 5 ms | 384 KB | Output is correct |
4 | Correct | 8 ms | 512 KB | Output is correct |
5 | Correct | 5 ms | 384 KB | Output is correct |
6 | Correct | 8 ms | 512 KB | Output is correct |
7 | Correct | 12 ms | 768 KB | Output is correct |
8 | Correct | 6 ms | 512 KB | Output is correct |
9 | Correct | 53 ms | 3448 KB | Output is correct |
10 | Correct | 7 ms | 512 KB | Output is correct |
11 | Correct | 6 ms | 512 KB | Output is correct |
12 | Correct | 56 ms | 3576 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 384 KB | Output is correct |
2 | Correct | 4 ms | 384 KB | Output is correct |
3 | Correct | 5 ms | 304 KB | Output is correct |
4 | Correct | 6 ms | 384 KB | Output is correct |
5 | Correct | 6 ms | 384 KB | Output is correct |
6 | Correct | 6 ms | 512 KB | Output is correct |
7 | Correct | 13 ms | 880 KB | Output is correct |
8 | Correct | 5 ms | 512 KB | Output is correct |
9 | Correct | 55 ms | 3464 KB | Output is correct |
10 | Correct | 6 ms | 384 KB | Output is correct |
11 | Correct | 7 ms | 512 KB | Output is correct |
12 | Correct | 56 ms | 3576 KB | Output is correct |
13 | Correct | 71 ms | 9568 KB | Output is correct |
14 | Correct | 66 ms | 4216 KB | Output is correct |
15 | Correct | 58 ms | 4012 KB | Output is correct |
16 | Correct | 74 ms | 9568 KB | Output is correct |
17 | Correct | 69 ms | 4216 KB | Output is correct |
18 | Correct | 65 ms | 5496 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 384 KB | Output is correct |
2 | Correct | 4 ms | 384 KB | Output is correct |
3 | Correct | 4 ms | 384 KB | Output is correct |
4 | Correct | 6 ms | 512 KB | Output is correct |
5 | Correct | 5 ms | 384 KB | Output is correct |
6 | Correct | 7 ms | 512 KB | Output is correct |
7 | Correct | 15 ms | 768 KB | Output is correct |
8 | Correct | 6 ms | 512 KB | Output is correct |
9 | Correct | 54 ms | 3500 KB | Output is correct |
10 | Correct | 6 ms | 384 KB | Output is correct |
11 | Correct | 6 ms | 512 KB | Output is correct |
12 | Correct | 57 ms | 3576 KB | Output is correct |
13 | Correct | 67 ms | 9592 KB | Output is correct |
14 | Correct | 62 ms | 4216 KB | Output is correct |
15 | Correct | 60 ms | 4088 KB | Output is correct |
16 | Correct | 66 ms | 9592 KB | Output is correct |
17 | Correct | 93 ms | 4264 KB | Output is correct |
18 | Correct | 82 ms | 5544 KB | Output is correct |
19 | Correct | 359 ms | 46892 KB | Output is correct |
20 | Correct | 332 ms | 20296 KB | Output is correct |
21 | Correct | 334 ms | 19168 KB | Output is correct |
22 | Correct | 368 ms | 46824 KB | Output is correct |
23 | Correct | 260 ms | 15996 KB | Output is correct |
24 | Correct | 433 ms | 19824 KB | Output is correct |
25 | Correct | 354 ms | 26588 KB | Output is correct |