# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
31558 | Dat160601 | Senior Postmen (BOI14_postmen) | C++14 | 1093 ms | 17468 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
for(int i=0;i<(int)ans.size();i++){
u=ans[i];
if(hav[u]){
while(!stl.empty() && stl.top()!=u){
printf("%d ",stl.top());
hav[stl.top()]=0;
stl.pop();
}
printf("%d\n",u);
}
else{
hav[u]=1;
stl.push(u);
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |