제출 #922285

#제출 시각아이디문제언어결과실행 시간메모리
922285AndrijaM어르신 집배원 (BOI14_postmen)C++14
55 / 100
520 ms61396 KiB
#include <bits/stdc++.h> using namespace std; const int maxn=5e5+10; int di[4]={1,-1,0,0}; int dj[4]={0,0,-1,1}; int n,m; bool vis[maxn]; vector<pair<int,int>>g[maxn]; vector<int>path; void dfs(int node) { while(!g[node].empty()) { auto ax=g[node].back(); g[node].pop_back(); if(vis[ax.second])continue; vis[ax.second]=1; dfs(ax.first); } path.push_back(node); } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cin>>n>>m; memset(vis,0,sizeof vis); for(int i=0;i<m;i++) { int x,y; cin>>x>>y; x--;y--; g[x].push_back({y,i}); g[y].push_back({x,i}); } dfs(0); int ma[n]; memset(ma,0,sizeof ma); vector<int>a; for(auto ax:path) { a.push_back(ax); ma[ax]++; if(ma[ax]==2) { cout<<ax+1<< " "; a.pop_back(); while(a.back()!=ax) { cout<<a.back()+1<<" "; ma[a.back()]--; a.pop_back(); } cout<<endl; ma[ax]=1; } } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...