# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
31563 | minhtung0404 | Senior Postmen (BOI14_postmen) | C++14 | 541 ms | 51664 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;
typedef pair <int, int> ii;
vector <ii> adj[N];
vector <int> mv[N];
int n, m, a, b;
int ms[2][N], cnt[2], mi[N], ma[N];
bool check[N], edge[N];
void dfs(){
ms[0][++cnt[0]] = 1;
while(cnt[0]){
int u = ms[0][cnt[0]];
while(mi[u] < ma[u] && edge[adj[u][mi[u]].second]) mi[u]++;
if (mi[u] < ma[u]) {
ms[0][++cnt[0]] = adj[u][mi[u]].first;
edge[adj[u][mi[u]].second] = 1;
mi[u]++;
}
else{
if (check[u]){
while(ms[1][cnt[1]] != u) {
printf("%d ", ms[1][cnt[1]]);
check[ms[1][cnt[1]]] = 0;
cnt[1]--;
}
printf ("%d\n", u);
cnt[1]--;
check[u] = 0;
}
check[u] = 1;
ms[1][++cnt[1]] = u;
cnt[0]--;
}
}
}
int main(){
scanf("%d%d", &n, &m);
for (int i = 0; i < m; i++){
scanf("%d%d", &a, &b);
adj[a].push_back(ii(b, i));
adj[b].push_back(ii(a, i));
}
for (int i = 1; i <= n; i++){
ma[i] = adj[i].size();
}
dfs();
}
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... |