# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
227313 | Bruteforceman | Senior Postmen (BOI14_postmen) | C++11 | 517 ms | 74236 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 prev dfsdf
forward_list <int> g[500010];
int l[500010], r[500010];
bool del[500010];
int tour[1000010];
bool occ[500010];
int cur;
void dfs(int x) {
while (!g[x].empty()){
int i = g[x].front();
g[x].pop_front();
if(del[i]) continue;
del[i] = true;
int y = l[i] ^ r[i] ^ x;
dfs(y);
}
if(occ[x] == false) {
occ[x] = true;
tour[++cur] = x;
} else {
while(tour[cur] != x) {
int y = tour[cur--];
occ[y] = false;
printf("%d ", y);
}
printf("%d\n", x);
}
}
int main (int argc, char const* argv[])
{
int n, m;
scanf("%d %d", &n, &m);
for(int i = 0; i < m; i++) {
int p, q;
scanf("%d %d", &p, &q);
l[i] = p;
r[i] = q;
g[p].push_front(i);
g[q].push_front(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... |