# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
912897 | 1075508020060209tc | Senior Postmen (BOI14_postmen) | C++14 | 505 ms | 73676 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.
//#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
//#define int long long
#define X first
#define Y second
#define SZ(x) (int)(x).size()
int n;int m;
int ar[500005];
int br[500005];
vector<int>e[500005];
int eit[500005];
bool vis[500005];
bool visv[500005];
//vector<int>ans;
int ans[600005];
int asz;
void dfs(int nw){
for(;eit[nw]<e[nw].size();eit[nw]++){
int id=e[nw][eit[nw]];
if(vis[id]){continue;}
vis[id]=1;
int v=ar[id]^br[id]^nw;
dfs(v);
}
ans[asz++]=nw;
}
vector<vector<int>>fans;
signed main(){
cin.tie(0);
ios_base::sync_with_stdio(0);
cin>>n>>m;
for(int i=1;i<=m;i++){
cin>>ar[i]>>br[i];
e[ar[i]].push_back(i);
e[br[i]].push_back(i);
}
dfs(1);
stack<int>stk;
for(int i=0;i<asz;i++){
//vector<int>vc;
int v=ans[i];
if(visv[v]){
while(1){
// vc.push_back(stk.back());
cout<<stk.top()<<" ";
if(stk.top()==v){cout<<"\n";break;}
visv[stk.top()]=0;
stk.pop();
}
// fans.push_back(vc);
}else{
visv[v]=1;
stk.push(v);
}
}return 0;
for(int i=0;i<fans.size();i++){
for(int j=0;j<fans[i].size();j++){
cout<<fans[i][j]<<" ";
}cout<<"\n";
}
}
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... |