# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
31528 | minhtung0404 | Senior Postmen (BOI14_postmen) | C++14 | 632 ms | 141180 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>
const int N = 5e5 + 5;
using namespace std;
set <int> adj[N];
vector <int> mv[N];
int n, m, a, b, cnt;
bool check[N], edge[N];
stack <int> ms;
void dfs(int u){
while (adj[u].size()){
int v = *adj[u].begin();
adj[u].erase(adj[u].begin()); adj[v].erase(u);
dfs(v);
}
if (check[u]){
while (ms.top() != u){
printf("%d ", ms.top());
check[ms.top()] = 0;
ms.pop();
}
printf("%d\n", u);
ms.pop();
check[u] = 0;
}
check[u] = 1;
ms.push(u);
}
int main(){
scanf("%d%d", &n, &m);
for (int i = 0; i < m; i++){
scanf("%d%d", &a, &b);
adj[a].insert(b);
adj[b].insert(a);
}
dfs(1);
}
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... |