# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
24677 | Bruteforceman | Pipes (CEOI15_pipes) | C++11 | 1478 ms | 13984 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;
int *par;
int *bic;
vector <int> *g;
int *low, *disc;
bitset <100005> vis;
vector <int> l, r;
int root(int x, int *a) {
if(a[x] == x) return x;
return a[x] = root(a[x], a);
}
void join(int x, int y, int *a) {
x = root(x, a);
y = root(y, a);
if(x != y) {
a[x] = y;
}
}
int tym;
void dfs(int x, int parent) {
vis[x] = 1;
low[x] = disc[x] = ++tym;
bool see = false;
for(auto i : g[x]) {
if (!see && i == parent) {
see = true;
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... |
# | 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... |