# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
980781 | fv3 | Senior Postmen (BOI14_postmen) | C++14 | 632 ms | 184004 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;
typedef long long ll;
vector<int> adj[500000];
int start[500000];
unordered_set<int> c[500000];
vector<int> ep;
void euler(int index, int last)
{
c[last].insert(index);
for (; start[index] < adj[index].size();)
{
int node = adj[index][start[index]++];
if (!c[node].count(index))
euler(node, index);
}
ep.push_back(index);
}
int main()
{
int N, M; cin >> N >> M;
for (int i = 0; i < M; i++)
{
int a, b;
cin >> a >> b;
a--; b--;
adj[a].push_back(b);
adj[b].push_back(a);
}
euler(0, 0);
vector<int> occourence(N, -1);
vector<int> linkedList(ep.size(), -1);
iota(linkedList.begin(), linkedList.end(), 1);
for (int i = 0; i < ep.size(); i++)
{
int value = ep[i];
if (occourence[value] != -1)
{
int j = linkedList[occourence[value]];
linkedList[occourence[value]] = i + 1;
for (; j < i; j = linkedList[j])
{
cout << ep[j] + 1 << ' ';
occourence[ep[j]] = -1;
}
cout << ep[i] + 1 << '\n';
continue;
}
occourence[value] = 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... |