제출 #980490

#제출 시각아이디문제언어결과실행 시간메모리
980490rumbinSenior Postmen (BOI14_postmen)C++17
0 / 100
1 ms348 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...