# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
227653 | arman_ferdous | Senior Postmen (BOI14_postmen) | C++17 | 1094 ms | 11384 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.
/* Author : arman_ferdous
* Date : 28 Apr 2020 14:31:14
* TAG : Noob Problem
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int,int>;
const int N = 5e5+10;
const int M = 1e6+10;
int n, m;
int eptr, to[M], pre[M], last[M];
void add_edge(int u, int v) {
to[eptr] = v;
pre[eptr] = last[u];
last[u] = eptr;
eptr++;
}
int vis[M];
stack<int> st;
void tour(int u) {
for(int i = last[u]; i + 1; i = pre[i]) {
last[u] = pre[i];
if(vis[i]) continue;
vis[i] = 1;
vis[i ^ 1] = 1;
tour(to[i]);
}
st.push(u);
}
stack<int> soln;
int main() {
memset(last, -1, sizeof last);
scanf("%d %d", &n, &m);
for(int i = 0; i < m; i++) {
int u, v; scanf("%d %d", &u, &v);
add_edge(u, v);
add_edge(v, u);
}
tour(1);
for(int i = 1; i <= n; i++) vis[i] = 0;
while(!st.empty()) {
int u = st.top(); st.pop();
if(vis[u]) {
printf("%d ", u);
while(!soln.empty()) {
int v = soln.top(); soln.pop();
if(v == u) break;
printf("%d ", v);
vis[v] = 0;
}
puts("");
}
vis[u] = 1;
soln.push(u);
}
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... |