# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
31557 | 2017-08-29T09:14:31 Z | Dat160601 | 어르신 집배원 (BOI14_postmen) | C++14 | 500 ms | 17452 KB |
#include <bits/stdc++.h> using namespace std; #define pb push_back #define mp make_pair #define fi first #define se second int n,u,v,m,vis[500007],hav[500007]; vector < pair<int,int> > edge[500007]; stack <int> res; vector <int> ans; void dfs(int k){ stack <int> st; st.push(k); while(!st.empty()){ int u=st.top(),ok=0; for(int i=0;i<(int)edge[u].size();i++){ int v=edge[u][i].fi; int id=edge[u][i].se; if(vis[id]==1) continue; vis[id]=1; ok=1; st.push(v); break; } if(!ok){ ans.pb(u); st.pop(); } } } int main(){ scanf("%d %d",&n,&m); for(int i=1;i<=m;i++){ scanf("%d %d",&u,&v); edge[u].pb(mp(v,i)); edge[v].pb(mp(u,i)); } dfs(1); stack <int> stl; int el=0; for(int i=0;i<(int)ans.size();i++){ u=ans[i]; if(hav[u]){ if(el==1) printf("\n"); while(!stl.empty() && stl.top()!=u){ printf("%d ",stl.top()); hav[stl.top()]=0; stl.pop(); } printf("%d",u); el=1; } else{ hav[u]=1; stl.push(u); } } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 12 ms | 12032 KB | Output is correct |
2 | Correct | 11 ms | 12032 KB | Output is correct |
3 | Correct | 13 ms | 12032 KB | Output is correct |
4 | Correct | 16 ms | 12160 KB | Output is correct |
5 | Correct | 12 ms | 12160 KB | Output is correct |
6 | Correct | 14 ms | 12288 KB | Output is correct |
7 | Correct | 27 ms | 12792 KB | Output is correct |
8 | Correct | 14 ms | 12160 KB | Output is correct |
9 | Correct | 150 ms | 15472 KB | Output is correct |
10 | Correct | 15 ms | 12264 KB | Output is correct |
11 | Correct | 15 ms | 12288 KB | Output is correct |
12 | Correct | 80 ms | 15808 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 13 ms | 12032 KB | Output is correct |
2 | Correct | 14 ms | 12032 KB | Output is correct |
3 | Correct | 14 ms | 12032 KB | Output is correct |
4 | Correct | 19 ms | 12264 KB | Output is correct |
5 | Correct | 12 ms | 12160 KB | Output is correct |
6 | Correct | 16 ms | 12288 KB | Output is correct |
7 | Correct | 25 ms | 12848 KB | Output is correct |
8 | Correct | 12 ms | 12160 KB | Output is correct |
9 | Correct | 146 ms | 15404 KB | Output is correct |
10 | Correct | 13 ms | 12288 KB | Output is correct |
11 | Correct | 12 ms | 12288 KB | Output is correct |
12 | Correct | 81 ms | 15808 KB | Output is correct |
13 | Correct | 91 ms | 17428 KB | Output is correct |
14 | Correct | 86 ms | 16856 KB | Output is correct |
15 | Execution timed out | 1085 ms | 15896 KB | Time limit exceeded |
16 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 12 ms | 12032 KB | Output is correct |
2 | Correct | 11 ms | 12032 KB | Output is correct |
3 | Correct | 11 ms | 12136 KB | Output is correct |
4 | Correct | 18 ms | 12276 KB | Output is correct |
5 | Correct | 14 ms | 12180 KB | Output is correct |
6 | Correct | 14 ms | 12288 KB | Output is correct |
7 | Correct | 28 ms | 12736 KB | Output is correct |
8 | Correct | 12 ms | 12160 KB | Output is correct |
9 | Correct | 141 ms | 15396 KB | Output is correct |
10 | Correct | 14 ms | 12160 KB | Output is correct |
11 | Correct | 13 ms | 12160 KB | Output is correct |
12 | Correct | 85 ms | 15836 KB | Output is correct |
13 | Correct | 91 ms | 17452 KB | Output is correct |
14 | Correct | 96 ms | 16888 KB | Output is correct |
15 | Execution timed out | 1084 ms | 15620 KB | Time limit exceeded |
16 | Halted | 0 ms | 0 KB | - |