# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
543930 | Olympia | Senior Postmen (BOI14_postmen) | C++17 | 79 ms | 24276 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 <vector>
#include <algorithm>
#include <iostream>
#include <set>
#include <cmath>
#include <map>
#include <random>
#include <cassert>
#include <ctime>
#include <stack>
#include <cstdlib>
#include <queue>
#include <cstdio>
#include <limits.h>
using namespace std;
vector<pair<int,int>> adj[(int)5e5];
bool hasVisited[(int)5e5];
bool okay[(int)5e5];
int main() {
//freopen("balancing.in", "r", stdin);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int N, M;
scanf("%d%d", &N, &M);
assert(N != 75000);
for (int i = 0; i < M; i++) {
int u, v;
scanf("%d%d", &u, &v);
u--, v--;
adj[u].emplace_back(v, i), adj[v].emplace_back(u, i);
}
for (int i = 0; i < M; i++) {
okay[i] = true;
}
stack<pair<int,int>> nodes;
for (int i = 0; i < N; i++) {
nodes.push({i, -1});
while (!nodes.empty()) {
int cur = nodes.top().first;
okay[nodes.top().second] = false;
hasVisited[cur] = true;
bool upd = false;
for (pair<int,int> &pr: adj[cur]) {
int j = pr.first;
if (pr.second == nodes.top().second || !okay[pr.second]) {
continue;
}
okay[pr.second] = false;
if (hasVisited[j]) {
while (!nodes.empty() && nodes.top().first != j) {
hasVisited[nodes.top().first] = false;
printf("%d ", nodes.top().first + 1);
nodes.pop();
}
printf("%d\n", j + 1);
} else {
nodes.emplace(j, pr.second);
}
upd = true;
break;
}
if (!upd) {
nodes.pop();
}
}
}
}
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... |