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;
vector<set<int>> E;
void dfs(int u, int s)
{
int v = *E[u].begin();
E[u].erase(E[u].begin());
E[v].erase(E[v].find(u));
if(v == s)
{
cout<<u<<' ';
return;
}
dfs(v, s);
cout<<u<<' ';
}
int main()
{
int N,M;
cin>>N>>M;
E.assign(N+1,{});
for(int i=0; i<M; i++)
{
int u,v;
cin>>u>>v;
E[u].insert(v);
E[v].insert(u);
}
for(int i=1; i<=N; i++)
{
if(E[i].size() > 1)
{
dfs(i,i);
cout<<endl;
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |