# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
535908 | sliviu | Senior Postmen (BOI14_postmen) | C++17 | 415 ms | 43800 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;
int main() {
cin.tie(0)->sync_with_stdio(0);
int n, m, x, y;
cin >> n >> m;
vector<vector<pair<int, int>>> G(n + 1);
vector<int> seen(m);
for (int i = 0; i < m; ++i) {
cin >> x >> y;
G[x].emplace_back(y, i);
G[y].emplace_back(x, i);
}
stack<int> cur;
cur.emplace(1);
vector<int> ans;
while (!cur.empty()) {
int top = cur.top();
if (G[top].empty()) {
ans.emplace_back(top);
cur.pop();
}
else {
if (seen[G[top].back().second]) {
G[top].pop_back();
continue;
}
auto [node, e] = G[top].back();
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |