# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
109018 | thebes | 어르신 집배원 (BOI14_postmen) | C++14 | 1089 ms | 42360 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;
const int MN = 5e5+5;
set<int> adj[MN];
int n, m, i, x, y, f, rt, st[MN];
stack<int> s;
void dfs(int n,int p){
st[n]=1; s.push(n);
for(auto v : adj[n]){
if(v==p) continue;
if(v==rt){
adj[n].erase(rt);
adj[rt].erase(n);
int lst = n;
printf("%d ",n);
while(s.size()>1){
s.pop();
int cur = s.top();
printf("%d ",cur);
adj[cur].erase(lst);
adj[lst].erase(cur);
lst = cur;
}
printf("\n");
f = 1;
}
else if(!st[v]) dfs(v,n);
if(f) break;
}
st[n]=0;
if(s.size()&&s.top()==n) s.pop();
}
int main(){
for(scanf("%d%d",&n,&m),i=1;i<=m;i++){
scanf("%d%d",&x,&y);
adj[x].insert(y);
adj[y].insert(x);
}
i=1;
while(i<=n){
f=0; rt=i; dfs(i,-1);
if(!f) i++;
}
return 0;
}
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... |