# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
733978 | DAleksa | Senior Postmen (BOI14_postmen) | C++17 | 1077 ms | 23604 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;
struct edge {
int v;
int id;
};
const int N = 5e5 + 10;
vector<edge> g[N];
int n, m;
vector<int> eulerian_cycle;
bool mark[N];
int cnt[N];
int id = 0;
stack<int> stk;
void find_eulerian_cycle(int u) {
for(edge v : g[u]) {
if(mark[v.id]) continue;
mark[v.id] = true;
find_eulerian_cycle(v.v);
eulerian_cycle.push_back(v.v);
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
//n = m = 33000;
for(int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
//u = i + 1;
//v = i + 2;
//if(v == n + 1) v = 1;
g[u].push_back({v, id});
g[v].push_back({u, id++});
}
find_eulerian_cycle(1);
eulerian_cycle.push_back(1);
stk.push(eulerian_cycle[0]);
cnt[eulerian_cycle[0]]++;
for(int i = 1; i < eulerian_cycle.size(); i++) {
if(cnt[eulerian_cycle[i]] > 0) {
cout << eulerian_cycle[i] << " ";
while(stk.top() != eulerian_cycle[i]) {
cout << stk.top() << " ";
cnt[stk.top()]--;
stk.pop();
}
cout << "\n";
} else {
cnt[eulerian_cycle[i]]++;
stk.push(eulerian_cycle[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... |