# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1080239 | jk_ | Pipes (CEOI15_pipes) | C++11 | 2086 ms | 65536 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;
const int N = 100000;
struct ufind {
array<int, N>& c;
ufind(array<int, N>& c) : c(c) { iota(c.begin(), c.end(), 0); }
int find(int k) {
if (c[k] == k) return k;
while (c[k] != c[c[k]])
c[k] = c[c[k]];
return c[k];
}
void unite(int a, int b) { c[find(a)] = find(b); }
};
struct edge { int to; int next; };
array<edge, 4*N> edges;
int edges_i = 0;
array<int, N> g;
int timer=0;
array<int, N> pre;
array<int, N> low;
bitset<2*N> evis;
void dfs(int v) {
pre[v] = low[v] = timer++;
for (int e = g[v]; e != -1; e = edges[e].next) {
# | 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... |