# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
109012 | thebes | Senior Postmen (BOI14_postmen) | C++14 | 1008 ms | 25312 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;
int mo[MN], f, n, m, i, x, y, st[MN];
vector<pair<int,int>> adj[MN];
stack<pair<int,int>> s;
void dfs(int n,int p){
st[n] = 1; s.push({n,p});
for(auto v : adj[n]){
if(v.second==p||mo[v.second]) continue;
else if(st[v.first]){
f = 1;
mo[v.second]=1;
printf("%d ",v.first);
while(s.size()&&s.top().first!=v.first){
mo[s.top().second]=1;
printf("%d ",s.top().first);
s.pop();
}
printf("\n");
}
else dfs(v.first, v.second);
if(f) break;
}
if(s.size()&&s.top().first==n) s.pop();
st[n] = 0;
}
int main(){
for(scanf("%d%d",&n,&m),i=1;i<=m;i++){
scanf("%d%d",&x,&y);
adj[x].push_back({y,i});
adj[y].push_back({x,i});
}
i=1;
while(i<=n){
f=0; 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... |