# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1168641 | dombly | Pipes (CEOI15_pipes) | C++20 | 1073 ms | 93108 KiB |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
bool was[N];
int in[N], timer = 0, low[N];
vector<int> g[N];
void Dfs(int x, int p) {
was[x] = true;
low[x] = in[x] = ++timer;
for(int j : g[x]) {
if(j != p) {
if(was[j]) low[x] = min(low[x], in[j]);
else {
Dfs(j, x);
low[x] = min(low[x], low[j]);
if(in[x] < low[j]) cout << x << " " << j << "\n";
}
}
}
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |