# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
987695 | anonymous321 | Senior Postmen (BOI14_postmen) | C++17 | 516 ms | 64836 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.
// https://oj.uz/problem/view/BOI14_postmen
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
scanf("%d %d", &n, &m);
vector<vector<int>> adj_list (n);
vector<vector<int>> other_id (n);
vector<int> active (n, 0);
for (int i = 0; i < m; i++) {
int a, b;
scanf("%d %d", &a, &b);
other_id[a-1].push_back(adj_list[b-1].size());
other_id[b-1].push_back(adj_list[a-1].size());
adj_list[a-1].push_back(b-1);
adj_list[b-1].push_back(a-1);
}
stack<int> s {};
s.push(0);
//vector<int> tour {};
vector<bool> in_s2 (n, false);
stack<int> s2 {};
vector<vector<int>> sol {};
while (!s.empty()) {
int v = s.top();
if (adj_list[v].size() > active[v]) {
int it = adj_list[v][active[v]];
int it_id = other_id[v][active[v]];
other_id[adj_list[it][active[it]]][other_id[it][active[it]]] = it_id;
swap(adj_list[it][it_id], adj_list[it][active[it]]);
swap(other_id[it][it_id], other_id[it][active[it]]);
active[it]++;
active[v]++;
s.push(it);
} else {
if (in_s2[s.top()]) {
vector<int> subtour {s.top()};
while (!s2.empty() && s2.top() != s.top()) {
subtour.push_back(s2.top());
in_s2[s2.top()] = false;
s2.pop();
}
sol.push_back(subtour);
} else {
in_s2[s.top()] = true;
s2.push(s.top());
}
s.pop();
}
}
for (auto& it: sol) {
for (int& v: it) {
printf("%d ", v+1);
}
printf("\n");
}
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... |