# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
116049 | MAMBA | Senior Postmen (BOI14_postmen) | C++17 | 614 ms | 62528 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;
#define rep(i , j , k) for (int i = j; i < (int)k; i++)
#define pb push_back
typedef vector<int> vi;
constexpr int N = 5e5 + 10;
int n, m, a[N], b[N];
vector<int> adj[N];
int ptr[N];
bitset<N> mark, mark2;
int st[N], R;
void dfs(int v) {
for (int &id = ptr[v]; id < (int)adj[v].size(); id++) {
int e = adj[v][id];
if (!mark[e]) {
mark[e] = true;
dfs(a[e] ^ b[e] ^ v);
}
}
if (mark2[v]) {
while (mark2[v]) {
printf("%d" , st[R]);
if (st[R] == v) printf("\n");
else printf(" ");
mark2[st[R]] = false;
R--;
}
}
mark2[v] = true;
st[++R] = v;
}
int main() {
scanf("%d%d" , &n , &m);
rep(i , 0 , m) {
scanf("%d%d" , a + i , b + i);
adj[a[i]].pb(i);
adj[b[i]].pb(i);
}
dfs(1);
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... |